Mumbai University Solved Question Papers
Data Structures
Previous Year Question Paper with Solution
BSc CS · Sem 3
Oct 2025 Examination
munotes.in
Mumbai
BSc CS Sem 3 Data Structures Oct 2025 Question Paper with Solutions
Get access to whole semester resourcesSemester Pass
MU B.Sc. (Computer Science) student group
Free to join
First published on munotes.in on 16 October 2026.
Published by munotes.in, Mumbai.
Model answers written and edited by the munotes.in editorial desk.
Passages from this volume may be quoted, in print, online or by an AI system, with credit: name munotes.in and link to this volume's page. The volume may not be reproduced as a whole. Full terms at munotes.in/content-license.
munotes.in is an independent study resource for students of the University of Mumbai. It is not affiliated with the University of Mumbai, and is not endorsed by it.
The University does not publish an official answer key for this paper. The answers in this volume are model answers, written to show how a full-mark answer is built. They are a study aid, not an authority on what an examiner marked.
The question paper reproduced here is the paper as set by the University of Mumbai at the Oct 2025 examination.
Contents
The questions below are the paper as the University of Mumbai set it at the Oct 2025 examination, in the order it was set.
MarksPage
The Paper as Set
The questions in this volume are the questions asked at the Oct 2025 examination, reproduced as the University of Mumbai set them, in the order it set them. Nothing has been reworded, added or left out. Only the answers are ours. See the original question paper.
Duration 1 hours · Total marks 30 · 12 questions answered
How to use this volume
Solve the paper first, under exam conditions and against the clock. Then read the answers here and mark your own. Reading a solution before attempting the question feels productive and teaches very little, because recognising an answer is not the same as being able to write one.
SECTION I
Q I
Attempt any two · 10 Marks
A)What is an Abstract Data Type (ADT)? Explain in brief.[5]
Answer
For full marks, cover: the definition (a type defined by its values and operations, not its implementation), the idea of abstraction and encapsulation, an example ADT (Stack) with its operations, how one ADT can have several implementations, and the advantages.
Definition
An Abstract Data Type (ADT) is a logical description of a data type. It says what values the type holds and what operations can be done on them, but not how those operations are carried out. The "how", called the implementation, is hidden from the user.
So an ADT separates two views.
- The interface (what): the operations a user may call, with their meaning.
- The implementation (how): the actual data structure and code, which is hidden.
This hiding is called abstraction, and keeping the data and its operations together is called encapsulation.
Example: the Stack ADT
A stack holds a sequence of items, added and removed at one end only (last in, first out). Its operations are:
- push(x): add x on top.
- pop(): remove and return the top item. It is an error if the stack is empty.
- peek(): return the top item without removing it.
- is_empty(): true if the stack has no items.
- size(): the number of items.
The user knows only these operations. The stack may be implemented using a Python list (array) or a linked list. Either way the user's program does not change.
Other common ADTs
List, Queue, Deque, Priority Queue, Tree, Graph and Hash Table (Map) are all ADTs. A user-specific ADT, such as a Bank Account with deposit and withdraw operations, can be created in Python as a class.
Advantages
- Simplicity: users work with clear operations, not storage details.
- Changeability: the implementation can be improved without changing the programs that use it.
- Reliability: the data can be changed only through its operations, so it cannot be corrupted directly.
- Reuse: one ADT can serve many programs.
Conclusion. An ADT defines a data type by its values and operations while hiding how it is stored. The Stack ADT, with push, pop and peek, works the same on an array or a linked list. That is what makes ADTs simple, safe and reusable.
The rest of the answers
The first answer is free. The rest come with the B.Sc. (Computer Science) Semester 3 solved papers.
You have read the question paper and its first answer in full. Buy the solved papers once and you can read every answer of every solved paper in this semester.
Notes + practical solutions + solved papers: ₹798 Already bought it? Sign in
Or solved papers only: ₹499
Or notes + practical solutions: ₹499
The question paper itself stays free, and so does the syllabus.
Found an error in this volume? Report it and we will check it against the paper.