Does the Data Structures and Algorithms 2080 paper come with solutions?

Yes. Every question on this Data Structures and Algorithms past paper includes a step-by-step solution, plus instant AI feedback when you attempt it on Kekkei.

Master in Data Science (SMS, TU) Data Structures and Algorithms Question Paper 2080 Nepal

Master in Data Science (SMS, TU)Sa

45marks

120min

10questions

This is the official Master in Data Science (SMS, TU) Data Structures and Algorithms question paper for 2080, as set in the Sa examination. It carries 45 full marks and a time allowance of 120 minutes, across 10 questions. On Kekkei you can attempt this Data Structures and Algorithms past paper online with a timer, get instant AI feedback and step-by-step solutions, and track the topics where you lose marks — completely free. Whether you are revising for your Master in Data Science (SMS, TU) Data Structures and Algorithms exam or solving previous years' question papers, this 2080 paper is a great way to practise under real exam conditions.

Level	Master in Data Science (SMS, TU)
Subject	Data Structures and Algorithms
Year	2080 BS
Exam session	Sa
Full marks	45
Time allowed	120 minutes
Questions	10, all with step-by-step solutions

Group A

5 questions·3 marks each

1Short answer3 marks

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

sortinginsertion-sort

2Short answer3 marks

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

searchingtime-complexity

3Short answer3 marks

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

hashing

4Short answer3 marks

Explain almost complete binary tree with example. (3)

binary-tree

5Short answer3 marks

What is adjacency matrix representation of the graph? (3)

graphadjacency-matrix

Group B

5 questions·6 marks each

6Long answer6 marks

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

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

merge-sortshell-sort

7Long answer6 marks

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

How do you implement both sequential search and binary search algorithms? (6)

searchingbinary-search

8Long answer6 marks

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. (2 + 4)

hashinglinear-probing

9Long answer6 marks

What is AVL tree. Construct AVL tree for the sequence 21, 26, 30, 9, 4, 14, 28, and 18. (1 + 5)

avl-tree

10Long answer6 marks

What is graph traversal? Explain both depth first search (DFS) algorithm for traversing graphs with example. (1 + 5)

graph-traversaldfs

Frequently asked questions

Where can I find the Master in Data Science (SMS, TU) Data Structures and Algorithms question paper 2080?: The full Master in Data Science (SMS, TU) Data Structures and Algorithms 2080 (Sa) question paper is available free on Kekkei. You can read every question online and attempt the paper under timed exam conditions.
Does the Data Structures and Algorithms 2080 paper come with solutions?: Yes. Every question on this Data Structures and Algorithms past paper includes a step-by-step solution, plus instant AI feedback when you attempt it on Kekkei.
How many marks is the Master in Data Science (SMS, TU) Data Structures and Algorithms 2080 paper?: The Master in Data Science (SMS, TU) Data Structures and Algorithms 2080 paper carries 45 full marks and is meant to be completed in 120 minutes, across 10 questions.
Is practising this Data Structures and Algorithms past paper free?: Yes — reading and attempting this Data Structures and Algorithms past paper on Kekkei is completely free.