Đề chuẩn

1.
Low context switch operating costs ___________ degree of
multiprogramming in the system
Select one:

increases

decreases

unaffects

2.
Match the following pairs of data:
Ready → RunningDispatch
Blocked → Ready Wake up

3.
The CPU transferring from one process/thread to another is
called
Select one:

task switch

the rest of the options are correct

context switch

process switch

4.
Match the following pairs of data:
LIFO Stack operation
Round RobinTime sharing
Scan Disk check
5.
Process is also known as
Select one:

thread

heavy weight process

light weight process

the rest of the options are not correct

6.
In a time-sharing operating system, when the CPU time
allocated to a process expires, what state will the process go
from running to?
Select one:

Terminated

Suspended

Blocked

Ready

7.
The term "aging" refers to
Select one:

letting the process sit in memory for a certain amount of time so

that it can accurately estimate the number of pages needed.

gradually increase the priority of long-awaited processes in the

system to overcome the infinite process blocking
initialization of a process in a multilevel queue without a
response.

keeping track of how a page is swapped in/out memory

according to the LRU page replacement algorithm

8.
Which system call returns the PID of the terminated child
process?
Select one:

get

wait

fork

exit

9.
The performance of the Round Robin algorithm is highly
dependent on
Select one:

CPU time required by the process

size of the process

data export/import time of the process

The magnitude of the time quantum

10.
In Unix, what system call creates a new process?
Select one:

release
fork

new

create

12.
The state of a process is determined by
Select one:

the last activity of the process

the next operation to be performed by the process

current activity of the process

the operation just performed by the process

14.
Aging saves low-priority processes from resource

15.
What is Dispatch Latency ?
Select one:

the rest of the options are all wrong

the time taken by the processor to write a file to disk

the time lost by the dispatcher to stop one process and start
another

the entire time used by the processor

16.
What is Inter-Process Communication?
 Select one:

communication within the process

communication between 2 threads of the same process

communication between two processes

the rest of the options are all wrong

17.
Inter-Process Communication
Select one:

allows processes to communicate and synchronize their actions

without using the same address space

allows processes to communicate and synchronize their actions

using the same address space

allows processes to synchronize only their activity without

communication

The rest of the options are incorrect

18.
READY is the state of a process
Select one:

when process is using CPU

the rest of the options are wrong.

when the process is scheduled to run after execution

when a process cannot run until a certain task is completed

 19.
 A process may transition tothe Ready state by which of the
following actions?

A) Completion of an I/O event

B)Awaiting its turn on the CPU

C) Newly-admitted process

D) All of the above

20.
If the resource is always preempted from the same process,
starvation can happen 

21.
Which word does not indicate the state of a process?
Select one:

finished

ready

the rest of the options are all wrong

new

running

22.
Consider a system with 4 processes with the following
parameters:
  Process  Arrival time   Burst time
P1 0 5
P2 1 7
   Process  Arrival time   Burst time
P3 2 8
P4 3 9
If using the preemptive-SJF CPU scheduling algorithm, the
average waiting time of the processes is:
Select one:

8.23

5.82

7.75

6.75

23.
Consider a system with 3 processes with the following
parameters:
  Process  Arrival Time   Burst time
P1 0 10
P2 2 20
P3 6 30
Assuming there is no context switch at time 0, if using SRT
cpu scheduling algorithm, how many times context switch.
Select one:

24.
Consider a system with 4 processes with the following
parameters:
   Process  Arrival Time   Burst time
P1 0 8
P2 1 4
P3 2 9
P4 3 5
If using the SRT scheduling algorithm, the turnaround time of
P3 is
Select one:

25

26

24

23

25.
Consider a system with 4 processes with the following
parameters:
  Process  Arrival time   Burst time
P1 0 6
P2 0 8
P3 0 7
P4 0 3
If using the SJF process scheduling algorithm, the average
waiting time of the processes is:
Select one:

6
 26.
Consider a system with 5 processes with the following
parameters:
  Process  Arrival time   Burst time
P1 0 140
P2 40 75
P3 50 320
P4 300 280
P5 315 125
If using SJF CPU scheduling algorithm, the waiting time of P4
is:
Select one:

380

365

370

360

27.
Consider a system with 3 processes with the following
parameters:
  Process  Arrival Time   Burst time
P1 0 24
P2 0 3
P3 0 3
If using RR (q = 4) cpu scheduling algorithm, what is the
average waiting time of the processes? 
Select one:

7.25

6.5

5.8
 5.66

29.
Consider a system with 4 processes with the following
parameters:
  Process  Arrival time   Burst time
P1 0 6
P2 0 8
P3 0 7
P4 0 3
If using the SJF process scheduling algorithm, the average
waiting time of the processes is:
Select one:

30.
Consider a system with 3 processes with the following
parameters:
  Process  Arrival Time   Burst time
P1 0 5
P2 1 7
P3 3 4
The order of completion of the 3 processes under the RR(q = 2)
algorithm is
Select one:

P1, P2, P3
P3, P1, P2

P2, P3, P1

P1, P3, P2

31.
Considering 4 processes arrive at the system at the same time 0,
the burst time is as follows:
  Process   Burst time
P1 53
P2 8
P3 68
P4 24
If using the RR(q = 20) scheduling algorithm, the average
waiting time is 
Select one:

70.75

66.25

67.5

66.75

32.
Consider a system with 4 processes with the following
parameters:
  Process  Arrival Time   Burst time
P1 0 12
P2 2 4
P3 3 6
P4 8 5
If using SRTF scheduling algorithm, the average waiting time is
5.5
33.
Xét hệ thống có 4 process với thông số như sau:
Process    Arrival Time     Burst time  
P3                     2                      8
P1                     0                      5
P4                     3                      9
P2                     1                      7
If using the preemptive-SJF cpu scheduling algorithm, the
average waiting time of the processes is 7.75

28.
Consider a system with 4 processes with the following
parameters:
  Process  Arrival Time   Burst time
      P1       0       9
      P2       1       5
      P3       2       3
      P4       3       4
If using the RR(q = 2) scheduling algorithm, the average waiting
time is 10

New
D

job schedulers

short term
A

PCB

Circular queue

Turnaround time
A

Ready queue

Dispatcher

Fork
Pure overhead

Throughput

FIFO

Dispatch Latency
Turnaround