- What is Hashing? Explain 
- Write short notes on Indexing 
- Explain Record Formats with suitable examples 
- Explain the differences between each of the following - 
- 
|  | Primary
        versus secondary indexes |  - 
|  | Dense
        versus sparse indexes |  
 
- Describe various Buffer replacement policies. 
- Write short notes on Clustered versus Unclustered Indexes 
- What is Indexing? Explain with an Example. How do you create an Index.
    What are the uses of Indexes? 
- Write Short notes on B+ tree 
- Constuct a B+ Tree for the folowing set of key values (2, 3, 5, 7, 11,
    17, 19, 23, 29, 31) where the no. of pointers that will fit in one node is three. 
- Write short notes on multiple key access 
- Explain File Organization techniques. 
- Describe buffer management techniques 
- Explain External Sorting. 
- What is a secondary key.Why secondary keys are necessary? 
- Explain Various kinds of indexes for file organization. 
- Distinguish between static and dynamic hash functions. 
- Explain how insertion and deletion operations are performed on B+trees
    with examples. 
- Explain static Hashing. 
- Explain the differences between the three storage devices - Volatile,
    non-Volatile and stable.