Data Structures and Algorithm Analysis
Questions 111 to 120
111.

Which of the
following belongs to the algorithm paradigm?


112.

If f,_{ }t: N→ R^{+}, then t
(n) Î Ω (f
(n)), iff f(n) Î O (t (n)) is known as


113.

How many children do an external node of a binary tree of order N
contains?


114.

To calculate
c(i, j )’s, w( i, j)’s and r(i, j)’s; Howmuch time does the OBST algorithm in
worst case takes?


115.

Which of the following in breadth first search uses data structures as
an auxiliary structure to hold nodes for future processing?


116.

The number of loop(s) of a node in a simple graph of ‘N’ nodes is


117.

The time taken
by NPclass sorting algorithm is


118.

Pick the correct
one from the following by reading carefully the below statements
I. Floyd’s algorithm takes n^{3}
among of time.
II. Warshall’s algorithm takes n^{3}
among of time.


119.

What defines the
average case for the functions f, g : N –> R^{} for all n,
lt
_{n –>} f(n)/g(n) =


120.

For the
functions f, g : N –> R^{}
for all n, f(n) = n and
g(n) = n log n then

Answers
111.

Answer : (b)
Reason: Remaining all belongs to divide and conquer
paradigm.

112.

Answer : (c)
Reason: According to the asymptotic notation rules.
And this rule is used to apply the limit rule for the omega notated values.

113.

Answer : (d)
Reason: Because, the leaf nodes can’t have the
children.

114.

Answer : (c)
Reason: Because, we have to calculate all c(i, j
)’s, w( i, j)’s and r(i, j)’s for the tree of ‘n’ identifiers.

115.

Answer : (a)
Reason: As in BFS, all the adjacent nodes are
traversed first, before traversing the descendent nodes. And hence a queue is
used.

116.

Answer : (c)
Reason: Because, the simple graph should not contain
any loop in the entire graph.

117.

Answer : (e)
Reason: Here only one loop from one to n is there.
And hence it runs for ‘n’ times only.

118.

Answer : (d)
Reason: As there are three nested loops running from
1 to n in both of the algorithms. And hence it is O(n^{3})

119.

Answer : (b)
Reason: According to the limit rules for big Oh
notation.

120.

Answer : (a)
Reason: According to the limit rules for big Oh
notation.

Great and Useful Article.
ReplyDeleteJava Online Course
Java Online Training
Java EE training
Java Course in Chennai
Java Training in Chennai
Java Training Institutes in Chennai
Java Interview Questions
Java Interview Questions