1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Feliz [49]
3 years ago
6

Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150,

and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is:
Computers and Technology
1 answer:
Zina [86]3 years ago
7 0

Answer:

The queue pending requests of FIFO order is ;

86, 1470, 1774, 948, 1509, 1022, 1750, 130.

Explanation:

The FCFS schedule is 143, 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130.

Total seek distance is 7081.

The SSTF schedule is 143, 130, 86, 913, 948, 1022, 1470, 1509, 1750, 1774.

Total seek distance is 1745.

The LOOK schedule is 143, 913, 948, 1022, 1470, 1509, 1750, 1774, 130, 86.

Total seek distance is 3319.

The SCAN schedule is 143, 913, 948, 1022, 1470, 1509, 1750, 1774, 4999, 130, 86.

Total seek distance is 9769.

You might be interested in
jane feels listening to music at night helps her to sleep. should jane listen to music the night before a test ​
Pavel [41]

If it help her sleep than yes! Sleep helps you to stay focused during a test.

7 0
3 years ago
Write a recursive method that takes four inputs: a 1-D array of Strings (i.e., exams), the length of this 1-D array (i.e., n), a
ale4655 [162]

Answer:

import java.util.*;

public class Main

{

       public static void main(String[] args)  

       {

           String [] exams = {"1;2;3;4;" , "5;6;7;8;" , "9;10;11;12;" };

           double[][] n = new double[exams.length][4];

           examArray = convert(exams , exams.length , 0 , n);

           for(int i = 0 ; i < exams.length ; i++)

           {

               for(int j = 0 ; j < 4 ; j++)

               {

                   System.out.print(n[i][j] + "\t");

               }

              System.out.print("\n");

           }

       }    

       

/* recursive function convert defined here */

       public static double[][] convert(String[] exams , int number , int x , double [][] result)

       {

           if(x==number)

               return result;

           else

           {

               String total = exams[x];  

               String currentScore = "";

               int p = 0;

               for(int j = 0 ; j<totalScore.length() ; j++)

               {

                   char ch = total.charAt(j);/

                   if(ch==';')

                   {

                       result[x][p] = Double.parseDouble(currentScore);

                       p++;

                       currentScore = "";

                   }

                   else

                   {

                       currentScore = currentScore + Character.toString(ch);

                   }

               }

               return convert(exams , number , x+1 , result);

           }

           

       }

}

Explanation:

The Java source code defines a recursive function or method called convert that converts the results of three students that sat for four examinations to double or float number and screens their individual results for the four exams on the screen.

5 0
3 years ago
When installing EMT conduit that will be exposed to wet conditions, _______ fittings should be used.
Tasya [4]
Its a compression type fitting PENN FOS TEST
5 0
3 years ago
Write a Java application that inputs a series of 10 integers and determines and prints the largest and smallest integer. Use a c
klio [65]

Answer:

import java.util.Scanner;

public class LargestSmallest {

   public static void main(String[] args) {

       Scanner in = new Scanner(System.in);

       System.out.print("Enter 10 integers: ");

       int num = in.nextInt();

       int i = 1;

       int min = num, max = num;

       while (i < 10) {

           num = in.nextInt();

           if (num > max) max = num;

           if (num < min) min = num;

           i++;

       }

       System.out.println("Largest number: " + max);

       System.out.println("Smallest number: " + min);

   }

}

Explanation:

A Java application that inputs a series of 10 integers and determines and prints the largest and smallest integer is written above.

5 0
3 years ago
Create a function called howManyUntil(stopNum) where stopNum is an integer from 0 and 99
uysha [10]

Answer:

i dont get it

Explanation:

6 0
3 years ago
Other questions:
  • Write a function cipher(plaintext, n) to shift all characters in a string of text. Your function should take 2 parameters, the p
    15·1 answer
  • A plaintiff can bring a claim for intentional infliction of emotional distress when all but which of the following takes place:
    9·2 answers
  • Your IT manager wants you to set up three computers to appear to users as one powerful Windows Server 2016 server. What capabili
    14·1 answer
  • What do customers use to access the internet, usually for a monthly fee?
    6·1 answer
  • Can anyone help me with these assignments??? Hands On Assignments- Insertion of Symbols, Special Characters, and Images.... and
    9·1 answer
  • ? Question<br> How are the Internet and the World Wide Web different from each other?
    11·1 answer
  • What is the primary difference among a domain model, an analysis model, and a design model for the same project?
    15·1 answer
  • Can someone pls help with this (20 points)
    8·1 answer
  • 100 POINTS!!!!!!!!
    6·2 answers
  • you are a new lenovo service provider and need to use the recovery utility information on the lenovo support website. this infor
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!