QUESTION BANK- DATABASE MANAGEMENT SYSTEM
MODULE 4: Normalization for Relational Database
1. Find the key and normalize.
Book_Title| Auth_Name|Book_type|List_Price|Affiliation|Publication.
FD’s are { Book_Title - > Book_Type, Puiblication
Auth_Name - > Affiliation,
Book_Type - > List_Price}
2. Consider the following relation
CAR_SALE(CAR_NO, DATE_SOLD, SALESMAN_NO, COMMISION%,DISCOUNT)
Assume a car can be sold by multiple salesman and hence primary key is {CAR_NO,SALESMAN_NO}
additional dependencies are DATE_SOLD - > DISCOUNT and SALESMAN_NO - > COMMISSION%.
i) Is this relation in 1NF, 2NF or 3NF?? Why or why not??
ii) How would you normalize this completely?
3. Why normalization is required? Explain the first, second, third normal form with an example.
4. Explain BCNF with an example.
5. List and explain six inference rules for normalizing a relational schema
6. Define closure. Write an algorithm to find closure.
7. Construct an algorithm to find closure of ‘X’. R{A,B,C,D,E,F} with
FD= {A-> B, B->C, C->D E->F} Construct closure of A+.
8. Explain the following terms with example.
i. Functional dependency
ii. Partial functional dependency
iii. Full functional dependency
9. Consider the following relation
CAR-SALE (Car#, Date-sold, Salesman#, commission%, Discount-amt)
Assume that {Car#, Salesman#} is the primary key.
Additional dependencies are
FD1: Date-sold -> Discount-amt
FD2: Salesman# -> commission%
Based on the given primary key, Is this relation in 1NF, 2NF or 3NF? Why or why not?
How would you successively normalize it completely?
10. Consider the universal relation R={A,B,C,D,E,F,G,H,I,J} and the set of functional
dependencies F={{A,B}-> {C},{A}-> {D,E}, {B}-> {F}, {F}-> {G,H}, {D}-> {I,J}}.
What is a key of R?
Decompose R into 2NF and then 3NF relations.
MODULE 5:Transaction Processing
1. What are ACID properties? Explain with an example.
2. What is phantom problem? Explain with an example.
3. Explain the problems that can occur when concurrent transactions are executed. Give example why
concurrency control is needed.
4. Explain locking and unlocking operations for binary locks.
5. Explain locking and unlocking operations for shared/exclusive locks.
6. Explain Multiversion concurrency control technique based on timestamp ordering.
7. Explain the states of transaction to depict State transition diagram of it.
8. Explain the concept of two phase locking techniques for concurrency control
9. Explain Multiversion 2- phase locking protocol using certify locks.
10. Explain how 2-phase locking protocol guarantees serializability.
11. Explain how shadow paging helps to recover from transaction failure.
12. Explain 2-phase commit protocol for recovery in multidatabase system.
13. Illustrate transaction roll back and cascading roll back with a neat diagram.
14. Describe the characteristics of NOSQL database systems.
15. Explain how views and materialized views are different
16. Differentiate SQL and NoSQL.
17. Explain how data is modelled in various types of NOSQL database systems.
18. What is a Graph database? Explain with an example how nodes and relationships are created.
19. What are Schemaless databases. Bring out the advantages and problems of schemaless databases over
Schema-base databases.
20. Explain Materialized view for NoSQL in detail.
21. Explain the following:
i) Key-value store
ii) Column-family store
iii) Document database
