1 (a)
Explain linear and non-linear data structure with example.

5 M

1 (b)
What is recursion? State its advantages and disadvantages.

5 M

1 (c)
What is AVL tree? Give example.

5 M

1 (d)
Explain Abstract data type.

5 M

2 (a)
Write any Pattern Matching Algorithm and explain it with suitable example.

10 M

2 (b)
Write a program to implement queue using array.

10 M

3 (a)
Write a program to search an element in an array using binary search technique.

10 M

3 (b)
Write algorithm for heap sort and explain Descending heap with suitable example.

10 M

4 (a)
Hash the following in a table of size 12. Use any two collision resolution technique.

98, 20, 94, 27, 67, 99, 41, 0, 4, 17, 2, 15.

98, 20, 94, 27, 67, 99, 41, 0, 4, 17, 2, 15.

10 M

4 (b)
Write a program to implement a stack ADT using linked list.

10 M

5 (a)
Write and explain QUICK SORT algorithm with suitable example.

10 M

5 (b)
Write an algorithm to traverse a graph using :-

(i) Breadth first search

(ii) Depth first search

(i) Breadth first search

(ii) Depth first search

10 M

6 (a)
Define Binary Tree. Write an algorithm to implement INSERTION and DELETION operation.

10 M

6 (b)
What is Doubly Linked List? Write an algorithm to implement following operations :-

(i) Insertion (All Cases)

(ii) Traversal (Forward and Backward)

(i) Insertion (All Cases)

(ii) Traversal (Forward and Backward)

10 M

Write short notes on (any four)

7 (a)
Shortest Path Algorithm

5 M

7 (b)
Priority and Circular Queue

5 M

7 (c)
Red and Black Tree

5 M

7 (d)
Pattern Matching

5 M

7 (e)
Expression Tree.

5 M

More question papers from Data Structure & Algorithm Analysis