What is DS? Explain data structure and its types.
[3 marks]Explain Tower of Hanoi with example.
[4 marks]Write algorithms to insert, and delete elements in queue
[7 marks]Construct Binary Tree where the preorder traversal is 1,2,4,5,3,6,8,9,7 & postorder is 4,5,2,8,9,6,7,3,1.
[3 marks]Construct an AVL Tree by inserting numbers from 1 to 8.
[4 marks]What is stack? Explain operations on stack in detail.
[7 marks]Explain tree traversal in detail with example.
Explain 2-3 Tree in brief.
[3 marks]Explain any three hashing techniques with example.
[4 marks]What is problem with simple queue? Explain its solution with example and algorithms.
[7 marks]Explain binary search technique.
[3 marks]Explain fastest sorting technique with example.
[4 marks]What is collision? Explain collision resolution techniques with example.
[7 marks]List all asymptotic notations and explain any one of it.
[3 marks]List and explain linked list applications.
[4 marks]What is doubly linked list? Write Algorithm for insertion and deletion in doubly linked list.
[7 marks]What is file? Explain types of files.
[3 marks]Convert the following infix expressions to their prefix. (A^B*C-D+E/F/(G+H))
[4 marks]Explain Prim’s & Kruskal’s algorithm with suitable example
[7 marks]Explain malloc and free functions in ‘C’.
[3 marks]Define the following: 1. Sibling 2. Forest 3. Complete Binary Tree 4. Complete Graph
[4 marks]Explain following: (i) Recursion (ii) Nonprimitive data structures (iii) Hashing (iv) Non- linear data structures (v) sparse matrix (vi) Priority queue (vii) Collision
[7 marks]What is time complexity? Explain with example.
[3 marks]Explain Binary Search with example.
[4 marks]Write and explain algorithm for insertion in Singly Linked List1
[7 marks]