You are on page 1of 2

SRM INSTITUTE OF SCIENCE AND TECHNOLOGY VADAPALANI CAMPUS

CHENNAI
18CSC303J - DATABASE MANAGEMENT SYSTEMS
QUESTION BANK
UNIT – 5
4 MARKS
1.Define transaction along with example.
2.List out and define the issues deal with the transactions.
3.List out the ACID properties of a transaction.
4.Define atomicity of a transaction with example.
5.Define consistency of a transaction with example.
6. Define isolation of a transaction with example.
7. Define durability of a transaction with example.
8.List out and define the states of transaction .
9.List out the advantages of allowing concurrent transaction.
10.Define schedule of a transaction..
11.Define undo and redo operations of a transactions.
12.Define lock, shared lock, exclusive lock.
13.Draw compatibility matrix for a transaction by using shared lock and exclusive lock.
14.Define locking protocol and give example for how transactions performing locking
by using shared lock and exclusive lock.
15.Define two phase locking protocol.
16.Define deadlock and starvation with example.
17.Define strict two phase locking and rigorous two phase locking mechanisms.
18.Define lock manager and lock table.
19.Define deadlock prevention and list out the deadlock prevention schemes.
20.Define wait - die scheme of deadlock prevention.
21. Define wound - wait scheme of deadlock prevention.
22. Define timeout based scheme of deadlock prevention.
23.Define wait for graph.
24.Define granularity of locking.
25.Draw the granularity hierarchy tree.
26. List out the additional three locks used in granularity locking.
27.Define intention shared lock mechanism.
28. Define intention exclusive lock mechanism.
29. Define shared and exclusive lock mechanism.
30. Draw compatibility matrix for a transaction by using shared lock and exclusive lock,
intention shared lock, intention exclusive lock, shared and exclusive lock.
31.List out and define the types of errors which lead to transaction failure.
32.Which are the two ways following in recovery algorithm.
33.Define volatile storage, non volatile storage, stable storage.
34.Define immediate database modification and deferred database modification.
35.Define log based recovery.
36.Define checkpoint of transactions along with neat diagram.
37.Define log record buffering.
12 MARKS
1.Explain transaction, states of transaction with diagram and ACID properties of
transaction along with example.
2.Explain schedule conept and four types of schedules along with example.
3.Explain undo and redo concurrency control mechanisms along with neat example.
4.Explain two phase locking protocol and how read and write operations performed in
transactions by using two phase locking protocol.
5.Explain deadlock and deadlock prevention mechanisms and how system is recovering
from deadlock by using multiple granularity mechanisms along with neat diagram and
example.
6.Explain how stable storage is mplementeed, and how physical locks and buffer blocks
are used in completion of a transaction along with neat diagram.
7.Explain log based recovery mechanisms along with example.
8.Explain recovery algorithm along with example.

You might also like