Define Data structure. List various primitive and non-primitive data structure with examples
[7 marks]Explain various operations that can be performed on Data Structure.
[7 marks]What is stack? List the various applications of stack. Write the algorithm to implement push and pop operations on stack.
[7 marks]Give differences between the following:
[7 marks]Linear queue and circular queue (ii) Arrays and Linked List
[ marks]Convert the following expression from infix to postfix using Stack data structure. Show all the intermediate steps used in achieving the postfix form: (A+B) * (C+D) / (E+F)
[7 marks]Alist of nodes with following data is available as: 2, 3, 4, 5, 6. Write an algorithm to insert node with value "1" at the beginning and node with value "7" end of a singly linked list. Write the output after each operation.
[7 marks]Generate Binary tree using following traversal. i. Inorder : H,D,B,I,E,A,F,J,C,K,G,L ii. Postorder : H,D,I,E,B,J,F,K,L,G,C,A Also perform the Preorder Traversal from the binary tree.
[7 marks]Explain 2-3 Trees in detail by taking suitable example.
[7 marks]Write an algorithm to delete the node at the beginning of the list and node from the end of a singly linked list for the following data: 11, 22, 23, 54, 58, 69, 99.. Write the output after each operation.
[7 marks]Write short note on threaded storage representation of binary tree. Page 1 of
[2 marks]Write an algorithm for binary searching. Generate the Binary Search Tree for the following data: 42, 23, 74, 11, 65, 58, 94, 36, 99, 87
[7 marks]Give difference between BFS and DFS. Consider any graph and perform DFS and BFS on it.
[7 marks]Explain matrix and list representation of a graph with the help of a suitable example.
[7 marks]Explain hash function and collision resolution techniques with suitable examples.
[7 marks]What is the divide-and-conquer approach? Write the algorithm of Merge Sort. Sort the following data using Merge Sort. 22, 35, 47, 14, 21, 63, 12, 46
[7 marks]Explain heap sort using max heap to sort the data given below. While constructing the heap, indicate clearly all the changes required to be done in each step. Data: 39, 16, 45, 89, 61, 72, 22, 48, 54
[7 marks]In a Height-Balanced Tree, what are the cases causing imbalance and how rebalancing is done in such cases. Write a step-by-step method (taking one number at a time) to develop Height-Balanced Tree (by rebalancing at each stage in case of imbalance) for the following sequence of numbers: 12, 6, 9, 11, 10, 4, Page 2 of
[2 marks]