Does the Data Structures and Algorithms 2078 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 2078 (Set Mid-term Examination, p9 (typed)) Nepal

Master in Data Science (SMS, TU)Mid Term

45marks

120min

10questions

This is the official Master in Data Science (SMS, TU) Data Structures and Algorithms question paper for 2078 Set Mid-term Examination, p9 (typed), as set in the Mid Term 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 2078 paper is a great way to practise under real exam conditions.

Level	Master in Data Science (SMS, TU)
Subject	Data Structures and Algorithms
Year	2078 BS
Exam session	Mid Term · Set Mid-term Examination, p9 (typed)
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

What is data type. How is it different from ADT? (1 + 2)

data-typeadt

2Short answer3 marks

Convert $((A+B)*C - (D - E))\$ (F+G)$ to prefix and postfix. (1.5 + 1.5)

expression-conversionprefix-postfix

3Short answer3 marks

What is priority queue? Explain.

priority-queue

4Short answer3 marks

What is recursion? Compare it with iteration. (1 + 2)

recursioniteration

5Short answer3 marks

Explain recursive algorithm using suitable example. (3)

recursion

Group B

5 questions·6 marks each

6Long answer6 marks

What is asymptotic notation? Explain Big-oh, Theta, and Omega notation in detail. (1.5 + 4.5)

What is data structure? Why do we need it? Explain dynamic data structure and static data structure with example. (1 + 2 + 3)

asymptotic-notationcomplexity

7Long answer6 marks

Define stack. How do you implement push and pop operations in Stack? Explain. (1 + 5)

Explain algorithm to convert an infix expression to postfix with suitable example. (6)

stackinfix-postfix

8Long answer6 marks

Explain algorithm for evaluating postfix expression using suitable example. (6)

postfix-evaluation

9Long answer6 marks

Define queue. How do you implement queue operations using array data structure? Explain. (1 + 5)

queuearray

10Long answer6 marks

Explain tail recursion with suitable program. (6)

tail-recursion

Frequently asked questions

Where can I find the Master in Data Science (SMS, TU) Data Structures and Algorithms question paper 2078?: The full Master in Data Science (SMS, TU) Data Structures and Algorithms 2078 (Mid Term) 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 2078 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 2078 paper?: The Master in Data Science (SMS, TU) Data Structures and Algorithms 2078 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.