CPU Scheduling

Question 1

A process under execution in the CPU that can be interrupted by other process.

Answer 1

Preemptive Scheduling

Question 2

A process with CPU allocated to it can keep the CPU until it releases it by terminating or switching to waiting state.

Answer 2

Nonpreemptive Scheduling

Question 3

The percentage of time the CPU is busy.

Answer 3

CPU Utilization

Question 4

The number of process that complete their excution per time unit.

Answer 4

Throughput

Question 5

The amount of time it takes a process to excute.

Answer 5

Turnaround Time

Question 6

The amount of time the process spends in the ready queue.

Answer 6

Waiting Time

Question 7

The amount of time it takes a process to produce its first response since it submitted a request.

Answer 7

Response Time

Question 8

The processes are based on their arrival times FIFO.

Answer 8

First Come First Serve - FCFS

Question 9

The process cannot be preempted until it completes its CPU Brust Time.

Answer 9

Nonpreemptive Shortest Job First - Nonpreemptive SFJ

Question 10

A process is put on pause if another one with a Brust Time less than the Remaining Time of the currently executing process is requesting execution.

Answer 10

Preemptive Shortest Job First - SFJ OR Shortest Remaining Time First - SRTF

Question 11

Each process gets a Quantum Time, after that time elapses (ends), the process is preempted and added to the end of the Ready Queue.

Answer 11

Round Robin - RR

Question 12

Based on the Priority Number the process was assigned, it executes and cannot be preempted until it completes its CPU Brust Time.

Answer 12

Nonpreemptive Priority

Question 13

Based on the Priority Number the process was assigned, it executes and can be preempted if a new process with a higher priority arrives.

Answer 13

Preemptive Prority

Question 14

It is the most optimal amoung all the nonpreemptive algorithms.

Answer 14

Nonpreemptive SJF

Question 15

It is the most optimal amoung all the preemtive algorithms.

Answer 15

Preemptive SJF (SRTF)

Question 16

Both algorthims cannot be accuratly implemented due the fact that how long a job will run cannot be ever known for certain.

Answer 16

Nonpreemptive SFJ and Preemptive SFJ (SRTF)

Question 17

Both algorthims become the same as the FIFO algorthim when the Brust Time of the jobs (processes) is almost equal.

Answer 17

Nonpreemptive SFJ and Preemptive SFJ (SRTF)

Question 18

This algorthim could lead to starvation if many short jobs are requesting execution, large ones will almost never get the chance to excute.

Answer 18

Preemptive SFJ (SRTF)

Question 19

The algorthim behaves similarly to FIFO algorthim when the Quantum Time is very long compared to their Brust Time.

Answer 19

RR

Question 20

This algorthim has less average Response Time than FIFO algorthim when the jobs have Brust Times that are not very similar to one another.

Answer 20

RR

Question 21

This algorthim could lead to starvation if many high priority jobs are requesting execution, low priority jobs will almost never get the chance to excute.

Answer 21

Priority

Question 22

Has deparate queues, foreground and background, and each have their scheduling algorthim.

Answer 22

Ready Queue

Question 23

Priority ranges from 1 to 99.

Answer 23

Real Time Proccess in Linux

Question 24

Priority is always 0.

Answer 24

Normal Processes in Linux.

Question 25

A value used to modify the Process Priority.

Answer 25

Nice Value

Question 26

Root user can modify the process to have nice values that range from __ to __.

Answer 26

-20, 19

Question 27

Other users can modify the process to have nice values that range from __ to __.

Answer 27

0, 19