Master in Data Science (SMS, TU) Data Structures and Algorithms Question Paper 2081 (Set page 7; First Assessment 2081) Nepal

Define ADT. Why do you need dynamic memory allocation? (1 + 2)

Explain big-oh (O) notation with example. (3)

What are the benefits of using circular queue over linear queue? (3)

Define tail recursion. Write a recursive function to find greatest common divisor of two numbers. (1 + 2)

Compare singly linked list with doubly linked list. What are the benefits of using doubly linked list? (1.5 + 1.5)

Explain algorithm to convert an infix expression to postfix. Use this algorithm to convert the infix expression $A / B * (C - D) + E$ to postfix. (3 + 3)

OR

How do you implement queue using linked list? Explain. (6)

Explain priority queue in detail. What are different ways to implement priority queue? (2 + 4)

OR

What do you mean by overflow and underflow? Explain algorithm to evaluate postfix expression using stack. (2 + 4)

How can you insert and remove nodes in singly liked list? Explain. (6)

Why do you need header node in linked lists? Explain circular linked list with example. (2 + 4)

What is external sorting? Trace the execution of quick sort algorithm with the array of numbers 34, 23, 17, 31, 45, 7, 21, 15, 8, and 3. (1 + 5)