B.TECH - Semester 3 data structures and algorithms Question Paper 2021 (oct)
Practice authentic previous year university questions for better exam preparation.
Sample Questions
- How is delelion done in a doubly linked list? 3 Give some applications of stack.
- What do you mean by a complele binary Iree?
- How are graphs represented using adjacency malrix?
- What is storage compaction? 7 Whal are buddy systems?
- Wrile an algorithm for binary search.
- How is hashing done using mid-square melhod? 10 What do you mean by digil analysis? Answer one full question from each module. Each question carries 20 marks.
- (a) Write an algorithm to perform polynomial addition using linked lists and explain.
- (b) What are sparse matrices? How is il useful? 5
- (c) Write an algorithm lo insert an element inlo a circular linked list.
- (a) Dislinguish between lop-down and bollom-up styles of program development.
- (b) Write an algorithm to perform multiplication on 2 sparse malrices and explain.
- (c) How is running time of a program calculated? Explain with an example.
- (a) Write an algorithm to convert and inlix expression to poslix expression Explain with an example.
- (b) Explain insertion algorilinm and deletion algorithm in DEQUEUE with an example.
- (a) Write an algorilkm lo periorm insertion and deletion in a binary search tree and explain with an example. Show what happens when the rool node is deleled.
- (b) Explain in order, preorder and postorder lraversals in binary lrees. 15 (a) Give the algorithm for marking accessible cells. Whal are the flaws in this algorilhm?
- (b) How is memory management done in buddy systerns? 15 (a) Give the algorithms for first-II and best-II strategies and comparer these algorilhms.
- (b) Explain dynamic memory allocation using boundary lag method. 10 Madute IV 17 (a) Write the algorithm for quick sort. Explain with an example Deduce the expressions for best and worst running limes of qulck sort.
- (b) Explain briefly aboul dynamic hashing.
- (a) Give an algorilhm for inserling and deleting an element in a heap.
- (b) Write the algorithm for insertion sort and deduce the expressions for best, worst and average running times. ( $4 \times 20=80$ Marks)