## AVL Tree

1. The balance factor for an AVL tree is either (a) 0,1 or –1 (b) –2,–1 or 0 (c) 0,1 or 2 (d) All the above 2. What is the maximum height of any AVL-tree with 7 nodes? Assume that

## Hashing

1. If h is any hashing function and is used to hash n keys in to a table of size m, where n

## Tree

1. The height of a BST is given as h. Consider the height of the tree as the no. of edges in the longest path from root to the leaf. The maximum no. of nodes possible in the tree is?

## Heap in Data Structure

1. Which of the following sequences of array elements forms a heap? (a) {23, 17, 14, 6, 13, 10, 1, 12, 7, 5} (b) {23, 17, 14, 6, 13, 10, 1, 5, 7, 12} (c) {23, 17, 14, 7, 13,

## Queue in Data Structure

QUEUE 1. How many stacks are required to implement a queue? (a) 1 (b) 2 (c) 3 (d) 4 2. How many queues are needed to implement a stack? (a) 1 (b) 2 (c) 3 (d) 4 3. Suppose implementation

## Stack in Data Structure

1. Which of the following is an application of Stack data structure? (a) Evaluation of postfix expression (b) Function calls management (c) Balancing of symbols (d) All of the above 2. What data structure would you mostly likely see in

## Sorting in Data Structure

1. Select the sorting that always has a time complexity O(n2 ),irrespective of the condition of array. (a) Bubble sort (b) Selection sort (c) Quick sort (d) Merge sort 2. You have to sort a list L consisting of a

## Linked List in Data Structure

1. Let P be a singly linked list. Let Q be the pointer to an intermediate node x in the list. What is the worst-case time complexity of the best known algorithm to delete the node x from the list?