Explain primitive and Non-primitive data types in detail.
[3 marks]Explain Binary Search with example.
[4 marks]Explain Asymptotic Notations in detail.
[7 marks]Differentiate: Static and Dynamic Memory Allocation
[3 marks]Explain linear and Non-linear data structure with example.
[4 marks]What is stack? Explain operations on stack in detail.
[7 marks]What is queue? Explain operations on queue in detail.
Explain advantages of circular queue over Simple queue.
[3 marks]Explain Tower Of Hanoi with example.
[4 marks]Write and explain algorithm for deletion in Singly Linked List.
[7 marks]Evaluate the following postfix expression in tabular form: 3 5 * 6 2 / +
[3 marks]Explain Dequeue and Priority queue in detail.
[4 marks]Write and Explain algorithm for insertion in doubly linked list.
[7 marks]Define the following: 1. Sibling 2. Forest 3. Strictly Binary Tree
[3 marks]Construct BST for following sequence and find inorder traversal for the same. 35, 46, 29, 2, 24 ,68, 44, 57, 1, 22, 79, 71
[4 marks]Explain Prim’s algorithm with suitable example.
[7 marks]Write an algorithm for selection sort.
[3 marks]Differentitae: BFS and DFS.
[4 marks]Explain Kruskal’s algorithm with suitable example.
[7 marks]Explain indexed file organization.
[3 marks]Explain rotation rules for AVL tree.
[4 marks]Explain insertion and deletion in B-tree with example.
[7 marks]Explain random file organization.
[3 marks]Explain collision resolution techniques with example.
[4 marks]Construct AVL tree for following sequence: 10, 20, 30, 40, 50, 60, 70 ,80
[7 marks]