Answer:
I hate it
Explanation:
Mark it as the brainliest if u love god
Answer:
C
Explanation:
This is the easiest, quickest, and least destructive method.
Answer:
<em>The </em><em>answer </em><em>is </em><em>(</em><em>A)</em>
Explanation:
Double-click both the worksheet tabs one at a time and then enter the new names.
Answer:
the making note cards and quizzing yourself
Explanation:
Answer and Explanation:
Given that total number of records in a file = 100000
Each record consists of= 240 bytes
Given that B= 2400 bytes.
Then total blocks in file = 100000 records * 240 / 2400
= 10000 blocks.
Time that will take for exhaustive read
= s + r + b.btt
= 16 + 8.3 + (10000) * 0.8
= 8024.3 msec
Now as per given X be the number of records that are searched randomly and it takes more than exhaustive read time.
Hence, X (s + r + btt) > 8024.3
X (16+8.3+0.8) > 8024.3
X > 8024.3/25.1
So that, X > 319.69
Hence, atleast 320 random reads should be made to search the file