Skip to main content

Calculate the order of the leaf node for a B+ tree .....GATE Test Series-1 Important Questions-2

By
Calculate the order of the leaf node for a B+ tree which has a search key field of 10 Bytes long, record pointer of 10 bytes long, block pointer of 8 bytes long, and block size of 1024 Bytes. (where order = the maximum block pointer) (A) 51 (B) 47 (C) 64 (D) 128 Similar Question 
Post a Comment

Calculate the order of the leaf node for a B+ tree .....GATE Test Series-1 Important Questions-2

Image
By
Calculate the order of the leaf node for a B+ tree which has a search key field of 10 Bytes long, record pointer of 10 bytes long, block pointer of 8 bytes long, and block size of 1024 Bytes. (where order = the maximum block pointer)

(A) 51

(B) 47

(C) 64

(D) 128


Labels:

Comments

Post a Comment

Comment ,share and subscribe for more such beautiful contents

Popular posts from this blog

Consider the following infix expression....... GATE Test Series-1 Important Questions-1

By
Consider the following infix expression which is to be converted to postfix expression using stack. (((P+Q)*(R+S))/T)+(A*(B+C)) The sum of all unique possible heights at each pop is Reference Link
Post a Comment
Read more