Q. What item is at the root after the following sequence of insertions into an empty splay tree:
1, 11, 3, 10, 8, 4, 6, 5, 7, 9, 2 ?

View solution

Q. Suppose we are implementing quadratic probing with a Hash function, Hash (y)=X mode 100. If an element with key 4594 is inserted and the first three locations attempted are already occupied, then the next cell that will be tried is:

View solution

Q. Weighted graph:

View solution

Q. What operation is supported in constant time by the doubly linked list, but not by the singly linked list?

View solution

Q. How much extra space is used by heap sort?

View solution

Q. Binary search algorithm employs the strategy of

View solution

Q. Dangling-else ambiguity can be eliminated by

View solution

Q. If n represents the dimension of cube and K, the radix (no. of nodes along each dimensions) then the number of nodes N of a k-ary n-cube network is:

View solution

Q. The postfix form of the expression (A+B)*C-D/E is:

View solution

Q. The number of nodes in a complete binary tree of height n:

View solution

Q. Data abstraction means:

View solution

Q. The solution of recurrence relation:

T(n) = 2T(sqrt(n)) + lg (n)

is

View solution

Q. The elements 42,25,30,40,22,35,26 are inserted one by one in the given order into a max-heap. The resultant max-heap is sorted in an array implementation as

View solution

Q. Consider the following postfix expression with single digit operands:

623∗/42∗+68∗−

The top two elements of the stack after the second ∗ is evaluated, are:

View solution

Q. A binary search tree is constructed by inserting the following numbers in order:

60, 25, 72, 15, 30, 68, 101, 13, 18, 47, 70, 34

The number of nodes in the left subtree is

View solution

Q. In a ternary tree, the number of internal nodes of degree 1, 2, and 3 is 4, 3, and 3 respectively. The number of leaf nodes in the ternary tree is

View solution

Q. Match List-I with List-II and choose the correct answer from the code given below:

List I (Graph Algorithm) List II (Time Complexity)
(a) Dijkstra’s algorithm (i) O(E lg E)
(b) Kruskal’s algorithm (ii) Θ(V3)
(c) Floyd-Warshall algorithm (iii) O(V2)
(d) Topological sorting (iv) Θ(V+E)

where V and E are the number of vertices and edges in graph respectively.

View solution

Q. In K-coloring of an undirected graph G=(V,E) is a function. c:V→{0,1,…,K−1} such that c(u)≠c(v) for every edge (u,v)∈E.

Which of the following is not correct?

View solution

Q. Consider a singly linked list. What is the worst case time complexity of the best-known algorithm to delete the node a, pointer to this node is q, from the list?

View solution

Q. The second smallest of n elements can be found with ............... comparisons in the worst case.

View solution