Consider the following system with four processes (P1, P2, P3, P4), when answering the following three questions. A C. Process ID Arrival time Burst time PI P2 P3 P4 12. What would be the total waiting time for process P2 if SRTF scheduling algorithm were applied? 15 A B. 30 C. 20 D. 35 E. Other: 5 A C. 0 15 30 45 A Waiting, CPU, all C. Waiting, memory, all 20 25 15 10 13. The order of execution after applying the SJF scheduling algorithm is P1, P2, P3, P4 P1, P2, P4, P3 P4, P3, P1, P2 PI, P4, P3, P2 B. D. E. Other: 14. What would be the average waiting time if FCFS scheduling algorithm were applied? 17.5 B. 35 875 D. 15 E. Other 15. A(n)..... occurs when a process could run but doesn't because other processes keep getting in ahead of it. A Turnaround B. Starvation C. Sleep D. Convoy effect E. Other: 16. The short-term scheduler, or CPU scheduler, selects from among the processes that are ------to execute and allocates the to...of them.? B. Ready, memory, all D. Ready, CPU, one E Other

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Please send me answer within 10 min!! I will rate you good for sure!! Please solve all the questions!! Please!!!

Consider the following system with four processes (P1, P2, P3, P4), when answering the following three
questions.
A
C.
12. What would be the total waiting time for process P2 if SRTF scheduling algorithm were applied?
A. 15
B. 30
C. 20
Process ID Arrival time Burst time
PI
20
P2
25
P3
15
P4
10
13. The order of execution after applying the SJF scheduling algorithm is
P1, P2, P3, P4
P1, P2, P4, P3
P4, P3, P1, P2
PI, P4, P3, P2
A Waiting, CPU, all
C. Waiting, memory, all
0
15
30
45
Other:
14. What would be the average waiting time if FCFS scheduling algorithm were applied?
A
17.5
B. 35
C. &75
D. 15
E. Other
15. A(n)..... occurs when a process could run but doesn't because other processes keep getting in ahead of it.
A Turnaround
B. Starvation
C. Sleep
D. Convoy effect
E. Other:
16. The short-term scheduler, or CPU scheduler, selects from among the processes that are
D. 35
E. Other: 5
execute and allocates the... to...of them.?
B.
D.
E.
18. The variables i and j are allocated in
A Heap segment
C. Data segment
19. The variable x is allocated in
17. One popular variation on the ...........model still multiplexes many user-level threads to a smaller or
equal number of kernel threads but also allows a ....... thread to be bound to a .......
A. One-to-many, user-level, kernel thread
C. Many-to-one, user-level, kernel thread
B. Many-to-many, kernel thread, user-level
D. Many-to-many, user-level, kernel thread
E. Other:
threadl ()1
for (int i=0; i<5; i++) {
x
x + 1;
System.out.print (x +
- ");
Consider a program that contains the following two threads. The threads are running concurrently, and x initial
value is 0. Answer the following four questions
A Heap segment
C. Data segment
B. Ready, memory, all
D. Ready, CPU, one
E Other:
thread2 () {
for (int j-0; j<5; j++){
x-x+ 21
System.out.print (x+"");
J
1
to
B. Process registers
D. Thread registers
E Other:
B. Process registers
D. Thread registers
E. Other:
20. The followings are possible outputs on the screen when I = 3 and j =2 except
A 12357
B. 12243
C. 13467
D. 24567
1
E. Other:
Transcribed Image Text:Consider the following system with four processes (P1, P2, P3, P4), when answering the following three questions. A C. 12. What would be the total waiting time for process P2 if SRTF scheduling algorithm were applied? A. 15 B. 30 C. 20 Process ID Arrival time Burst time PI 20 P2 25 P3 15 P4 10 13. The order of execution after applying the SJF scheduling algorithm is P1, P2, P3, P4 P1, P2, P4, P3 P4, P3, P1, P2 PI, P4, P3, P2 A Waiting, CPU, all C. Waiting, memory, all 0 15 30 45 Other: 14. What would be the average waiting time if FCFS scheduling algorithm were applied? A 17.5 B. 35 C. &75 D. 15 E. Other 15. A(n)..... occurs when a process could run but doesn't because other processes keep getting in ahead of it. A Turnaround B. Starvation C. Sleep D. Convoy effect E. Other: 16. The short-term scheduler, or CPU scheduler, selects from among the processes that are D. 35 E. Other: 5 execute and allocates the... to...of them.? B. D. E. 18. The variables i and j are allocated in A Heap segment C. Data segment 19. The variable x is allocated in 17. One popular variation on the ...........model still multiplexes many user-level threads to a smaller or equal number of kernel threads but also allows a ....... thread to be bound to a ....... A. One-to-many, user-level, kernel thread C. Many-to-one, user-level, kernel thread B. Many-to-many, kernel thread, user-level D. Many-to-many, user-level, kernel thread E. Other: threadl ()1 for (int i=0; i<5; i++) { x x + 1; System.out.print (x + - "); Consider a program that contains the following two threads. The threads are running concurrently, and x initial value is 0. Answer the following four questions A Heap segment C. Data segment B. Ready, memory, all D. Ready, CPU, one E Other: thread2 () { for (int j-0; j<5; j++){ x-x+ 21 System.out.print (x+""); J 1 to B. Process registers D. Thread registers E Other: B. Process registers D. Thread registers E. Other: 20. The followings are possible outputs on the screen when I = 3 and j =2 except A 12357 B. 12243 C. 13467 D. 24567 1 E. Other:
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Fundamentals of Memory
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education