Data Structures — DU B. Voc – Software Development Previous Year Question Papers

((Software Development) 1. Write short notes on the following : (i) Binary search tree (ii) Circular linked list (iv) Stack and its features (vii) Linear and non-linear data structures (vili) Complete and almost complete binary tree (x) Bubble and insertion sort (3*10) 2. (a) What is a linked list? Illustrate its advantages and disadvantages. (3) (b) Write an algorithm to insert a node at the beginning and end of a singly linked list. (6) (c) Write an algorithm to delete a node from the end and any specific position from a circular linked list. (6) 3. (a) What are the advantages of complete binary tree? Explain the operations of complete binary tree with (5) suitable examples. (b) Determine the sequential representation of the following binary tree using an array: (5) (c) Write an appropriate algorithm for the recursive tower of Hanoi problem (for more than one disk in the system). (5) 4. (a) Evaluate the following postfix expression : (b) Convert the following arithmetic expression using stack : (i) from infix to postfix (ii) from infix to prefix 5. (a) Construct a binary search tree with the following elements: Then delete the elements 120 and 70 from the constructed binary tree. (7) (b) Consider the following elements : Insert these elements into an empty binary tree of order 5. (8) (a) Write an algorithm to determine the factorial of any number using recursion in any programming language. (7) (b) What is the difference between singly and doubly linked list. Write the algorithm to delete a node at any position from the doubly linked list. (8) 7. (a) Differentiate between max-heap and min heap. Construct a min heap H using the following data: Show heap after cach insertion. (8) (b) In the hash table of size m=10 insert the keys 43, 135, 72, 23, 99, 19, 82 using linear probing.