UNIT-IV
Short Answer Type
1. Define Hashing
2. Define a leaf node in a Tree
3. Rephrase what is Complete Binary Tree
4. Rephrase what is the height of a tree
5. How many binary trees are possible with four nodes?
6. What are the applications of Hashing?
7. What is the collision resolving techniques?
8. What is the need of collision resolving techniques in hashing?
Long Answer Type
1. Define hash function? Explain the following hash functions with an example
I. Division method
II. Multiplication method
III. Mid Square method
IV. Folding method
2. Perform the Linear probing with the elements 8, 26, 37, 51, 11, 36, 42 with table size
10.
3. Perform the double hashing with the elements 8, 26, 37, 51, 11, 18, 22 with table size
10.
4. The following elements are inserted into an empty hash table with hash function
f(x)=x%17 and quadratic probing. Explain how the elements are inserted into the hash
table. 58, 48, 79, 46, 54, 32, 24, 19, 18, 35, 15, 84, 16, 12.
5. Outline the Binary Search Tree concept and write an algorithm to search an element
in the Binary Search Tree.
6. Model a C program to implement Binary Tree Traversals in a recursive approach
7. Illustrate the binary search tree for the following keys: 55, 42, 89, 34, 67, 78, 40, 22,
12, 56, 88, 65, 26, 98, 102, and also Perform In-order, pre-order, and post-order
traversal for the resultant binary search tree. How can a binary search tree be used
for sorting the keys?
8. Illustrate a Binary tree for the given In-order and Post-order traversals by explaining
the intermediate steps.
In-order Traversal is {4, 8, 2, 5, 1, 6, 3, 7}
Post-order Traversal is {8, 4, 5, 2, 6, 7, 3, 1}
9. Explain the operations performed on a binary search tree (BST) in detail.
10.Explain the collision resolution techniques with Examples.
UNIT-V
Short Answer Type
1. Define Graph
2. Define spanning tree
3. Explain the degree of vertex
4. Recognize which nodes are called as adjacent nodes.
5. List any two differences between graphs and trees.
Long Answer Type
1. Illustrate a short note on Graph terminology and outline the properties of a Graph.
2. Illustrate Linked List representation and matrix representation of Graphs for the
below example
3. Illustrate Linked List representation and matrix representation of Graphs for the
below example.
4. Define the following.
i. Complete graph
ii. Connected graph
iii. Directed graph
iv. Undirected graph
v. Weighted graph
5. Define the following.
i) Walk ii) Trail iii) Path iv) Cycle v) Tree
6. Explain different types of graphs with an example.
7. Consider the following graphs and compute the following
i) Vertex set(V)
ii) Edge set(E)
iii) Degree of all the vertices
iv) In degree and out degree of all the vertices
v) Identify the possible paths between the vertices (A, D)
8. Explain about different applications of the graphs?
