R20 - DATABASE MANAGEMENT SYSTEMS (CSE)
MATERIALS UNIT-I Download UNIT-II Download UNIT-III Download UNIT-IV Download UNIT-V Download B+ TREES Download INDEXING Download IMPORTANT QUESTIONS FROM UNIT-3,4,5 1. Define Normalization. Explain 3NF, 4NF with examples. 2. Consider the relation R (A,B,C,D,E,F) and FDs A → BC, F → A, C → A, D → E, E → D. A→D is the decomposition of R into R1 (A,C,D), R2(B,C,D) and R3(E,F,D) lossless? Explain the requirement of Lossless decomposition. 3. Define Decomposition. Explain different types of Decompositions with examples. 4. What is concurrency control? Explain the two phase locking protocol with an example. 5. Construct a B+−tree for set of key values: (2, 3, 5, 7, 11, 17, 19, 23, 29, 31). Assume that the tree is initially empty and values are added in ascending order. Construct B+tree for the cases where the number of pointers that will fit in one node is 4, 6 and 8. 6. Discuss about Triggers and active Dat...