CPU Scheduling Questions

MCQ bookmark_border

41.

The real difficulty with SJF in short term scheduling is ____________

A

it is too good an algorithm

B

knowing the length of the next CPU request

C

it is too complex to understand

D

none of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

42.

The FCFS algorithm is particularly troublesome for ____________

A

time sharing systems

B

multiprogramming systems

C

multiprocessor systems

D

operating systems

Correct Answer: B

In a time sharing system, each user needs to get a share of the CPU at regular intervals.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

43.

Consider the following set of processes, the length of the CPU burst time given in milliseconds.

ProcessBurst Time                       
   P1    6
   P2    8
   P3    7
   P4    3

Assuming the above process being scheduled with the SJF scheduling algorithm.

A

The waiting time for process P1 is 3ms

B

The waiting time for process P1 is 0ms

C

The waiting time for process P1 is 16ms

D

The waiting time for process P1 is 9ms

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

44.

Preemptive Shortest Job First scheduling is sometimes called ____________

A

Fast SJF scheduling

B

EDF scheduling

C

HRRN scheduling

D

SRTN scheduling

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

45.

An SJF algorithm is simply a priority algorithm where the priority is ____________

A

the predicted next CPU burst

B

the inverse of the predicted next CPU burst

C

the current CPU burst

D

anything the user wants

Correct Answer: A

The larger the CPU burst, the lower the priority.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

46.

Choose one of the disadvantages of the priority scheduling algorithm?

A

it schedules in a very complex manner

B

its scheduling takes up a lot of time

C

it can lead to some low priority process waiting indefinitely for the CPU

D

none of the mentioned

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

47.

What is Aging?

A

keeping track of cache contents

B

keeping track of what pages are currently residing in memory

C

keeping track of how many times a given page is referenced

D

increasing the priority of jobs to ensure termination in a finite time

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

48.

Which of the following scheduling algorithms gives minimum average waiting time?

A

FCFS

B

SJF

C

Round

D

Priority

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

49.

In rate monotonic scheduling ____________

A

shorter duration job has higher priority

B

longer duration job has higher priority

C

priority does not depend on the duration of the job

D

none of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

50.

In which scheduling certain amount of CPU time is allocated to each process?

A

earliest deadline first scheduling

B

proportional share scheduling

C

equal share scheduling

D

none of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion