Answer:
Given the number of platters =5
A. Hence, the number of recording surface =10
B. number of read-write heads =10
C. Number of arms holding the read-write heads = 10
Explanation:
We know that number of recording surface = 2 *( number of platters)
= 2*5=10
And the number of read-write heads = number of recording surface= 10
Also, number of arms holding the read-write head = one for each read-write head= 10
And hence, the above answer.
Answer:
The main benefit of the ordered list is that you can apply Binary Search( O( n log n) ) to search the elements. Instead of an unordered list, you need to go through the entire list to do the search( O(n) ).
The main cost of the ordered list is that every time you insert into a sorted list, you need to do comparisons to find where to place the element( O( n log n) ). But, every time you insert into an unsorted, you don't need to find where to place the element in the list ( O(1) ). Another cost for an ordered list is where you need to delete an element, you have an extra cost rearranging the list to maintain the order.
Answer:
True
Explanation:
The while loop is going to be executed until the condition is false.
Since <em>k</em> is initially equal to 1, the loop will execute 88 times. One asterisk will be printed and <em>k</em> will be incremented by one during each iteration.
When <em>k</em> becomes 89, the condition will be false (89 is not smaller or equal to 88) and the loop will stop.
