Skip to content
Previous Year Question Paper

CY-405 - Database Management System

June 2023CSCYSEMESTER-4
June 2023
Max Marks:
Duration:
Q.1
a)Unit 1

Explain the various levels of data abstraction in a database management system.

b)Unit 1

Explain different types of relationships amongst tables in a DBMS. Explain different types of attributes in a DBMS.

Q.2
a)Unit 1

Define degree and cardinality. Based upon the given table write degree and cardinality. Patients Table: PatNo | PatName | Dept | DocID 1 | Leena | ENT | 100 2 | Supreeth | Ortho | 200 3 | Madhu | ENT | 100 4 | Neha | ENT | 100 5 | Deepak | Ortho | 200

b)Unit 4

What is the meaning of ACID characteristics in relational databases? Define the structure of a relational database schema.

Q.3
a)Unit 2

Describe the different types of keys. Explain different operations in Relational algebra.

b)Unit 2

Consider the student table given below. Write commands (using relational algebra operations), and outputs for the followings: Student Table: Reg.No. | Branch | Section 1 | CSE | A 2 | ECE | B 3 | CIVIL | B 4 | IT | A

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.

Q.4
a)Unit 3

What does Normalization mean? Explain different normal forms with examples.

b)Unit 3

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 (1NF, 2NF, 3NF, or BCNF).

iii) If the relation is not in BCNF, decompose it until it becomes BCNF. At each step, identify a new relation, decompose and re-compute the keys and the normal forms they satisfy.

Q.5
a)Unit 3

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

b)Unit 3

The following functional dependencies are given: AB→CD, AF→D, DE→F, C→G, F→E, G→A. Find the closure of CF, BG, AB and AF.

Q.6
a)Unit 4

What do you mean by Serializability? Discuss the conflict and view serializability with suitable example.

b)Unit 4

What do you mean by Multiple granularities? How is it implemented in transaction system?

Q.7
a)Unit 4

What are the methods used for deadlock prevention in DBMS? What is difference between blocking and deadlock?

b)Unit 4

What is Checkpoint in DBMS? Why is Checkpoint used in database? How Checkpoint works in DBMS?

Q.8
Unit 5

Write secondary storage? Explain types of data storage in DBMS and describe storage hierarchy. Distinguish between:

i) Primary and Secondary indexing.

ii) Ordered indexing and hashing.