DBMS Assignment
1. What is the purpose of normalization in databases?
2. Define 1NF, 2NF, and 3NF with example.
3. Decompose relation R(A,B,C,D) with FD: A→B, B→C, C→D into 3NF.
4. Is the decomposition of R(A,B,C) into R1(A,B) and R2(B,C) always lossless?
5. Define ACID properties.
6. What happens if a transaction fails before completion?
7. Write a schedule of transactions that shows a dirty read anomaly.
8. Which ACID property does a checkpoint mainly support?
9. What is the purpose of concurrency control?
10.Name two types of concurrency control protocols.
11.What is a deadlock in DBMS? Give an example.
12.Draw a wait-for graph that represents a deadlock scenario.
13.What is the difference between B-tree and B+ tree indexing?
14.Why are B+ trees preferred in databases over B-trees?
15.If a B+ tree has an order d = 3, what is the maximum number of keys in a node?
16.Construct a B+ tree of order 2 for the sequence: 10, 20, 5, 6, 12, 30, 7.
17.Define primary index and clustering index with examples.
18.Can a table have multiple clustering indexes?
19.What is a sparse index?
20.What is the difference between dense and sparse index?
21.Explain the concept of lossless join decomposition.
22.How to check for lossless join using FD?
23.Give an example of lossy join decomposition.
24.What does a lossy join imply in data design?
25.Given: R(A,B,C) with A→B, B→C, what is the key of R?
26.Find candidate keys for R(A,B,C,D) with FDs: A→B, B→C, C→D.
27.How many disk accesses in worst case for B+ tree of height 3?
28.For 1 million records and page size of 100, how many levels in B+ tree (order=100)?
29.How does 2PL prevent concurrency issues?
30.What’s the anomaly if 2PL is not followed?
