Master in Data Science (SMS, TU) Data Structures and Algorithms Question Paper 2078 (Set Pre-board Examination, p8 (typed; same paper repeated on p10)) Nepal

What is linked list? Compare singly linked list with double linked list. (1 + 2)

Why do we need header node in linked list? Explain circular linked list. (1.5 + 1.5)

Explain importance of sorting. Explain insertion sort. (1.5 + 1.5)

Compare linear search with binary search? What are their time complexities? (2 + 1)

What is hashing? Explain open hashing. (1 + 2)

How can you implement stack using linked list? Explain using suitable program. (6)

OR

How can you implement queue using linked list? Explain using suitable program. (6)

What is singly linked list? How can you insert and remove nodes in a singly linked list? Explain. (2 + 4)

OR

What is doubly linked list? How can you insert and remove nodes in a doubly singly linked list? Explain. (2 + 4)

Explain bubble sort. Hand test bubble sort algorithm with the array of numbers 34, 23, 17, 31, 45, 7, 21, 15, 8, and 1. (2 + 4)

Define searching. Explain binary search algorithm with suitable example. (1 + 5)

Explain linear probing. Suppose, the set of keys is $\{7, 12, 14, 10, 49, 58, 9, 50\}$, $m = 10$, and $h(x) = x \bmod 10$. Show the effect of successively inserting these keys using linear probing.