Register

Dense index

1,066 views
1 1 vote

A block can hold either $12$ records or $42$ key pointers .A database contains $96$ records , then how many blocks are required to hold the data file and the dense Index?

a). $10$

b). $12$

c). $11$

d). $13$

2 Answers

2 2 votes
No of blocks for record=$96/12=8$

No of block for index=$96/24=4$

So total no of blocks= $12$
0 0 votes

No of blocks for record = 96/12 = 8

For indexing = ceil(96/42 ) = 3

Hence, 

So total no of blocks = 8+3 = 11  

Voting & Accepting an answer helps improve the community
← Previous · ComplexityNext → · N-ary tree
← Previous in category · TIFR CSE 2013 | Part...Next in category → · N-ary tree
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.1k
1.1k views
srestha asked Sep 16, 2017
1,103 views
Sparse and Dense index doubt
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...
0 0 votes
1 answers 1 answer
1.6k
1.6k views
shikharV asked Dec 8, 2015
1,565 views
Question on dense index
________ index is denseA) Primary indexB) clustered indexC) secondary index on candidate keyD) all
0 0 votes
1 answers 1 answer
863
863 views
focus _GATE asked Jun 30, 2015
863 views
Is there any condition in which we can say that dense index is sparse index??
Is there any condition in which we can say that dense index is sparse index?
0 0 votes
0 0 answers
887
887 views
Jibran asked Nov 13, 2018
887 views
self doubt about dense index
In dense index the index is created for every search key value, does it mean for every record there will be an entry in the dense index? if yes then clustering index need...