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
An app you can look up on Google chrome called Aptoide has it on there for you to install.
Answer:
x_inp = [ '1', '2', '3']
int_val = [ int(a) for a in x_inp ]
print("integer: int_val")
y_inp = [ '1.0', '2.0', '3.0']
flo_val = [ float(a) for a in y_inp ]
print("float: flo_val")
Explanation:
All the items in the arrays x_inp and y_inp are coverted to integer and float data types respectively with the for loop statement, which individually assigns the resolved integer and float values to the memory locations int_val and flo_val respectively.
The output becomes,
integer:
1
2
3
float:
1.0
2.0
3.0
