Database Management Systems: what's likely to come
Every real question from 13 past papers across 5 years (board + internal assessments each year) mapped to its official syllabus unit. Each prediction shows its receipt: the actual years it appeared.
13 papers across 5 years
This program sits several exams each year: one official board exam plus internal assessments. Every sitting is analysed.
Topic predictions, ordered by what to study first
Every syllabus unit scored by how often it appears, its mark-weight, and its trend. See the exact questions behind each unit in the Explore-by-unit section below.
| # | Syllabus unit | Probability | Appeared | Avg marks | Syllabus weight | Exam vs syllabus | Trend | Questions |
|---|---|---|---|---|---|---|---|---|
| 1 | U1Fundamental Concept of DBMS | Very likely100% | 33.6 | 12%6 lecture hrs | Over-examinedexam 29% · syllabus 12% | Steady | 3 recurring40 total | |
| 2 | U3Database Constraints and Normalization | Very likely100% | 21 | 12%6 lecture hrs | Over-examinedexam 18% · syllabus 12% | Steady | 1 recurring21 total | |
| 3 | U6Trends in Database Technology | Very likely100% | 15.6 | 19%9 lecture hrs | Balancedexam 14% · syllabus 19% | Steady | 2 recurring14 total | |
| 4 | U5Transaction Processing and Concurrency Control | Very likely100% | 14.4 | 12%6 lecture hrs | Balancedexam 13% · syllabus 12% | Steady | none repeat14 total | |
| 5 | U2Relational Languages and Relational Model | Very likely80% | 19.5 | 15%7 lecture hrs | Balancedexam 14% · syllabus 15% | Rising | 3 recurring15 total | |
| 6 | U7Advanced Topic | Very likely80% | 11.2 | 17%8 lecture hrs | Under-examinedexam 8% · syllabus 17% | Rising | none repeat10 total | |
| 7 | U4SQL & Query Optimization | Likely60% | 9 | 12%6 lecture hrs | Under-examinedexam 5% · syllabus 12% | Rising | none repeat5 total |
Explore by unit: every question, ranked
Pick a syllabus unit and walk its questions from most-important to asked-once. The fastest way to revise one topic end to end.
Describe weak entity with an example. Convert following ER diagram into the equivalent relational schema. [2+4]
The ER diagram contains: Entity Actor (attributes: Actorid [key], Name, Phone [multivalued]) related via Plays (1:M, attribute Quantity) to entity Movie (attributes: Title [key], ReDate). Movie is related via Producedby (M:N) to entity Producer (attributes: Prodid [key], Name, Budget).
Draw ER diagram for online examination system. Make necessary assumptions.
OR
Assume attributes of CUSTOMER, ORDER, PRODUCT and Employee with required primary key. Convert the ER diagram to relational model.
(ER diagram shown: CUSTOMER --Places-- ORDER --Lists-- PRODUCT --Assembles-- EMPLOYEE)
Explain different types of cardinalities.
Design an ER diagram that contains at least three entities. One of the entity must be weak entity. There should be many to many relationship between the two strong entities. Use your own assumptions for other requirements. Now convert the so constructed ER diagram into equivalent database table schema. [3+3]
Design an ER diagram for following scenario: [6]
In film industry, producers produce movies. Producers have their name, age and budget as attributes. They are uniquely identified by prod_id. All the movies have their title, year, and release date. No movies can have same title. Every movies must be played by an actor. An actor can play many movies. Actors have Fname and Lname to uniquely identify them. The actors have charge_rate as well. A single movie can have many producers and a producer can produce zero or many movies. There is an identifying relationship between actor and vanity van. Vanity van has partial attribute van_id.
Draw an ER Diagram for online movie reservation system. Make necessary assumptions
Suppose there are two entity sets A and B where B is weak entity and R is relation. The schema is as follows: A(a1, a2) B(b1, b2, b3). The cardinality between them is many to many. Draw the schema and convert it to relational model.
OR
Explain different types of joins with an example of your own
Write short notes on a) Abstraction b) View
Describe the rules for converting ER diagram into relational table. Illustrate with suitable example reflecting each cases. [3+3]
What is DBMS? Describe the characteristics that makes DBMS better than flat file system. [1+5]
Design an ER diagram for following scenario: (6)
In film industry, producers produce movies. Producers have their name, age and budget as attributes. They are uniquely identified by prod_id. All the movies have their title, year, and release date. No movies can have same title. Every movies must be played by actor. An actor can play many movies. Actors have Fname and Lname to uniquely identify them. The actors have charge_rate as well. A single movie can have many producers and a producer can produce zero or many movies. There is an identifying relationship between actor and vanity van. Vanity van has partial attribute van_id.
Draw ER diagram for online voting system. Make necessary assumptions.
Justify why database management system is efficient than file management system.
List different types of data models and explain anyone.
Explain the concept of data abstraction in DBMS.
Explain any three Codd's rule.
Explain the concept of DDL and DML.
Explain weak entity set.
What are the advantages of using DBMS?
What is three schema architecture?
Differentiate network data model from hierarchical data model. [3]
Define relationship set and relationship instance. [3]
Describe attribute, relation and tuple with examples. [3]
While converting ER model into relational schema, how the mapping of binary M:N relationship types is done? Illustrate with an example. [2+1]
Differentiate between Database and Database Management System
Define candidate key, primary key and foreign key
Describe the property of weak entity with an example
Explain the concept of logical and physical data independence
State non-subversion rule in Codd's Rule.
Describe relationship type and relationship set in ER Model.
How problems related to data integrity and automicity occur in flatfile system?
State the concept of information rule and non-subversion rule in Codd's Rule.
What is database? List the characteristics of database system. (2+1)
Create a relation of your choice and illustrate the concepts of attribute, tuple, and primary key. (3)
What is data independence? How three schema architecture ensures logical and physical data independence? (1+2)
Define database schema and instance with example.
Differentiate between DDL, DML, and DCL.
Differentiate between total participation and partial participation.
Differentiate between logical design and physical design.
Illustrate the use of ISA relation.
Most-asked questions across all years
The questions that come back exam after exam, grouped across years and ranked by how often they're asked. Open one to read its real past answer.
Explain different types of RAID.
OR
Differentiate between classification and clustering. Explain any one clustering algorithm.
Describe weak entity with an example. Convert following ER diagram into the equivalent relational schema. [2+4]
The ER diagram contains: Entity Actor (attributes: Actorid [key], Name, Phone [multivalued]) related via Plays (1:M, attribute Quantity) to entity Movie (attributes: Title [key], ReDate). Movie is related via Producedby (M:N) to entity Producer (attributes: Prodid [key], Name, Budget).
Explain B-tree Index files.
Consider the following relations containing airline flight information. (6)
Flights(flno, from, to, flight_distance, departs_at, arrives_at, aid) Aircraft(aid, aname, cruising_range) Certified(pid, aid, date, certified_by) Pilot(pid, pname, psalary)
Write the SQL statements for following:
a) Find all aircrafts. b) Find the name of flights that arrive at 1:00 PM. c) Find the names of certified pilots d) Find names of aircrafts that can be used on flights from KTM to DHI. e) Find the average salary of pilots. f) Use left outer join between Aircraft and Certified.
Why group by and having clauses are used in SQL? Support your answer with suitable examples.
How division operation is done in relational algebra? Illustrate with example.
Draw ER diagram for online examination system. Make necessary assumptions.
OR
Assume attributes of CUSTOMER, ORDER, PRODUCT and Employee with required primary key. Convert the ER diagram to relational model.
(ER diagram shown: CUSTOMER --Places-- ORDER --Lists-- PRODUCT --Assembles-- EMPLOYEE)
Find Attribute Closure of the following relation
| STU_ID | NAME | Age | FACULTY | ADDRESS |
|---|---|---|---|---|
| 1 | Bikash | 20 | Computer | Kathmandu |
| 2 | Anju | 21 | Electronics | Patan |
| 3 | kiran | 22 | computer | Bhaktapur |
| 4 | Anju | 23 | Computer | Patan |
Lowest priority: asked only once (110)
- U22082
Provided the following schema, write relational algebra
MEMBER (MID, Mname, Maddress) HALL (HID, Hname, Haddress, Hdepartment, Hprice) RESERVES (MID, HID, date)
a) List all the members who have reserved two halls i.e. Hall 4 and Hall 6. b) Display name and address of those members who have booked the hall of science department for 18/6/2025. c) List the id and name of those members who have booked the hall whose price is less than Rs. 10,000.
OR
Explain any one classification algorithm with an example of your own.
- U32082
Convert the table to 3 NF.
emp_id emp_name emp_zip emp_state emp_city emp_district 1 Hira 2005 State5 C1 D1 2 Kanti 5780 state2 C2 D2 3 Bishal 2005 State5 C3 D3 4 Pushpa 2290 state4 C4 D4 5 Indira 85009 state3 C5 D4 - U42082
What do you understand by query optimization? Explain.
- U52082
Explain two phase commit protocol. List its advantages.
- U52082
Explain any one method of concurrency control.
OR
Which of the following schedule is (conflict) serializable? For each serializable schedule, determine the equivalent serial schedules. a) b)
- U52082
Write short notes on a) Spatial database b) ACID
- U62082
Create B tree of order(M) = 3 for the following values: 1, 4, 11, 3, 7, 12, 2, 5, 15, 13, 6
OR
Explain different data warehouse schemas.
- U62082
Write short notes on a) Mobile Database b) DML
- U62082
Explain different data warehouse schemas.
- U72082
Differentiate between classification and clustering. Explain the applications of clustering.
OR
Provided the following schema, write relational algebra
Patient(PID, Pname, Paddress, Pgender, disease) Doctor(DID, Dname, Daddress, Department, salary) Appointment(PID, DID, time)
a) List all the patients who were checked by doctors Maila and Sarthak. b) List name and id of doctors whose salary is less than Rs. 50,000. c) Display female patients who were checked by doctor Maila in day time only.
- U12081
Design an ER diagram that contains at least three entities. One of the entity must be weak entity. There should be many to many relationship between the two strong entities. Use your own assumptions for other requirements. Now convert the so constructed ER diagram into equivalent database table schema. [3+3]
- U12081
Design an ER diagram for following scenario: [6]
In film industry, producers produce movies. Producers have their name, age and budget as attributes. They are uniquely identified by prod_id. All the movies have their title, year, and release date. No movies can have same title. Every movies must be played by an actor. An actor can play many movies. Actors have Fname and Lname to uniquely identify them. The actors have charge_rate as well. A single movie can have many producers and a producer can produce zero or many movies. There is an identifying relationship between actor and vanity van. Vanity van has partial attribute van_id.
Study smart and sit a probable paper
How far a few high-priority topics take you, and a full mock paper built from the most likely questions, mirroring the real exam structure.
Study smart, not hard
Study the units in priority order. Each bar shows the share of total marks you'd have covered by then. The top 5 units alone cover ~80% of marks.
Most Probable Paper
Mirrors the real structure · 45 marks · based on 5 past papers
- 1.[3 marks]
List different types of data models and explain anyone.
Asked once (2082); including the board exam 1× (2082); and its topic (Fundamental Concept of DBMS) appears in 100% of years.
- 2.[3 marks]
Explain the concept of data abstraction in DBMS.
Asked once (2082); including the board exam 1× (2082); and its topic (Fundamental Concept of DBMS) appears in 100% of years.
- 3.[3 marks]
What are the advantages of using DBMS?
Asked once (2081); including the board exam 1× (2081); and its topic (Fundamental Concept of DBMS) appears in 100% of years.
- 4.[3 marks]
What is three schema architecture?
Asked once (2081); including the board exam 1× (2081); and its topic (Fundamental Concept of DBMS) appears in 100% of years.
- 5.[3 marks]
Describe relationship type and relationship set in ER Model.
Asked once (2080); including the board exam 1× (2080); and its topic (Fundamental Concept of DBMS) appears in 100% of years.
- 1.[6 marks]
Explain different types of RAID.
OR
Differentiate between classification and clustering. Explain any one clustering algorithm.
This question has recurred in 2 of 5 years; including the board exam 1× (2079); and its topic (Trends in Database Technology) appears in 100% of years.
- 2.[6 marks]
Explain B-tree Index files.
This question has recurred in 2 of 5 years; including the board exam 1× (2079); and its topic (Trends in Database Technology) appears in 100% of years.
- 3.[6 marks]
Design an ER diagram that contains at least three entities. One of the entity must be weak entity. There should be many to many relationship between the two strong entities. Use your own assumptions for other requirements. Now convert the so constructed ER diagram into equivalent database table schema. [3+3]
Asked once (2081); including the board exam 1× (2081); and its topic (Fundamental Concept of DBMS) appears in 100% of years.
- 4.[6 marks]
Draw ER diagram for online voting system. Make necessary assumptions.
Asked once (2079); including the board exam 1× (2079); and its topic (Fundamental Concept of DBMS) appears in 100% of years.
- 5.[6 marks]
Describe 1NF, 2NF and 3NF with appropriate examples. [6]
OR
Describe the dependency preservation and lossless join property. Describe 4NF with an example. [3+3]
Asked once (2081); including the board exam 1× (2081); and its topic (Database Constraints and Normalization) appears in 100% of years.