Question 71 : What is the total time spent for N-1 merges in a dynamic equivalence problem?
1. O(N)
2. O(log N)
3. O(N log N)
4. O(M log N)
View Answer   Discuss with Members

Question 72 : What is the definition for Ackermann's function?
1. A(1,i) = i+1 for i>=1
2. A(i,j) = i+j for i>=j
3. A(i,j) = i+j for i = j
4. A(1,i) = i+1 for i<1
View Answer   Discuss with Members

Question 73 : What is the Height of the root node of ternary tree?
1. 1
2. 2
3. 3
4. 0
View Answer   Discuss with Members

Question 74 : How many extra nodes are there in Full K-ary tree than complete K-ary tree?
1. 1
2. 2
3. 3
4. Both have same number of nodes
View Answer   Discuss with Members

Question 75 : What is the depth of the root node of the ternary tree?
1. 2
2. 1
3. 0
4. 3
View Answer   Discuss with Members

Question 76 : Can leaf node be called child node in a K-ary tree?
1. True
2. false
3.
4.
View Answer   Discuss with Members

Question 77 : Can leaf node be called child node in a ternary tree?
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 78 : What is the worst case of finding the nearest neighbour?
1. O(N)
2. O(N log N)
3. O( log N)
4. O(N³)
View Answer   Discuss with Members

Question 79 : The expression obtained by recursively producing a left expression, followed by an operator, followed by recursively producing a right expression is called?
1. prefix expression
2. infix expression
3. postfix expression
4. paranthesized expression
View Answer   Discuss with Members

Question 80 : What is the time complexity for inserting a key or integer in Van Emde Boas data structure?
1. O (log M!)
2. O (M!)
3. O (M²)
4. O (log (log M))
View Answer   Discuss with Members