Master in Data Science (SMS, TU) Database Management Systems Question Paper 2081 (Set page 8; First Assessment 2081) Nepal
This is the official Master in Data Science (SMS, TU) Database Management Systems question paper for 2081 Set page 8; First Assessment 2081, as set in the First Assessment examination. It carries 45 full marks and a time allowance of 120 minutes, across 10 questions. On Kekkei you can attempt this Database Management Systems 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) Database Management Systems exam or solving previous years' question papers, this 2081 paper is a great way to practise under real exam conditions.
| Level | Master in Data Science (SMS, TU) |
|---|---|
| Subject | Database Management Systems |
| Year | 2081 BS |
| Exam session | First Assessment · Set page 8; First Assessment 2081 |
| Full marks | 45 |
| Time allowed | 120 minutes |
| Questions | 10, all with step-by-step solutions |
Group A
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
Differentiate between Cartesian product and natural join.
Group B
Draw an ER Diagram for online movie reservation system. Make necessary assumptions
Consider the following schema, write expressions using relational algebra
Suppliers (sid, sname, saddress, sphone) Parts (pid, pname, ptype) Catalog (sid, pid, cost)
a) Find the names of those suppliers whose ptype is of home_appliance b) Find the sid of those suppliers who have supplied ptype as mobile and whose cost is less than Rs. 50,000 c) Find the sid of those suppliers who have supplied all parts
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
Perform normalization on the following relation
| Did | Dtype | Dhead | Dtime | Cost |
|---|---|---|---|---|
| 1 | DA | Ajit | T1 | 100 |
| 2 | DB | Sheela | T2 | 200 |
| 3 | DC | Janu | T3 | 300 |
| 1 | DD | Ajit | T1 | 400 |
| 2 | DE | Sheela | T2 | 500 |
OR
Find the closure for the relational schema R (A, B, C, D, E, F) and set of functional dependencies
Write short notes on a) Abstraction b) View
Frequently asked questions
- Where can I find the Master in Data Science (SMS, TU) Database Management Systems question paper 2081?
- The full Master in Data Science (SMS, TU) Database Management Systems 2081 (First Assessment) question paper is available free on Kekkei. You can read every question online and attempt the paper under timed exam conditions.
- Does the Database Management Systems 2081 paper come with solutions?
- Yes. Every question on this Database Management Systems 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) Database Management Systems 2081 paper?
- The Master in Data Science (SMS, TU) Database Management Systems 2081 paper carries 45 full marks and is meant to be completed in 120 minutes, across 10 questions.
- Is practising this Database Management Systems past paper free?
- Yes — reading and attempting this Database Management Systems past paper on Kekkei is completely free.