1,013 views

1 Answer

0 0 votes

(10)

 for 10,000  records we require 100 blocks as question said only one block should present at a time in a memory with access time of 10 MS than to access the block from memory is should require atleast 980 MSEC because our word is present in 98th  block so first block access is (10+reamining access of 97 blocks will be 970 MSEC )but those 97 blocks should be replaced from secondary storage to memory and that time should be added to 980 MSEC so i think answer should be 980 MSEC.

(11)

as primary index is built and index block contain 100 enteries ,there are 100 blocks of data file present and each FIRST RECORD(ANCHOR RECORD) should BE MADE AS INDEX ENTRY so NO OF ANCHOR RECORDS ARE 100 (i,e 100 BLOCKS) therefore 100 index entry in primary index

so to search index block need 10 MSEC AND AFTER THAT ACCCESING  OF DATA FILE FURTHER REQUIRES ONE BLOCK ACEESS 

total 2 BLOCK ACCES =20 MSEC.

Position:
Show:

Related questions

3 3 votes
1 1 answer
2.9k
2.9k views
akshayaK asked Jan 21, 2019
2,877 views
Secondary key over key is dense and secondary key over non key is sparseis it correct ?i think it should beSecondary key over non key is dense and secondary key over key ...
0 0 votes
0 0 answers
376
376 views
Mayank Gupta 3 asked Dec 16, 2018
376 views
What is the difference between primary multilevel index and B tree?
0 0 votes
0 0 answers
890
890 views
Jibran asked Nov 13, 2018
890 views
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...
0 0 votes
1 1 answer
1.2k
1.2k views
utpal podder asked Sep 18, 2018
1,220 views
if p:order of the internal of b+ tree which represents the maximum number of child pointer that the internal node can havethen the minimum number of keys possible in the...