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 Rudolph Rule states that simple ways you can make information stand out and guide or satisfy your audience to important details and highlight important information in your presentation
so i conclude option D is correct for above statement
hope it helps
Answer:
identifying yourself in a post or e-mail
writing short
respecting others privacy
Explanation:
Answer:
class OddNumber
{
public static void main(String args[])
{
int n = 1000; //Store 1000 in Variable n typed integer
System.out.print("Odd Numbers from 1 to 1000 are:"); // Print headline of output window
for (int i = 1; i <= n; i++) //For loop to go through each number till end
{
if (i % 2 != 0) //check if number is even or odd.Not divisible by 2 without reminder means it is odd number
{
System.out.print(i + " "); //print odd numbers
}
}
}
}
Answer:
Technology > Network report. All traffic > Source/Medium report.
Explanation:
hope this helps
