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
leonid [27]
3 years ago
14

Round Robin Algorithm

Computers and Technology
1 answer:
Reil [10]3 years ago
7 0

Answer:

Please check the attachment.

Explanation:

avg turnaround time = (38+7+42+33+18)/5= 27.6

avg waiting timee = (33+5+28+23+17)/5= 21.2

And its D, A C in Gantt chart at last and exit time are 33, 38 and 42 mentioned as last three in Gantt chart.

You might be interested in
You can select slide objects in order to delete them simultaneously by pressing the _____ key as you click each object. select o
HACTEHA [7]
D tab that is the key you would need to use in order to do that
6 0
3 years ago
Read 2 more answers
. SQL is a(n) _____ language.
Blababa [14]

Answer: Fourth- generation language

Explanation:Structured Query Language (SQL) is the language that is in the form of database structure which helps in the manipulation of the data and management as well.

SQL is considered as the fourth generation language because it is used for the accessing of the data from the database.It is also known for the advancement in the third generation language and thus also improving the language interface with users.

7 0
3 years ago
The advantage of an electronic ____ is that the content can be easily edited and updated to reflect changing financial condition
Lana71 [14]
Computer.................................
6 0
3 years ago
Which image-editing tool can be used to help remove spots and other marks from an image?
Mrac [35]
C. Healing brush
That’s the answer
5 0
2 years ago
Write pseudocode to solve the following problem: You are given an array A[1 . . . n] whose each element is a point of the plane
bixtya [17]

Answer:

Answer explained below

Explanation:

void bubbleSort(int X[], int Y[], int n)

{

   int i, j;

   for (i = 0; i < n-1; i++)      

     

   // Last i elements are already in place

   for (j = 0; j < n-i-1; j++)

       if (X[j] > X[j+1])

{

swap(X[j],X[j+1])

swap(Y[j],Y[j+1]);

}

       if (X[j] == X[j+1]&&Y[j]<Y[j+1])

{

swap(X[j],X[j+1])

swap(Y[j],Y[j+1]);

}

}

Since the above algorithm contains 2 nested loops over n.

So, it is O(n^2)

5 0
3 years ago
Other questions:
  • Nunya is a computer software company that employs highly intelligent, but somewhat unusual people. Every Friday, free lollipops,
    13·1 answer
  • To quit Word, click the Restore button on the right side of the title bar. <br> True <br> False
    6·1 answer
  • What can help establish the focus and organization it relies on? A) Plan B) programming C) organizing D) arranging
    5·2 answers
  • You use a cisco 2900 router in your network. you are considering purchasing and implementing the Unifield communications feature
    8·1 answer
  • WILL UPVOTE ALL
    10·1 answer
  • How can injection attacks be prevented? Check all that apply
    6·2 answers
  • What is faster C++ or go lang
    15·1 answer
  • Application area of word processor?​
    8·2 answers
  • It's the same drop-down answers for both.
    15·1 answer
  • Escribe 10 ejemplos de lo que consideras un byte
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!