Computer Science · Database Management Systems
Suppose a B+ tree is used for indexing a database file with the following parameters: Search key field size = 10 bytes, Block size = 1024 bytes, Record pointer size = 9 bytes, Block pointer size = 8 bytes. If K is the maximum number of pointers in an internal node and L is the maximum number of records in a leaf node, find the values of (K, L).
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(34, 31)
- 2(60, 64)
- 3(50, 52)
- 4(57, 53)✓
Correct answer
(57, 53)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Database Management Systems MCQs →Want more practice questions on Database Management Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Database Management Systems