Question 3363 – 2015 December NTA UGC NET Paper 1
February 21, 2024Research-Aptitude
February 21, 2024Database-Management-System
| Question 276 |
Consider a table T in a relational database with a key field K. A B-tree of order p is used as an access structure on K, where p denotes the maximum number of tree pointers in a B-tree index node. Assume that K is 10 bytes long; disk block size is 512 Bytes; each data pointer D is 8 bytes long and each block pointer PB is 5 bytes long. In order for each B-tree node to fit in a single disk block, the maximum value Of p is
| 22 | |
| 23 | |
| 32 | |
| 20 |
Question 276 Explanation:
< img src=”https://solutionsadda.in/wp-content/uploads/2020/04/Screenshot_520.png”>
Correct Answer: B
Question 276 Explanation:
< img src=”https://solutionsadda.in/wp-content/uploads/2020/04/Screenshot_520.png”>
Subscribe
Login
0 Comments