Scribd
Upload
37 views2 pages

Dbms 24 25

The document outlines the structure of a B.Tech (Sem V) examination for Database Management Systems, including instructions and three sections of questions: brief answer questions, descriptive answer questions, and detailed answer questions. Each section covers various topics such as functional dependency, normalization, SQL queries, concurrency control, and deadlock management. The examination is designed to assess students' understanding of key DBMS concepts and their practical application.

Uploaded by

utkarsh.2226cseai10
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
37 views2 pages

Dbms 24 25

The document outlines the structure of a B.Tech (Sem V) examination for Database Management Systems, including instructions and three sections of questions: brief answer questions, descriptive answer questions, and detailed answer questions. Each section covers various topics such as functional dependency, normalization, SQL queries, concurrency control, and deadlock management. The examination is designed to assess students' understanding of key DBMS concepts and their practical application.

Uploaded by

utkarsh.2226cseai10
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

B.

TECH (SEM V) THEORY EXAMINATION DATABASE MANAGEMENT SYSTEM Time: 3 Hours Total Marks:
100

Note

1. Attempt all sections. If required, assume missing data suitably.

2. All questions carry equal marks.

SECTION A

(Brief Answer Questions)


(2 x 10 = 20 Marks)

1. Define Functional Dependency and explain its significance in DBMS.

2. List the advantages of using a database system over the traditional file system.

3. Differentiate between primary key and candidate key with examples.

4. What are ACID properties? Why are they important in transaction management?

5. Explain the concept of normalization and state its objectives.

6. What are multivalued dependencies? Provide an example.

7. Define concurrency control and explain its need in a database system.

8. Differentiate between conflict serializability and view serializability.

9. Describe deadlock in the context of DBMS. How is it detected and resolved?

10. What is a log in DBMS? How does it support recovery mechanisms?

SECTION B

(Descriptive Answer Questions)


(10 x 3 = 30 Marks)

11. (a) Design an ER Diagram for a university library system. Include all necessary components and
assumptions. OR
(b) Explain the three-schema architecture of DBMS and its significance.

12. (a) Write SQL queries to:

• List all students enrolled in the "CSE" branch.

• Find books published by "Pearson".


• Display names of students who have issued at least one book. OR
(b) Discuss different types of joins in SQL with examples.

13. (a) Consider the relation R(A, B, C, D) with FDs: A→B, B→CD. Find the candidate keys and
decompose the relation into 2NF and 3NF. OR
(b) Discuss the concept of lossless decomposition. How is it ensured during normalization?

SECTION C

(Detailed Answer Questions)


(10 x 5 = 50 Marks)

14. (a) Describe the timestamp-based concurrency control protocol. How does it differ from
locking protocols? OR
(b) Explain the two-phase commit protocol (2PC) used in distributed databases. Discuss its
advantages and challenges.

15. (a) Define conflict serializability. Check whether the following schedule is conflict-serializable
or not:

• T1: R(A), W(A)

• T2: R(B), W(B)

• T3: R(A), W(B) OR


(b) What are cascading rollbacks? How can they be avoided?

16. (a) What is a functional dependency? Discuss the procedure for calculating the canonical cover
with a suitable example. OR
(b) Explain the significance of multiversion concurrency control with an example.

17. (a) Discuss the immediate update and deferred update recovery techniques. Compare their
advantages and disadvantages. OR
(b) Explain the concept of replication in distributed databases. What are its benefits and
challenges?

18. (a) Discuss the process of deadlock detection and recovery in DBMS with an example. OR
(b) What is graph-based locking? Explain with an example.

You might also like