UNIT-5: TWO MARKS QUESTIONS
| Q. no | Question Description |
|---|---|
| 1 | Differentiate full binary tree and complete binary tree. |
| 2 | List out the applications of hashing. |
| 3 | Discuss different types of hash functions. Interpret the ideal characteristics of good hash function. |
| 4 | Define depth of tree. |
| 5 | What is collision? |
| 6 | Write short notes on quadratic probing and double hashing. |
| 7 | What is meant by probing in hashing? |
| 8 | List the properties of binary search tree. |
| 9 | Describe hash table and explain about different hash functions. |
| 10 | Differentiate Binary Tree and Binary Search Tree. |
| 11 | Explain Binary Tree traversal techniques. |
UNIT-5: FIVE MARKS QUESTIONS
| Q. no | Question Description | |||
|---|---|---|---|---|
| 1 | Construct Binary Search Tree for the following elements: 58, 24, 21, 48, 67, 86, 23, 59, 46. Apply deletion operation on the following key elements 21, 24 and 58. | |||
| 2 | With the help of diagrams construct a Binary Search Tree (BST) with the following keys: 50, 12, 44, 96, 80, 57, 74, 6, 49 and 88. | |||
| 3 | Discuss various tree traversal techniques with neat diagrams. | |||
| 4 | Explain the represent the given binary tree using array and Linked List with an example. | |||
| 5 | Construct Binary Search Tree for the following elements: 35, 27, 42, 63, 87, 22, 33, 15, 90, 52, 45. Apply delete operation on the following key elements 27, 52 and 35. | |||
| 6 | Write C functions to perform the following: (i) Inserting a Node into Binary Search Tree. (ii) Finding the Minimum element from Binary Search Tree. | |||
| 7 | Write the recursive algorithms of Tree Traversals and apply the tree traversal techniques like preorder, inorder and postorder on the following tree:  | |||
| 8 | What is meant by Binary Search Tree (BST)? Write a program to implement Binary Search Tree (BST). | |||
| 9 | Using the following traversals, construct the corresponding binary tree: INORDER: H K D B I L E A F C M J G PREORDER: A B D H K E I L C F G J M | |||
| 10 | Discuss about open addressing collision resolution techniques in hashing. | |||
| 11 | Consider a hash table size of 10 using Linear probing insert the keys: 74, 28, 36, 22, 68, 83, 94, 105 into the table. | |||
| 12 | Using the hash function key mod 10, insert the following sequence of keys in the hash table: 50, 700, 76, 80, 96, 73 and 86. Use Quadratic probing technique for collision resolution. | |||
| 13 | Which one of the following hash functions on integers will distribute keys most uniformly over 10 buckets numbered 0 to 9 for i ranging from 0 to 9 or 0 to 99? (i) h(i) = i² mod 10 (ii) h(i) = i³ mod 10 (iii) h(i) = (11 × i²) mod 10 (iv) h(i) = (12 × i) mod 10 | |||
| 14 | Explain how queues are used in Breadth-First Search (BFS) algorithm with a suitable example. |
Comments
Post a Comment