DMS Final Exam
DMS Final Exam
_________
MARWADI UNIVERSITY
Faculty of Technology
CE / IT / BIOINFO B.Tech
SEM: 3rd MU FINAL / REMEDIAL EXAM Nov:2023
__________________________________________________________________________
Subject: - DMS - 01CE2302 Date:- 13/12/2023
Total Marks:-100 Time: - 12:30 to 03:00 PM
Instructions:
1. All Questions are Compulsory.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
Question: 1
(a). Answer the Following MCQs. (All Questions are Mandatory) [10]
MARWADI UNIVERSITY 1|
Enroll. No._________
(b). Answer the Following Questions in One Line. (All Questions are Mandatory) [10]
Ans:
4. ______ is Bottom-up approach.
Ans: Generalization
5. A primary key attribute value cannot be NULL. (True / False)
Ans: True
6. Let us consider a relation R with schema R = (A, B, C) and set of functional dependencies
FDs F = { AB → C, A → C }. In AB → C, B is ______ attribute.
Ans: extraneous
7. List Basic Types of Schedule
Ans: Serial schedule , Non-serial Schedule
8. A schedule is serializable if it is equivalent to a serial schedule (True / False)
Ans: True
9. _______ Optimization Uses predefined rules and doesn't look at actual data or costs. (Cost-
Based Optimization, Heuristic Optimization)
Ans: Heuristic Optimization
10. Full Form of DML
Ans: Data Manipulation Language
Question: 2.
MARWADI UNIVERSITY 2|
Enroll. No._________
(b) What are the Types of Database User? Explain in Brief. [8]
Ans: 4 Types of User: 2 Marks per each with Proper Description
OR
(b) List and Explain Data Models in Database. [8]
Ans: 1 Marks Per Each with Proper Description
Record Base: Hierarchical Model, Network Model, Relational Model
Object Base: Entity Relational Model, Object Oriented Model
Physical Data Model
Question: 3.
Question: 4.
(a) What is meant by normalization? List and discuss various normalization forms [8]
Ans: Definition:2 Marks
Explain each Normal Forms with Rules and Example: 2 Marks per Each
(b) Explain ACID properties of transaction with suitable example [8]
Ans: 2 Marks for Each with Definition and example
OR
(a) Given functional dependencies (FDs) for relational schema R = (A,B,C,D,E): [8]
F = {A → BC, CD → E, B → D, E → A}
1. Find Closure for A
2. Find Closure for CD
3. Find Closure for B
4. Find Closure for BC
Ans: 2 Marks per each
A+ = ABCDE
CD+ = ABCDE
B+ = BD
BC+ = ABCDE
(b) Define transaction. Explain various states of transaction with suitable diagram. [8]
Ans: Definition: 1 Marks
Correct Diagram: 4 Marks
Correct Explanation for each state: 3 Marks
MARWADI UNIVERSITY 3|
Enroll. No._________
Question: 5.
(a) What is Lock-compatibility matrix? Write a note on two phase locking protocol [6]
Ans: Correct Matrix : 2 Marks
Growing Phase: 2 marks for Explanation
Shrinking Phase: 2 marks for Explanation
(b) Write a Pl/SQL program to print integers from 1 to 10 by using PL/SQL FOR loop [6]
Ans: Basic Syntax: 2 Marks
For loop: 2 Marks
Logic: 2 Marks
(c) Consider a relation R (A,B,C,D,E,F,G) with following functional dependencies: [4]
FD: {A → BC,D → F, CF → G ,BC → DE}
Find {A}+ , {AC}+
Ans: 2 Marks Per each.
A+ = { A , B , C , D , E , F , G }
{AC}+ ={A,B,C,D,E,F,G}
OR
(a) Explain two-phase commit protocol. [6]
Ans: Figure: 2 Marks
Correct Explanation for each step: 4 Marks
(b) Write a Pl/SQL program to print integers from 10 to 1 by using PL/SQL While loop [6]
Ans: Basic Syntax: 2 Marks
For loop: 2 Marks
Logic: 2 Marks
(c) Compute the closure of the following set F of functional dependencies FDs for relational [4]
schema R = (A,B,C,D,E,F):
F = (A → B, A → C, CD → E, CD → F, B → E)
Find out the closure of F.
Ans: F+ = (A → BC, CD → EF, A → E, AD → E, AD → F)
Question: 6.
(a) What are the activity performed in Query Processing? Explain in Brief with Suitable [8]
Diagram.
Ans: Diagram: 3 Marks
Description of 3 Steps: 2 Marks Per Each step
(b) How the checkpoint works when failure occurs? Explain with suitable example. [4]
Ans: Figure with Explanation : 1 Marks
Ignore the transaction, Redo transaction, Undo transaction: 1 Marks per each
(c) Write a PL/SQL block for Print The 'Hello World'. [4]
Ans:
DECLARE
message varchar2(20):= 'Hello, World!';
BEGIN
dbms_output.put_line(message);
END;
OR
(a) Explain Materialization and Pipeline Approach for Query Optimization with Example. [8]
Ans: Materialization: Description and Example - 4 Marks
Pipeline: Description and Example - 4 Marks
(b) Explain deadlock with suitable example of wait-for graph. [4]
Ans: Define: 2 Marks
Example with Examination: 2 Marks
(c) Write a PL/SQL block for calculating a+b (Consider a=10, b=20) [4]
Ans:
DECLARE
a integer := 30;
MARWADI UNIVERSITY 4|
Enroll. No._________
b integer := 40;
c integer;
BEGIN
c := a + b;
dbms_output.put_line('Value of c: ' || c);
END;
---Best of Luck---
MARWADI UNIVERSITY 5|
Enroll. No._________
MARWADI UNIVERSITY 6|