Scribd
Upload
6 views

Sample Qustion DBMS - 1

database management

Uploaded by

suppershort135
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
6 views

Sample Qustion DBMS - 1

database management

Uploaded by

suppershort135
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

Sample Questions

ICE 3105: Database Management Systems

Set Sl Data Storage Systems and Structures (Chapter 12 & 13) Mark
6. 1 Draw the storage device hierarchy and briefly describe the several types of 5/6
physical storage media for data store.
2 Draw and explain the schematic diagram of a magnetic disk. Or Write down 5/6
the characteristics of a magnetic disk with a simple figure.
3 Define the following terms: (i) Access time (ii) Seek time (iii) Average seek 4/5
time (iv) Rotational latency time (v) Average latency time (vi) Disk block
(vii) Page (viii) Sequential access (ix) Random access (x) MTTF.
4 Define Redundant Arrays of Independent Disks (RAID). Explain the 3/4
techniques to improve the reliability of a storage disk via RAID with figure.
Or explain RAID Levels.
5 Explain the techniques to improve the data transfer rate of a disk via 2/3
parallelism.
6 Which factors need to be taken into account in choosing a RAID level? 2/3
7 Write down different types of techniques for improving the speed of access 4/5
to blocks, by minimizing the number of accesses, and in particular
minimizing the number of random accesses.
8 Define fixed-length record with example. Write down the disadvantages of 2/3
fixed-length record.
9 What are the two different problems must be solved to representation of a 2/3
record with variable-length?
10 Define variable-length record. Explain the technique of a variable-length 4/5
record system with an example.
11 Define file. Write down few possible ways of organizing records in files. 3/4

Transactions (Chapter 17)


7. 1 All Definition (compensate transaction, roll back, transactions, serializable 3/4
schedules, serializability, )
2 What is transaction? Explain the ACID properties of transaction. 4/5
3 How many operations are occur on a data item during transactions? 2/3
4 Analysis or verify or check the ACID properties of the following transaction 4/5
Ti: read(A);
A := A − 50;
write(A);
read(B);
B := B + 50;
write(B)

5 Draw and explain/ briefly describe the state diagram of a transaction in 4/5
database management system.
6 What are the two options when a transaction enters into aborted state? 2/3
7 What are the two good reasons for allowing concurrency in the transaction 3/4
processing system?
8 Define conflict serializability. What are the four cases to find out whether a 3/4
read and write instruction on a data item is conflicting or not?
9 Define precedence graph. What are the three conditions to draw an edges of 3/4
precedence graph?
10 Consider the following two transactions: 4/5
T1 T2 T1 T2
read(A) read(A)
write(A) read(A)
read(A) write(A)
write(A) read(B)
read(B) write(A)
write(B) read(B)
read(B) write(B)
write(B) write(B)

Schedule 1 Schedule 2

Page 1 of 2
Analyze whether schedule is conflict serializable or not using precedence
graph.
11 Write down a short note about recoverable schedule or Cascadeless 2/3
Schedules.

Concurrency Control (Chapter 18)


8. 1 Explain various types of locking mode on a data item Q with a lock- 3/4
compatibility matrix.
2 Consider a banking example that A and B be two accounts that are accessed 6/7
by transactions T1 and T2. Transaction T1 transfers $50 from account B to
account A. Transaction T2displays the total amount of money in accounts A
and B that is, the sum A + B. Solve the following problem:
(i) Draw the concurrency-control manager grants schedule.
(ii) Find out the problem and solution if the concurrency-control
manager grants to unlock data item B too early.
3 Define starvation/ starved of transaction. Write down the granting of locks 3/4
manners to avoid starvation of transactions with an example.
4 Briefly describe Two-Phase locking protocol with an example. 4/5
5 Define lock manager. Explain how a lock manager processes the requests of 4/5
transection by using lock table.
6 Explain tree-structured database graph based locking protocol with a suitable 3/4
figure. Or write down the rules of tree-structured database graph based
locking protocol.
7 Write the down the two approaches to deadlock prevention. 3/4
8 What are the two different deadlock-prevention schemes using timestamps? 3/4
9 What does the system do when a deadlock has occurred? 2/3
10 How can you describe precisely the deadlocks by using wait-for graph? 3/4
11 Define deadlock. What are the three actions that are needed to recover from 4/5
deadlock in multiple transactions?

Page 2 of 2

You might also like