Q26 .A B+tree index is to be built on the name attribute of the relation STUDENT. Assume that all students

Options (A) 16 (B) 42 (C) 43 (D) 44 Answer © 43. Explanation. The order of a leaf node in a B+ - tree is the maximum number of value or data record pointer pairs it can hold. Given that the block size is 512 bytes, the value field is 8 bytes long and index pointer is 4 bytes long, order of leaf node B+ tree can be determined by formula n*k+ n* r + b = block size so it gives n*4+ n*8=512. so N=43.