What is time complexity? Explain big oh notation with example. [5]
Background and Concept of Data Structures
1.
Define ADT. Explain array as an ADT. [5]
Graph
1.
Explain adjacency matrix representation of graphs with example. [5]
List
1.
Explain singly linked list with example. Compare singly linked list with doubly linked list. [5]
Queue
1.
Explain priority queue with example. What is circular queue? [5]
Recursion
1.
What are the benefits of using recursion? Write a recursive function to find nth Fibonacci number. [5]
Searching
1.
Explain collision and collision resolution in hashing. What is double hashing? [5]
2.
Write short notes on: a) Linear Search Write short notes on: b) Minimum Spanning Tree [2.5+2.5]
Sorting
1.
Explain quick sort algorithm. Use this algorithm to sort the numbers 35, 82, 18, 54, 13, 31, 20, 69, and 19. [10]
Stack
1.
How stack is used in recursion? Explain different stack operations. Explain algorithm to convert an infix expression to postfix using stack. [10]
Tree
1.
Explain complete binary tree with example. Starting with an empty binary search tree, show the effect of successively adding the following elements: 47, 50, 25, 27, 17, 61, 5, and 26. Also, traverse the resulting tree in pre-order, in-order, and post-order. [5]
2.
Explain different applications of binary tree. [5]