Data Structure and Algorithms MCQs
6. Question
Leaves of which of the following trees are at the same level ?
Answer
7. Question
A / B+ tree index is to be built on the name attribute of the relation STUDENT. Assume that all students names are of length 8 bytes, disk block are of size 512 bytes and index pointers are of size 4 bytes. Given this scenario what would be the best choice of the degree (i.e. the number of pointers per node) of the B+ tree ?
Answer
8. Question
The Inorder traversal of the tree will yield a sorted listing of elements of tree in
Answer
9. Question
Consider the following page trace :
4,3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5
Percentage of page fault that would occur if FIFO page replacement algorithm is used with number of frames for the JOB m = 4 will be
4,3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5
Percentage of page fault that would occur if FIFO page replacement algorithm is used with number of frames for the JOB m = 4 will be
Answer
10. Question
Pipelining strategy is called implement
Answer