Data Structures and Algorithm Analysis
Questions 191 to 200
191.

One has implemented the queue with
a circular array, keeping track of first, last, and count
(the number of items in the array). Suppose first is zero, and last
is SIZE1. What can you tell me about count?


When we say
the order of a tree is M, we mean


Find the
odd one out from the following categories of algorithms


This algorithm scans the list by swapping the entries whenever pair of
adjacent keys are out of desired order.


The
mathematical definition for Omega can be defined as, provided f,g:NàR+ and c is a positive constant and
n > n0,


Let f, t:
N→ R+, then t (n) Î
Ω (f (n)), iff f(n) Î O (t (n)) is known as what?


The q notation is


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


From the
following chose the one which belongs to the algorithm paradigm other than to
which others from the following belongs to.


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

Answers
191.

Answer : (c)
Reason : This
is the case where either the list is full or the list the made empty after it
was full.

Answer : (d)
Reason : Here
in the answer ‘can’ is most important. That is “every nonleaf node ‘can’ have at most M subtrees.


Answer : (a)
Reason : This
one belongs to NPClass category.


Answer : (b)
Reason : Bubble
sort only is the algorithm from the given options which compares the adjacent
keys


Answer : (e)
Reason : According
to the mathematical definition of the Asymptotic notations.


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


Answer : (e)
Reason : Because
q
notation is equivalence relationship in nature.


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


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


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

No comments :
Post a Comment