Operating System Final Exam (2-BSIT-1)

Quiz by Brianne M. Singson

Feel free to use or edit a copy

includes Teacher and Student dashboards

### Measure skillsfrom any curriculum

Tag the questions with any skills you have. Your dashboard will track each student's mastery of each skill.

• edit the questions
• save a copy for later
• start a class game
• automatically assign follow-up activities based on students’ scores
• assign as homework
• share a link with colleagues
• print as a bubble sheet

### Our brand new solo games combine with your quiz, on the same screen

Correct quiz answers unlock more play!

25 questions
• Q1

In this Scheduling Algorithm, the process that has the smallest next CPU burst will be assigned to the CPU if available.

SJFS

FCFS

Priority Scheduling

Round Robin

60s
• Q2

Using the first come first serve algorithm, assuming that all processes arrive at time 0, calculate the average waiting time of these processes considering the burst time of each process is equal to P1 = 2, P2 = 3, and P3 = 5.

1.66

10

3.33

2.33

300s
• Q3

A major problem in priority scheduling is indefinite blocking, also known as ________________ which can leave some low-priority processes waiting indefinitely.

Users re-arrange answers into correct order
Jumble
60s
• Q4

Connect the following :

120s
• Q5

Arrange the following steps in order to compute the average waiting time in Round Robin Algorithm.

120s
• Q6

In method 2 of the Round Robin Algorithm, we can compute both average waiting time and average turnaround time.

false
true
True or False
60s
• Q7

Shortest-Job-First Scheduling can be either preemptive or nonpreemptive

true
false
True or False
60s
• Q8

Preemptive scheduling in SJFS means that the arrival time is NOT considered and focuses only on the length of the process.

false
true
True or False
60s
• Q9

Considering the process listed, which of the following two processes will be processed first using the SJFS Algorithm in preemptive mode?

P1 followed by P3

P2 followed by P1

P1 followed by P2

P3 followed by P4

120s
• Q10

When using the round-robin scheduling, how many interrupts could the P1 process encounter if the time quantum = 4?

1

2

3

4

300s
• Q11

Considering the round-robin algorithm with a time quantum of 4, at what time will P4 will be finished processing?

8

20

12

18

300s
• Q12

Considering the round-robin algorithm with a time quantum of 4, at what time will P3 start to be processed?

7

10

16

8

300s
• Q13

In the SJFS Algorithm, which of the following process will be processed first?

P3 with a burst time of 2

P1 with a burst time of 3

P2 with a burst time of 4

P4 with a burst time of 2

60s
• Q14

Using the priority scheduling algorithm, which process will be the first to be finished and why?

P5, because it has the highest priority value.

P1, because it is the first to be processed.

P4, because it has the least burst time value.

P3, because it has the first priority value.

120s
• Q15

Using the priority scheduling algorithm, P2 and P5 have the same burst time of 5, which among the two processes will be the first to be processed and why?

P5, because it has the highest process ID.

P2, because it has the highest priority value.

P2, because it has the lowest process ID.

P5, because it has the highest priority value.

120s

Teachers give this quiz to your class