0% found this document useful (0 votes)
172 views1 page

JNTUA R23 DBMS Unit V Question Bank

Uploaded by

myr4112
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
0% found this document useful (0 votes)
172 views1 page

JNTUA R23 DBMS Unit V Question Bank

Uploaded by

myr4112
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

JNTUA R23 - DBMS Question Bank (Unit V)

Short Answer Questions


Q. No. Question CO BTL Marks
1 Define a Transaction? CO5 1 2M
2 What is concurrent execution in DBMS? CO5 1 2M
3 List the different types of locks? CO5 1 2M
4 What is the Transaction Isolation Level? CO5 1 2M
5 What is the purpose of a transaction log in recovery? CO5 2 2M
6 How does the 'Undo' operation work in transaction recovery? CO5 2 2M
7 List the classification of Failures in Transaction Management CO5 1 2M
8 Explain TCL commands CO5 1 2M
9 What is the purpose of indexing? CO5 2 2M
10 List the advantages of Hash Based Indexing CO5 2 2M

Long Answer Questions


Q. No. Question CO BTL Marks
1.i Explain the concept of a transaction and the states in its life-cycle CO5 2 5M
What [Link]
a recovery algorithm in DBMS? Explain the steps involved in log-basedCO5
recovery.2 5M
2.i Define serializability and discuss its types. CO5 2 5M
[Link] Discuss the conflicts of concurrent transactions CO5 2 5M
3.i What is two-phase locking and how does it guarantee serializability?CO5 3 5M
[Link] Describe various Concurrency Control Methods? CO5 2 5M
What
4.i are deadlocks in DBMS? Explain the wait-die and wound-wait techniques
CO5 2 5M
[Link] Discuss properties of Transactions. CO5 2 5M
5.i What is a B+ Tree? Describe the operations in B+ Tree? CO5 2 5M
What
[Link] is hash-based indexing? Explain its working mechanism with an example.
CO5 3 5M

You might also like