Register

Dense index

2,136 views
0 votes
0 votes

A block can hold either 6 records or 12 key pointers. A database contains 48 records, then how many blocks is required to hold the data file and the dense index?

  1.   6
  2.   8
  3.   12
  4.   18
User Avatar

1 Answer

Best answer
3 votes
3 votes

Total no of blocks required by data file=48/6=8

Total no of records needed by pointer=48/12=4 (key pointer=no of keys)

Total Blocks=8+4=12

I hope the answer helps you. The related question is given in the link below. You can refer it for more infor. :) 

https://gateoverflow.in/19400/isro2015-18

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
Deepalitrapti asked Aug 14, 2018
995 views
Sparse index and dense index
User Avatar
2 votes
2 votes
0 answers
3
Kajal Khobragade asked Nov 23, 2017
1,325 views
dense index
Suppose blocks hold either three records, or Ten (Key,pointer) pairs. As a function of n, the number of records, for dense index.How many levels of index as is appropriate until the final level of index has only one block? a) n/3^n b) log3n c) n/4^n d)log10n
Suppose blocks hold either three records, or Ten (Key,pointer) pairs. As a function of n, the number of records, for dense index.How many levels of index as is appropriat...
User Avatar
0 votes
0 votes
1 answer
4
srestha asked Sep 16, 2017
618 views
Sparse and Dense index doubt
Block size 1000 B Search key 12 B Pointer size 8B What is max records of DB 1) For Dense index B+ tree of 2 level 2) For Sparse index B+ tree of 2 level How ans will differ , Plz show
Block size 1000 BSearch key 12 BPointer size 8BWhat is max records of DB1) For Dense index B+ tree of 2 level2) For Sparse index B+ tree of 2 levelHow ans will differ , P...
User Avatar
Link Copied!