Part A - Questions

Questions
1) What is the output of selection sort after the 2nd iteration given the following
sequence? 16 3 46 9 28 14
2) Define binary tree, Graph
3) Define tree– traversal and mention the type of traversals.
4) Define indegree and out degree of a graph
5) Name the different ways of representing a graph? Give examples
6) What is mid square method?
7) How to handle collision?
8) What are AVL Tress?
9) Draw the expression tree for (a + b * c ) + ((d * e + f) * g)
10) What do you mean by articulation point

Part B - Questions

1) Write an algorithm for binary search with suitable example.

2) Given the input { 4371, 1323, 6173, 4199, 4344, 9679, 1989 } and a hash
function of h(X)=X (mod 10) show the resulting:
a. Separate Chaining hash table
b. Open addressing hash table using linear probing
3) Explain Breadth First Search algorithm with example?
4) What is topological sort? Write an algorithm to perform topological sort?
5) Construct an expression tree for the expression (a+b*c) + ((d*e+f)*g). Give
the outputs when you apply inorder, preorder and postorder traversals. .
6) Create a binary search tree for the following numbers start from an empty
binary search tree. 45,26,10,60,70,30,40 Delete keys 10,60 and 45 one after
the other and show the trees at each stage.
7) Perform Quick Sort
8) Perform Merge Sort
9) Find the Minimum Spanning Tree using Prims Algorithm.
10) Find the Shortest path using Dijkstra’s Algorithm.