Title Data structure and algorithm question model set.pdf ✅

Tribhuvan University Faculty of Humanities and Social Science Semester: III Subject: Data Structure and Algorithm Set 1 Group B Attempt any SIX questions. [6x5=30] 2. What is data-structure? Describe stack and queue data structure with suitable example 3. What are some examples of dynamic programming algorithms? How dynamic programmings differ from greedy algorithms? Explain 4. What is stack? Why do we use stacks? What operations can be performed on stacks? 5. What is a recursive function? write down program for simulating Fibonacci series. 6. How can a singly linked list be implemented so that insertion requires no test for whether head is null? 7. Draw the expression tree a*(b+c)*(d*e+f). 8. What are the main operations of priority queue? Explain. Group C Attempt any TWO questions. [2 x 10 = 20] 9. Trace the algorithm to convert given infix to postfix expressions: a. (A + B)*C+D/(E+F*G)-H b. ((H*((((A+((B+C)*D))*F*)*G)*E))+J) 10. How would you remove a node from a doubly Linked list? Explain with suitable example and algorithm. 11. Write a complete menu driven program for performing various operation in array implementation of circular queue. Don’t Forget to Follow Uni Bytes
Tribhuvan University Faculty of Humanities and Social Science Semester: III Subject: Data Structure and Algorithm Set 2 Group B Attempt any SIX questions. [6x5=30] 2. What do you mean by all pair shortest path problem? Describe Floyd Warshall algorithm. 3. What is stable sort? List out any two stable sorting techniques with example. 4. What is queue? What are main drawbacks of linear queue over circular queue? 5. What do you mean by rotation operation in AVL tree? 6. What is stack? How it is differ.r from queue? Show that stack and queue as ADT. 7. Draw a hash table with open addressing and a size of 9. Use the ha function "k%9". Insert the keys: 5, 29, 20, 0, 27 and 18 into your table (in that order). 8. Mention how to insert a new node in linked list where free node will be available? Group C Attempt any TWO questions. [2 x 10 = 20] 2. What is use of Huffman algorithm? Explain Huffman algorithm with suitable example. 3. What is linear queue? How it is differ from priority queue? Write down algorithms for enqueue and dequeue operation for linear queue. 4. What is doubly linked list? How it is differ from singly linked list? Describe deletion of node from DLL. Don’t Forget to Follow Uni Bytes
Tribhuvan University Faculty of Humanities and Social Science Semester: III Subject: Data Structure and Algorithm Set 3 Group B Attempt any SIX questions. [6x5=30] 2. What do you mean by hash collision? Insert following data item into hash table of size 15 by using any one of the hash collision method. (44, 15, 30, 45, 55, 78, 90, 115, 35, 10, 33) 3. What is heap sort? Sort following data items by using heap sort: A[]={3,5,6,77,32,54,1,4} 4. Write complete recursive C program for TOH problem used in recursion. 5. What is the concept behind priority queue? Write C methods for inserting and deleting elements form priority queue. 6. Sort following data items by using quick sort: A []=(33,25,16,87,32,54,12,4) 7. Create binary search tree for following list of elements: (95, 73, 19, 98, 11, 17, 2, 70, 44, 169, 89, 409) and display the In-order, pre-order and post-order traversal of that tree. 8. What are the advantages of circular list over singly linked list? How to delete specific node from singly linked list? Explain. Group C Attempt any TWO questions. [2 x 10 = 20] 9. Construct expression tree of given expression A $ B + C / D * E. Convert following infix expression to their equivalent postfix expression by using stack. A$B+C/D+E+(F+G-H/I/J) 10. What do you mean by spanning tree and minimum spanning tree? Describe Prim's algorithm for finding MST of given graph with suitable example. 11. What do you mean by divide and conquer algorithm? Write down algorithm. for quick sort and trace the algorithm for following data items: A[]={8, 3, 4, 77, 23, 5, 7, 3, 9, 1, 19) Don’t Forget to Follow Uni Bytes
Tribhuvan University Faculty of Humanities and Social Science Semester: III Subject: Data Structure and Algorithm Set 4 Group B Attempt any SIX questions. [6x5=30] 2. Define Binary Tree. Write on algorithm to implement different tree traversal techniques. 3. Write an algorithm for merge sort and comment on its complexity. 4. Hash the following in a table of size 11. Use any two collision resolution technique. 99 67 41 0 17 2 98 20 94 27 5. Explain Huffman Algorithm. Construct Huffman tree for "MAHARASHTRA" with its optimal code. 6. What is heuristic algorithm? How it is differ from approximation algorithm? Explain. 7. What are the application areas of priority queue? Show that priority queue act as an ADT. 8. Evaluate following postfix expressions by using stack: AB-CDEF/+G-*-H- Where, A = 4, B = 8, C = 2, D = 5, E = 6, F = 9, G = 1, H = 3 Group C Attempt any TWO questions. [2 x 10 = 20] 9. Write a program to implement Quick sort and show the steps to sort the following elements by Quick sort method: 19, 27, 5, 9, 86, 4, 5 10. What do you mean by postfix expression? Trace the algorithm to convert following infix expression to their equivalent postfix expression by using stack. A/B*(C$D+E*F) + (G*H/I) 11. What are the advantages of linked list over array? How to create node in circular linked list? Write down algorithm for inserting node to circular linked list. Don’t Forget to Follow Uni Bytes