What is the difference between linear and non-linear data structures?
[3 marks]Differentiate between primitive and non-primitive data structures with examples.
[4 marks]Explain storage representation methods for different data structures and discuss their impact on algorithm implementation and efficiency.
[7 marks]Explain the Tower of Hanoi with an example.
[3 marks]Explain the memory representation of a one-dimensional and two-dimensional array with examples.
[4 marks]Show the procedure of converting the following infix expression to postfix form using a Stack. (( A – (B + C)) × D) / (E + F)
[7 marks]Define the circular queue and mention its advantages. Write an algorithm to implement the Insert & Delete operation into a Circular Queue.
[7 marks]What is a sparse matrix, and why is it represented differently than a standard matrix?
[3 marks]Define a queue. List three real-time applications of queues with examples.
[4 marks]Analyze the linked list data structure. Compare singly linked lists, doubly linked lists, and circular linked lists in terms of structure, traversal, and applications.
[7 marks]Define the following terms: 1. Degree of vertex, 2. Height of a tree, 3. Balanced binary tree.
[3 marks]Explain the depth-first search operation with an example.
[4 marks]Define a threaded binary tree. What are the advantages and disadvantages of a threaded binary tree? Write down a few applications of a threaded binary tree.
[7 marks]Define graph, and list out three applications of graph.
[3 marks]List the applications of trees. Page 1 of
[2 marks]Given the following traversals, create a binary tree from them. Also, generate the postorder traversal for the same. preorder = {7,10,4,3,1,2,8,11}, inorder = {4,10,3,1,7,11,8,2}.
[7 marks]Generate the inorder, preorder and postorder traversal for the following tree.
[3 marks]List out applications of hashing.
[4 marks]What is a minimum spanning tree? Explain Kruskal’s algorithm for finding a minimum spanning tree with an example.
[7 marks]Define collision in hashing and mention two collision resolution techniques.
[3 marks]Explain the Binary search method.
[4 marks]Explain Sequential, Indexed and Relative/Random File Organization.
[7 marks]Write an algorithm for Bubble sort.
[3 marks]Explain the working of a hashing function with a suitable example.
[4 marks]Sort the following numbers using (i) Selection sort, (ii)Quick sort: [10, 50, 0, 20, 30, 10]. Show the steps. Page 2 of
[2 marks]