Data Structure Online Test 5

.

The process of accessing data stored in a tape is similar to manipulating data on a

.

Which of the following algorithm design technique is used in the quick sort algorithm?

.

Linked lists are not suitable for which of the following problems?

.

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

.

The OS of a computer may periodically collect all the free memory space to form contiguous block of free space. This is called

.

What is the following code segment doing?

void fn( ){

char c;

cin.get(c);

if (c != ‘\n’) {

fn( );

cout.put(c);

}

}

.

You have to sort a list L consisting of a sorted list followed by a few “random” elements.Which of the following sorting methods would be especially suitable for such a task?

.

B Trees are generally

.

A technique for direct search is

.

If a node having two children is deleted from a binary tree, it is replaced by its

.

The searching technique that takes O (1) time to find a data is

.

A mathematical-model with a collection of operations defined on that model is called

.

The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is

.

The complexity of multiplying two matrices of order m*n and n*p is

.

Merging 4 sorted files containing 50, 10, 25 and 15 records will take____time

.

For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is equal to

.

In worst case Quick Sort has order

.

A full binary tree with 2n+1 nodes contain

.

If a node in a Binary Search Tree has two children, then its inorder predecessor has

.

The number of leaf nodes in a complete binary tree of depth d is