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
The answers are 1, 3, and 5.
You can have paragraph alignment which is left, right, and center
Here are some of the computers used in the first generation of computers:
ENIAC
EDVAC
UNIVAC
IBM-701
IBM-650
These are some of the first computers ever that led to today's computers.
Answer:
Explanation:
(a) aaAbb (b) bBab (c) aaAbB b
The parse tree and phases are shown in the attached diagram below
