Q. The compiler converts all operands up to the type of the largest operand is called

View solution

Q. _____________ comparisons  are necessary in the worst case  to find both the maximum and minimum of n numbers.

View solution

Q. Let A and B be two n x n matrices,The efficient algorithm to multiply the two matrices , has the time complexity

View solution

Q. Assuming there are n keys and each key is in the range [0, m - 1]. The run time of bucket sort is

View solution

Q. You have to sort a list L, consisting of a sorted list followed by a few 'random' elements. Which of the following sorting method would be most suitable for such a task?

View solution

Q. A full binary tree with n leaves contains

View solution

Q. How many PUSH and POP operations will be needed to evaluate the following expression by reverse polish notation in a stack machine (A * B) + (C * D/E)?

View solution

Q. Consider an array A[20. 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11,5]? Assume row major storage.

View solution

Q. Convert the following infix expression into its equivalent post fix expression (A + B^D)/(E - F) + G

View solution

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