Master in Data Science (SMS, TU) Database Management Systems Question Paper 2081 Nepal
This is the official Master in Data Science (SMS, TU) Database Management Systems question paper for 2081, as set in the Sa 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 | Sa |
| Full marks | 45 |
| Time allowed | 120 minutes |
| Questions | 10, all with step-by-step solutions |
Group A
State non-subversion rule in Codd's Rule.
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.
Define multivalued dependency.
Write SQL statement to create a table and insert value into it. Use your own assumption.
Group B
Differentiate discretionary access control from mandatory access control mechanism. [6]
OR
How database is created using XML? Create a XML file to store information about School. Use your own assumptions if required. [2+4]
Describe different architectures in parallel databases. [6]
OR
How fixed length attributes and variable length attributes are represented in variable length record approach in file organization? What is a slotted page structure? [4+2]
What is query optimization? How materlization is different from pipelining? Prepare the query tree and optimized query tree for following SQL statement; [1+2+3]
SELECT FNAME, ADDRESS FROM EMPLOYEE INNER JOIN DEPARTMENT ON DNO = DNUMBER WHERE DEPARTMENT.DNAME='Research';
Describe the rules for converting ER diagram into relational table. Illustrate with suitable example reflecting each cases. [3+3]
How can you determine whether a schedule is conflict serializable or not? Given following schedule, determine whether it is conflict serializable or not and justify your answer. [1+2+3]
Schedule C:
| read_item(X);<br>X := X - N; | |
| read_item(X);<br>X := X + M; | |
| write_item(X);<br>read_item(Y); | |
| write_item(X); | |
| Y := Y + N;<br>write_item(Y); |
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 (Sa) 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.