Q: If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :
A. less than 1
40%
B. less than n.
22%
C. less than m.
21%
D. less than m.
21%
Solution: Here is no explanation for this answer
Q: Choose the correct option.
The postfix form of the expression is (A+B) * (C*D-E)*F/G is
A. AB+CD*E-FG/**
49%
B. AB+CD*E-*F*G/
21%
C. AB+CD*E-F**G/
15%
D. AB+CDE*-*F*G/
15%
Solution: Here is no explanation for this answer
Q: Choose the correct option.
Merging 4 sorted files containing 50, 10, 25 and 15 records will take____time
A. O(100)
47%
B. O(200)
20%
C. O(175)
13%
D. O(125)
20%
Solution: Here is no explanation for this answer
Q: Choose the correct option.
What data structure would you mostly likely see in a nonrecursive implementation of a recursive algorithm?
A. Stack
72%
B. Linked list
12%
C. Queue
8%
D. Trees
8%
Solution: Here is no explanation for this answer
Q: Choose the correct option.
Let the following circular queue can accommodate maximum six elements with the following data
front = 2 rear = 4
queue = _______; L, M, N, ___, ___
What will happen after ADD O operation takes place?
A. front = 2 rear = 5 queue = ______; L, M, N, O, ___
53%
B. front = 3 rear = 5 queue = L, M, N, O, ___
16%
C. front = 3 rear = 4 queue = ______; L, M, N, O, ___
15%
D. front = 2 rear = 4 queue = L, M, N, O, ___
16%
Solution: Here is no explanation for this answer
Q: Choose the correct option.
An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of
A. f(n) x g(n)
24%
B. Max ( f(n),g(n))
40%
C. Min (f(n),g(n))
13%
D. f(n) + g(n)
24%
Solution: Here is no explanation for this answer
Q: Choose the correct option.
Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?
A. Deleting a node whose location in given
23%
B. Searching of an unsorted list for a given item
16%
C. Inverting a node after the node with given location
36%
D. Traversing a list to process each node
25%
Solution: Here is no explanation for this answer
Q: Choose the correct option.
In Breadth First Search of Graph, which of the following data structure is used?
A. Stack.
20%
B. Queue.
65%
C. Linked List.
11%
D. None of these.
4%
Solution: Here is no explanation for this answer
Q:
Choose the correct option.
6, 8, 4, 3, and 1 are inserted into a data structure in that order. An item is deleted using only a basic data structure operation. If the deleted item is a 1, the data structure cannot be a ?