NPTEL Data Base Management System Week 6 Assignment Answers 2025
1. Which of the statements) is (are) correct?
a) B-tree indexing requires less number of nodes than a corresponding B+ tree.
b) Non-leaf nodes of B-tree do not contain record pointers.
c) Size of non-leaf nodes of B+ tree is larger than the leaf nodes.
d) Sequential traversing is also possible in B+ tree.
Answer :- For Answers Click Here
2.

Answer :-
3. Consider a hash table of size m = 1000 and the hash function h(k) = Round(k ÷ 7) % 1000. Compute the location where the key k = 97531 will be stored.
a) 97
b) 139
c) 531
d) 933
Answer :-
4. How many maximum numbers of keys, a B-tree of order 6 can store? The height of the tree is 4 and the root node is assumed to be in height zero.
a) 9330
b) 7775
c) 1554
d) 1295
Answer :-
5. In a B+ tree indexing, size of the search key field is 10 bytes. If the block size is 2 kilobytes
and the block pointer size is 14 bytes, calculate the order of a non-leaf node?
a) 204
b) 146
c) 85
d) 58
Answer :-
6. A relational table is saved in the disk and indexed with bitmap index. Size of the bitmap indexed file is 512 bytes. If there are 16 distinct values in the index column, how many rows are there in the relation table?
a) 256
b) 128
c) 64
d) 32
Answer :- For Answers Click Here
7.

Answer :-
8. A hash table contains 10 (indices 0 to 9) buckets and uses linear probing to resolve collisions. The key values are integers and the hash function used is (key % 10). Given the following input (221, 334, 447, 771, 574, 427, 673, 841), which of the following statements is true?
a) 334, 841 hash to the same bucket.
b) 221, 771, 841 are stored in buckets 1, 2, 3.
c) 673, 334 are stored in buckets 3 and 4.
d) 574 is stored in bucket 4.
Answer :-
9.

Answer :-
10. Suppose there is a relation student (id, name, age), with a B+tree index with search key id. What is the worst-case cost of finding records satisfying 20 ‹ id ‹ 40 using this index, in terms of the number of records retrieved m and the height of the tree is h?
a) O(m*h)
b) O(2*h +m)
c) O(log h +m)
d) Oh+m)
Answer :- For Answers Click Here