ISRO exam 2016 – Question 59 with Solution

In this video we are going to discuss another question which was asked in the exam of ISRO

1. The order of a leaf node in a B – tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the order of the leaf node?

• 63
• 64
• 67
• 68