Q. Any decision tree that sorts n elements has height

View solution

Q. Match the following .
     List- I                                                    List - II
a. Bucket sort                                      i. O(n^3/gn)
b. Matrix chain multiplication           ii. O(n^3) 
c. Huffman codes                             iii. O(nlgn)
d. All pairs shortest paths               iv. O(n)

code:
a   b   c   d

View solution

Q. Suppose that we have numbers between 1 and 1000 in a binary search tree and we want to search for the number 365. Which of the following sequences could not be the sequence of nodes examined ?

View solution

Q. Converting a primitive type data into its corresponding wrapper class object instance is called

View solution

Q. Consider the following statements-

(a) Depth - first search is used to traverse a rooted tree. 
(b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree.
(c) Huffman's algorithm is used to find an optimal binary tree with given weights.
(d) Topological sorting provides a labelling such that the parents have larger labels than their children.

Which of the above statements are true ?

View solution

Q. The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively.The post order traversal is ______________.

View solution

Q. Level order Traversal of a rooted Tree can be done by starting from root and performing

View solution

Q. The average case occurs in the Linear Search Algorithm when :

View solution

Q. To determine the efficiency of an algorithm the time factor is measured by

View solution

Q. Which of the following algorithms sort n integers, having the range 0 to (n^2 - 1), in ascending order in O(n) time ?

View solution

Q. Which of the following is asymptotically smaller?

View solution

Q. Code blocks allow many algorithms to be implemented with the following parameters:

View solution

Q. Consider f(N) = g(N) + h(N) 
Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? 

View solution

Q. The reverse polish notation equivalent to the infix expression
((A + B) * C+ D)/(E + F + G)

View solution

Q. Superficially the term "object-oriented", means that, we organize software as a

View solution

Q. The number of different spanning trees in complete graph, K4 and bipartite graph, K2,2 have ____ and ____ respectively.

View solution

Q. When a method in a subclass has the same name and type signatures as a method in the superclass, then the method in the subclass ______ the method in the superclass.

View solution

Q. Consider the following operations performed on a stack of size 5:
Push(a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e);
Which of the following statements is correct?

View solution

Q. Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be

View solution

Q. Which of the following is not an inherent application of stack?

View solution