1 votes 1 votes Database file consist 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). The maximum number of levels of index required for sparse B+ tree index for database file are ______. Databases databases + – ashish pal asked Nov 22, 2017 ashish pal 806 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Red_devil commented Nov 22, 2017 i reshown by Red_devil Nov 22, 2017 reply Follow Share 4??? 0 votes 0 votes ashish pal commented Nov 22, 2017 reply Follow Share Yes, the answer as given on made easy website is 4 please post your complete solution. 0 votes 0 votes saxena0612 commented Nov 22, 2017 i edited by saxena0612 Nov 22, 2017 reply Follow Share I think it should be 3.[ Edit: Thanks Red_devil : which is height actually ] level=4 4 level All records of database are organized in 417 blocks. 3 level: 38 blocks which is able to point 418 blocks. 2 level 4 blocks 1level 1 block . 0 votes 0 votes Red_devil commented Nov 22, 2017 reply Follow Share you r right @saxena0612 but 1 level 0 4 level 1 38 level 2 417 level 3 so answer is 4 levels because they r asking no of levels 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Same question https://gateoverflow.in/162525/b-tree Brij Mohan Gupta answered Dec 3, 2017 Brij Mohan Gupta comment Share Follow See all 0 reply Please log in or register to add a comment.