PRINCIPLES OF DATABASE DESIGN

MODULE 5

1. Primary indexes, secondary indexes and cluster indexes are all types of
a. ordered indexes
b. unordered indexes
c. linear indexes
d. relative search indexes
Answer: a
2. In multilevel indexes, primary index created for its first level is classified as

a. zero level of multilevel index

b. third level of multilevel index
c. second level of multilevel index
d. first level of multilevel index

Answer: c

3. In data file, first record of any of block is called

a. anchor record
b. dense record
c. non dense record
d. none of above

Answer: a

4. B+ tree follows:
a. Single level index
b. Multi level index
c. Both of the above
d. None of these
Answer: b
5. An internal node of the B+ tree can contain at least ________ record pointers except
the root node.
a. n
b. 2n
c. n/2
 d. n2
Answer: c

6. The leaf node of the B+ tree can contain at least __________ key values.
a. n
b. 2n
c. n/2
d. n2
Answer: c
7. B+ tree can support __________
a. Sequential access
b. Random access
c. Both of the above
d. None of these
Answer: c
8. __________ is a data structure technique to efficiently retrieve records from the
database files based on some attributes on which the indexing has been done.
a. Stack
b. Queue
c. Array
d. Indexing
Answer: d

9. The primary Indexing in DBMS is also further divided into

a. Dense Index
b. Sparse Index
c. None of these
d. Both of above
Answer: d
10. Which of the following is false?
a. A B+-tree grows downwards.
b. A B+-tree is balanced.
c. In a B+-tree, the sibling pointers allow sequential searching.
d. B+-tree is shallower than B-tree.
Answer: a
11. What is the maximum number of keys that a B+ -tree of order 3 and of height 3 have?
a) 3
 b) 80
c) 27
d) 26
Answer: d

12. Heuristic Optimization method is also known as

a. Rule based optimization.
b. Cost based optimization.
c. Set based optimization
d. Physical optimization.
Answer: a.
13. Query optimization is the overall process of choosing the most efficient means of
executing a
a. B-Tree
b. B+ -Tree
c. SQL statement
d. None of these
Answer: c
14. Indexing is used to locate and access the data in a quickly.
a. database table
b. dataset
c. tree
d. graph
Answer: a
15. Which of the following is true?
a) B + tree allows only the rapid random access
b) B + tree allows only the rapid sequential access
c) B + tree allows rapid random access as well as rapid sequential access
d) B + tree allows rapid random access and slower sequential access
Answer: c

16. Statement 1: When a node is split during insertion, the middle key is promoted to the
parent as well as retained in right half-node.
Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf
nodes of the tree.
a) Statement 1 is true but statement 2 is false
b) Statement 2 is true but statement 1 is false
c) Both the statements are true
d) Both the statements are false
Answer: a
17. A primary index is an ordered file whose records are of fixed length
a. Variable length
b. Fixed length
c. In some cases fixed and other cases variable.
d. None of the above.
Answer: b
18. A clustering index is an example of a
a. nondense index
b. dense index
c. secondary index.
d. None of the above
Answer: a
19. Indices whose search key specifies an order different from the sequential order of the
file are called ___________ indices.
a) Nonclustered
b) Secondary
c) All of the mentioned
d) None of the mentioned
Answer: c
20. In a _______ clustering index, the index record contains the search-key value and a
pointer to the first data record with that search-key value and the rest of the records
will be in the sequential pointers.
a) Dense
b) Sparse
c) Straight
d) Continuous
Answer: a