PART-A

1.Define Linked List

2.List the applications of stacks.

3.State the rules to be followed during infix to postfix conversions.

4.What do you mean by level of tree?

5.What is meant by strongly connected in a graph.

6.Define adjacency list.

7.Define Radix Sort.

8.Write the properties of Binary Heap.

9.Compare Linear Search and Binary Search .

10.Show the result of IN ORDER ,PREORDER,POST ORDER traversal for given binary search tree

PART-B

11.a)

or

b)

12.a)what is dequeue?, explain its operation with an example.

Or

b)

13.a) Outline Preorder,inorder and postorder traversal on a binary tree with an algorithm and an
example

Or

b)Explain the various applications of graph.

14.a)Outline the steps in Dijkstra algorithm with an example.

Or

b) Write and explain the prim’s algorithm and depth first search algorithm.
15.a)Write an algorithm to implement the selection sort.

Or

b.i) State the explain the Shell sort. State and explain the algorithm for Shell Sort.Sort the elements
using shell sort.(7)

ii)Explain open addressing in detail(6)

PART-C