Do As Directed 1. Define Data Structure. 2. Define the asymptotic notation Big-Oh (O) 3. What is Queue Overflow Fetal Error? 4. What is the prerequisite of binary search? 5. Insertion and deletion are easy in linked list as compare to array. State true or false. 6. Which of the following traversal of binary search tree gives data in sorted order? (A) Pre-Order (B) Post-Order (C) In-Order (D) All of these 7. The merge sort algorithm closely follows the ________ approach. (divide-and-conquer, incremental)
[7 marks]Attempt the following 1. Explain the term ‘Analysis of Algorithm’? 2. What is the difference between Static memory allocation and dynamic memory allocation? When each of them is used? Explain with example.
[4 marks]Describe briefly Singly Linked List and a typical Node Structure used for it. What will be a Node Structure for a linked-list representation of a polynomial in three variables? Write an algorithm to Insert a Node at the end of a Singly Linked List.
[7 marks]What is circular linked list? Write an algorithm to insert and delete an element from the circularly linked list.
[7 marks]Write an algorithm to add two one variable polynomials.
[7 marks]What are the operations performed on stack? Write algorithm to insert and delete element from stack.
[7 marks]Define Queue and Circular Queue. How Circular Queue differs from Queue? Write an algorithm for insertion of new element into Circular Queue.
[7 marks]Write an algorithm to convert a parenthesized infix expression, given in the form of a string, into its equivalent postfix expression.
[7 marks]What is hashing function? Explain the following hashing methods a. The Folding Method b. The Division Method c. The Midsquare Method
[7 marks]Construct a binary search tree by inserting following elements in given order and delete any two nodes having two children. 10,5,8,2,6,7,20,15,12,14,25,22,21
[7 marks]Find Postorder : Preorder : A B D G C E H I F1 Inorder : D G B A H E I C F
[7 marks]Define Height Balance Tree (HBT). Explain how to keep the HBT balanced while inserting a node in a balanced HBT. Consider all the possible cases.
[7 marks]1. Write a short note on KWIC indexing. 2. Explain primitive and non – primitive data structures.
[4 marks]Define Graph. Show various representations for undirected, directed and weighted Graph. And also differentiate DFS and BFS using example.
[7 marks]Write a detailed algorithm for Partition-Exchange Sort and also write dry run for the given unsorted data set: 42,23,74,11,65,58,94,36,99,87
[7 marks]What is minimal spanning tree? Find out MST of following graph using Prim’s Algorithm.
[7 marks]Explain Dijkstra’s algorithm in detail.
[7 marks]