Master in Data Science (SMS, TU) Data Structures and Algorithms Question Paper 2078 (Set First Re Assessment 2078, p7) Nepal
This is the official Master in Data Science (SMS, TU) Data Structures and Algorithms question paper for 2078 Set First Re Assessment 2078, p7, as set in the First Reassessment 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 | First Reassessment · Set First Re Assessment 2078, p7 |
| Full marks | 45 |
| Time allowed | 120 minutes |
| Questions | 10, all with step-by-step solutions |
Group A
Define ADT. What are the benefits of using ADT? (1 + 2)
Convert A\B*C-D+E/F/(G+H)$ to prefix and postfix. (1.5 + 1.5)
What is priority queue? How can we make priority queue? (1 + 2)
What is recursion? Compare it with iteration. (1 + 2)
Define recursion. What are the benefits of using recursive algorithms? (1 + 2)
Group B
What is complexity of algorithms? Explain Big-oh, Theta, and Omega notation in detail. (1.5 + 4.5)
OR
What is data structure? Why do we need it? Explain dynamic data structure and static data structure with example. (1 + 2 + 3)
What are different applications of stack? How do you implement push and pop operations in Stack? Explain. (2 + 4)
OR
Explain algorithm to convert an infix expression to postfix with suitable example. (6)
Explain algorithm for evaluating postfix expression using suitable example. (6)
What are different applications of queue. How do you implement enqueue and dequeue operations? Explain. (1 + 5)
Explain tail recursion with suitable program. (6)
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 (First Reassessment) 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.