Answer:
The answer is below
Explanation:
a)
If the blocks of a file are not put together, that is for nonadjacent block of files to each other, the time (t) taken to read a 100 block file is:
t = (average seek + rotational latency + transfer time) * 100 block
Average seek = 5 msec, rotational latency = 10 msec and transfer time = 20 microsec = 0.02 msec
t = (5 + 10 + 0.02) * 100 = 1502 msec
b)
If the blocks of a file are put together, that is for adjacent block of files to each other, the time (t) taken to read a 100 block file is:
t = (seek time * mean interblock distance + rotational latency + transfer time) * 100 block
seek time = 100 microsec = 0.1 msec, rotational latency = 10 msec and transfer time = 20 microsec = 0.02 msec, mean interblock distance = 2 cylinders
t = (0.1*2 + 10 + 0.02) * 100 = 1022 msec
Answer:
Merge sort
Explanation:
The various types of sorting algorithms are
1. Quick sort
2. Bubble sort
3. Selection sort
4. Insertion sort
5. Merge sort
6. Heapsort
The algorithm that performs best for an already sorted list is the insertion sort
While the algorithm that performs worse for an already sorted list is the merge sort since it divides the sorted list into sub list before it operations
Answer:
B. False.
Explanation:
Troubleshooting strategy is a technique used to discover the cause of defeat in a system. The technician must learn to improvise with these strategies to solve a system problems.
Module replacement is a type of troubleshooting strategy that replaces a component with unknown status with another component with good status to determine the cause of the problem.
Removing a component from a system to get back to its basic configuration helps to eliminate factors that may make a computer problem difficult to solve.
upfront price, but dependent on how long you use it you will save money, also the power it provides per square inch is low but that will be solved with time.
