Data Structure and Algorithms most VVI
Unit 1
1. Explain the Asymptotic Notation with their types. [8]
2. Define analysis. Explain the types of analysis. [2+6=8]
3. Define Data structure. Explain its types. [2+6=8]
Unit 2
1. Define Stack. Write down some application of stacks. [2+6=8]
2. Discuss how Insert and delete data on stack with their examples. [8]
3. Define queue. Explain its types. [2+6=8]
4. Discuss how Insert and delete any data in queue at all position with examples. [8]
5. Write down some Application of queue. [6]
Unit 3
1. Define List. Explain its types. [2+6=8]
2. Discuss how we insert and delete data in singly list at position. [8]
3. Discuss how we Insert and delete data in doubly list at position. [8]
Unit 4
1. Write a program recursive and fabonnic series. [8]
2. Write some difference between Recursive and iteration. [8]
3. Describe TOH algorithm with using three elements with examples. [8]
Unit 5
1. Define tree. Explain AVL tree. [2+6=8]
2. Define tree traversal. Explain tree travsal. [2+6=8]
3. Discuss how we Insert and delete element in BST. [8]
Unit 6
1. Define sorting. Explain its types. [2+6=8]
2. Define bubble sort. Write down Algorithm of Bubble sorting with examples. [2+6=8]
3. Define heap and merge sort. Explain and write the algorithm of heap and merge sort with
examples. [2+6=8]
4. Write down Algorithm of insert and delete data by using sorting. [8]
5. Write down the some Uses of sorting. [6]
Unit 7
1. Define hashing with examples. [8]
2. Define sequential and binary search. [4]
3. Define hash function and hash table. Explain collision resolution technique (open and closed).
[2+6=8]
4. Explain Collision of hashing with examples. [8]
5. Describe the Tree search algorithm with examples. [8]
Unit 8
1. Explain about of Graph and its types. [8]
2. Define Path and cycle with diagram. [6]
3. Explain the array-based representation with examples. [8]
4. Explain the Kruskal's Algorithm with example. [8]
5. Describe the prism's algorithm with examples. [8]
6. Explain BFS and DFS with examples. [8]
7. Write a short note about shortest path algorithm. [4]
Some Numerical problem
1. Draw the binary search tree(BST) for: [8]
20,30,15,10,5,40,50,60,35,55,45,80,90
2. Sort the following data in array using bubble sort: [8]
5,2,1,4,3,7,6
3. Construct an AVL tree for the following sequence of data: [8]
21,26,30,9,4,14,28,15,10,2,3,7
4. Sort the following data in array by using the selection sort technique: [8]
40,30,55,11,90,40,99,20,29
5. Convert the following infix expression to prefix and postfix: [8]
A^B*CD+E/F/(G+H)
6. Sort the following number using merge and bubble sort: [8]
32,8,15,11,21,6,25
7. Draw the binary search tree for: [8]
Pre order: ABCEIFJDGHKL
In order: EICFJBGDKHLA
8. Draw the BST of following data: [8]
14,15,9,7,18,3,5,16,4,20,17,9,14,5
9. Sort the following set of numbers using bubble and insertion sort: [8]
27,38,39,0,22,18,7,15
10. Convert the following infix expression to postfix and prefix epression. [8]
A$B*C-D+E/F/(G+H)
SHORT NOTES: [ALL ARE IN 4 MARKS]
1. LINEAR QUEUE
2. LINKED LIST
3. HASHING
4. BST AND DFT
5. HASH FUNCTION AND HASH TABLE
6. AVL TREE
7. MERGE SORT
8. BIG O, BIG OHAM,BIG THETA
9. RECURSION AND ITERATION
10. GRAPH REPRESENTATION
BEST OF LUCK
