Question 67

A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that
could be newly created in the process are

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 Probability, Combinatorics Questions CAT Remainders Questions CAT Venn Diagrams Questions CAT Inequalities Questions CAT Time Speed Distance Questions

CAT DILR Questions | LRDI Questions For CAT

CAT Quant Based DI Questions CAT DI Miscellaneous Questions CAT Quant Based LR Questions CAT Arrangement Questions CAT DI with connected data sets Questions

CAT Verbal Ability Questions | VARC Questions For CAT

CAT Miscellaneous Questions CAT Grammar and Sentence Correction Questions CAT Critical Reasoning Questions CAT Vocabulary Questions CAT Verbal Ability Questions

Follow us on

Boost your Prep!

Download App