Answer:
length is your answer
Explanation:
Have a great day! ^-^
can you me as brainliest if its right? i need 10000 points and 35 brainliest's to rank up to genius
I think the answer to this would be true
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
Answer:
Phased installation
Explanation:
The name of this strategy is phased installation. Phased installation (or phased implementation) occurs when an existing system is replaced by a new one. However, unlike most implementations, this takes place in stages. This has several advantages. First, it allows you to test the system. If there is a problem with it, it is easier to revert back to the old strategy. Moreover, if employees need to adopt this new system, it allows them to get used to it slowly while still being able to access the previous one.
Answer:
Data is the correct answer
