Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Wansari
0
votes
1
UGC NET CSE | December 2019 | Part 2 | Question: 38
In a B-Tree, each node represents a disk block. Suppose one block holds $8192$ bytes. Each key uses $32$ bytes. In a B-tree of order $M$ there are $M-1$ keys. Since each branch is on another disk block, we assume a branch is of $4$ bytes. The total memory requirement for a non-leaf node is $32 M -32$ $36 M – 32$ $36 M – 36$ $32 M – 36$
In a B-Tree, each node represents a disk block. Suppose one block holds $8192$ bytes. Each key uses $32$ bytes. In a B-tree of order $M$ there are $M-1$ keys. Since each ...
1.1k
views
answered
Jan 10, 2022
Others
ugcnetcse-dec2019-paper2
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register