Question 59

The orderofa leaf node in a B+ tree is the maximum numberof (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 andablock pointeris 6 bytes long, what is the orderofthe leaf node?

Create a FREE account and get:

Download Maths Shortcuts PDF
Get 300+ previous papers with solutions PDF
500+ Online Tests for Free

CAT Quant Questions | CAT Quantitative Ability

CAT Averages Questions CAT Number Systems Questions CAT Venn Diagrams Questions CAT Remainders Questions CAT Averages Mixtures Alligations Questions

CAT DILR Questions | LRDI Questions For CAT

CAT Quant Based DI Questions CAT Puzzles Questions CAT Data Interpretation Basics Questions CAT DI with connected data sets Questions CAT Maxima-Minima Questions

CAT Verbal Ability Questions | VARC Questions For CAT

CAT Para Jumbles Questions CAT Odd One Out Questions CAT Miscellaneous Questions CAT Para Summary Questions CAT Reading Comprehension Questions

Follow us on

Boost your Prep!

Download App