Answer:
Zoom in more please and than i can help
Explanation:
Answer:
Time taken to travel from one track to the next = 0.08ms
Initial track= 15 0
4 (15-4)*(0.08)= 0.88
40 (40-4)*(0.08)= 2.88
35 (40-35)*(0.08)= 0.4
11 (35-11)*(0.08)= 1.92
14 (14-11)*(0.08)= 0.24
7 (14-7)*(0.08)= 0.56
----------------------------------------------
Total seek time=0.88+2.88+0.4+1.92+0.24+0.56=6.88ms
Explanation:
We caculate the seek time for each request, and then add them together to find the total seek time. The final track number for the current request becomes the current track of next request, and this process is repeated till the last request is processed.
Answer:
a computer suitable for use at an ordinary desk.
noun: desktop computer
"a new low-end desktop"
Explanation:
please mark me as a brainly
Please Help! Unit 6: Lesson 1 - Coding Activity 2
Instructions: Hemachandra numbers (more commonly known as Fibonacci numbers) are found by starting with two numbers then finding the next number by adding the previous two numbers together. The most common starting numbers are 0 and 1 giving the numbers 0, 1, 1, 2, 3, 5...
The main method from this class contains code which is intended to fill an array of length 10 with these Hemachandra numbers, then print the value of the number in the array at the index entered by the user. For example if the user inputs 3 then the program should output 2, while if the user inputs 6 then the program should output 8. Debug this code so it works as intended.
The Code Given:
import java.util.Scanner;
public class U6_L1_Activity_Two{
public static void main(String[] args){
int[h] = new int[10];
0 = h[0];
1 = h[1];
h[2] = h[0] + h[1];
h[3] = h[1] + h[2];
h[4] = h[2] + h[3];
h[5] = h[3] + h[4];
h[6] = h[4] + h[5];
h[7] = h[5] + h[6];
h[8] = h[6] + h[7]
h[9] = h[7] + h[8];
h[10] = h[8] + h[9];
Scanner scan = new Scanner(System.in);
int i = scan.nextInt();
if (i >= 0 && i < 10)
System.out.println(h(i));
}
}