Q. A hash function f defined as f(key) = key mod 7, with linear probing it is used to insert the key 37, 38, 72, 48, 98, 11, 56 into a table index from 0 to 6. What will be the locations of 11?

View solution

Q. The initial configuration of queue is a, b, c, d. ‘a’ is at the front. To get the configuration d, c, b, a how many deletions and additions required:

View solution

Q. Which traversal technique lists the nodes of a binary search tree in ascending order?

View solution

Q. What is the time required to insert an element in a stack with linked implementation ?

View solution

Q. Which of the following statement is false ?

View solution

Q. The algorithm that will efficiently sort an array that is nearly sorted except for the interchange of some adjacent pairs of numbers like : { 1, 3, 2, 5, 4, 6} is:

View solution

Q. The following lists are the degrees of all the vertices of a graph:

(i) 1, 2, 3, 4, 5                (ii) 3, 4, 5, 6, 7
(iii) 1, 4, 5, 8, 6              (iv) 3, 4, 5, 6

then, which of the above sequences are graphic?

View solution

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