OSG202 Unit 2 Questions and Answrs 2024
1. Assume that jobs AD arrive in the ready queue in quick succession and have the CPU cycle requirements
listed below. Using the Shortest Remaining Time Next algorithm, the average waiting time is .
Arrival time: 0 1 2 3 Job: A B
CD
CPU cycle: 6 3 1 4
a. 2.75
b. 6.25
c. 7.75
d. 9.0: a
2. Which is a wrong statement about the quantum used in Round Robin algorithm?
a. If the quantum is very large, RR is essentially FCFS
b. If the quantum is very small, the CPU efficiency is reduced
c. A reasonable value of quantum is around 2050 ms
d. None of the others: d
3. (Multi-choice)
Preemption is essential in which of the following systems?
a. Batch system
b. Interactive system
c. Real time system
d. None of the others: bc
4. What is Software proposal in the solution of Mutual exclusion with Busy waiting
a. Lock Variables
b. Strict Alternation
c. Peterson's Solution
d. All of the others: d
5. The following requirement must be met by any facility or capability that is to provide support for mutual
exclusion:
a. Only one process at a time can be allowed into a critical code section
b. A process remains in its critical region for a finite time only
Inform
, OSG202 Unit 2 Questions and Answrs 2024
c. No assumption can be made about relative process speeds
d. All of the others: d
Inform
, OSG202 Unit 2 Questions and Answrs 2024
6. Which of the following process state transitions are illegal?
a. blocked > running
b. running > ready
c. blocked > ready
d. ready > running: a
7. Assume that jobs A-D arrive in the ready queue in quick succession and have the CPU cycle requirements
listed below. Using the Shortest Remaining Time Next algorithm, the Turnaround time of job
D is .
Arrival time: 0 1 2 3 Job: A B
CD
CPU cycle: 6 3 1 4
a.6
b.14
c.4 d.1:
a
8. Assume that jobs AD arrive in the ready queue in quick succession and have the CPU cycle requirements
listed below. Using the Shortest Remaining Time Next algorithm, the Waiting time of job A is .
Arrival time: 0 1 2 3 Job: A B
CD
CPU cycle: 6 3 1 4
a.8
b.14
c.0 d.1:
a
9. A ssume that four jobs AD require the CPU cycles listed below. Using the Shortest Job First algorithm, the
job is run first.
Arrival time: 4 1 0 2 Job: A B
CD
CPU cycle: 5 2 6 4
a.A
b.B
c.C d.D:
c
Inform
1. Assume that jobs AD arrive in the ready queue in quick succession and have the CPU cycle requirements
listed below. Using the Shortest Remaining Time Next algorithm, the average waiting time is .
Arrival time: 0 1 2 3 Job: A B
CD
CPU cycle: 6 3 1 4
a. 2.75
b. 6.25
c. 7.75
d. 9.0: a
2. Which is a wrong statement about the quantum used in Round Robin algorithm?
a. If the quantum is very large, RR is essentially FCFS
b. If the quantum is very small, the CPU efficiency is reduced
c. A reasonable value of quantum is around 2050 ms
d. None of the others: d
3. (Multi-choice)
Preemption is essential in which of the following systems?
a. Batch system
b. Interactive system
c. Real time system
d. None of the others: bc
4. What is Software proposal in the solution of Mutual exclusion with Busy waiting
a. Lock Variables
b. Strict Alternation
c. Peterson's Solution
d. All of the others: d
5. The following requirement must be met by any facility or capability that is to provide support for mutual
exclusion:
a. Only one process at a time can be allowed into a critical code section
b. A process remains in its critical region for a finite time only
Inform
, OSG202 Unit 2 Questions and Answrs 2024
c. No assumption can be made about relative process speeds
d. All of the others: d
Inform
, OSG202 Unit 2 Questions and Answrs 2024
6. Which of the following process state transitions are illegal?
a. blocked > running
b. running > ready
c. blocked > ready
d. ready > running: a
7. Assume that jobs A-D arrive in the ready queue in quick succession and have the CPU cycle requirements
listed below. Using the Shortest Remaining Time Next algorithm, the Turnaround time of job
D is .
Arrival time: 0 1 2 3 Job: A B
CD
CPU cycle: 6 3 1 4
a.6
b.14
c.4 d.1:
a
8. Assume that jobs AD arrive in the ready queue in quick succession and have the CPU cycle requirements
listed below. Using the Shortest Remaining Time Next algorithm, the Waiting time of job A is .
Arrival time: 0 1 2 3 Job: A B
CD
CPU cycle: 6 3 1 4
a.8
b.14
c.0 d.1:
a
9. A ssume that four jobs AD require the CPU cycles listed below. Using the Shortest Job First algorithm, the
job is run first.
Arrival time: 4 1 0 2 Job: A B
CD
CPU cycle: 5 2 6 4
a.A
b.B
c.C d.D:
c
Inform
