CY-405 (GS) – Database Management System

B.Tech., IV Semester
Examination, June 2023
Grading System (GS)
Max Marks: 70 | Time: 3 Hours

Note:
i) Answer any five questions.
ii) All question carries equal marks.

Previous Year Questions (June 2023)

Q.1

a) Explain the various levels of data abstraction in a database management system. (Unit 1)


b) Explain different types of relationships amongst tables in a DBMS. Explain different types of attributes in a DBMS. (Unit 1)


Q.2

a) Define degree and cardinality. Based upon the given table write degree and cardinality.

Patients

PatNo PatName Dept DocID
1 Leena ENT 100
2 Supreeth Ortho 200
3 Madhu ENT 100
4 Neha ENT 100
5 Deepak Ortho 200

(Unit 1)


b) What is the meaning of ACID characteristics in relational databases? Define the structure of a relational database schema. (Unit 4)


Q.3

a) Describe the different types of keys. Explain different operations in Relational algebra. (Unit 2)


b) Consider the student table given below.

Reg.No. Branch Section
1 CSE A
2 ECE B
3 CIVIL B
4 IT A

Write commands (using relational algebra operations), and outputs for the followings:
i) To display all the records of student table.
ii) To display all the records of CSE branch in student table.
iii) To display the record of ECE branch section B students.
iv) To display the records of section B CSE and IT branch.
v) To display all the records in student tables whose regno>2. (Unit 2)


Q.4

a) What does Normalization mean? Explain different normal forms with examples. (Unit 3)


b) Suppose you are given a relation $R=(A,B,C,D,E)$ with the following functional dependencies. {CE→D, D→B, C A}.
i) Find all candidate keys.
ii) Identify the best normal form that R satisfies (INF, 2NF, 3NF, or BCNF).
iii) If the relation is not in BCNF, decompose it until it becomes BCNF. At cach step, identify a new relation, decompose and re-compute the keys and the normal forms they satisfy. (Unit 3)


Q.5

a) Let $R=(A,B,C,D,E,F)$ be a relation scheme with the following dependencies: $C\rightarrow F,$ E→A, EC→D, A B. Find candidate key for R? (Unit 3)


b) The following functional dependencies are given:
AB CD, $AF\rightarrow D,$ DEF, CG, FE, G A
Find the closure of CF, BG, AB and AF. (Unit 3)


Q.6

a) What do you mean by Serializability? Discuss the conflict and view serializability with suitable example. (Unit 4)


b) What do you mean by Multiple granularities? How is it implemented in transaction system? (Unit 4)


Q.7

a) What are the methods used for deadlock prevention in DBMS? What is difference between blocking and deadlock? (Unit 4)


b) What is Checkpoint in DBMS? Why is Checkpoint used in database? How Checkpoint works in DBMS? (Unit 4)


Q.8

a) What is Secondary storage? Explain types of data storage in DBMS and describe storage hierarchy. (Unit 5)


b) Distinguish between:
i) Primary and Secondary indexing.
ii) Ordered indexing and hashing. (Unit 5)