CPU Scheduling Questions

MCQ bookmark_border

31.

The portion of the process scheduler in an operating system that dispatches processes is concerned with ____________

A

assigning ready processes to CPU

B

assigning ready processes to waiting queue

C

assigning running processes to blocked queue

D

all of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

32.

Complex scheduling algorithms ____________

A

are very appropriate for very large computers

B

use minimal resources

C

use many resources

D

all of the mentioned

Correct Answer: A

Large computers are overloaded with a greater number of processes.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

33.

What is FIFO algorithm?

A

first executes the job that came in last in the queue

B

first executes the job that came in first in the queue

C

first executes the job that needs minimal processor

D

first executes the job that has maximum processor needs

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

34.

The strategy of making processes that are logically runnable to be temporarily suspended is called ____________

A

Non preemptive scheduling

B

Preemptive scheduling

C

Shortest job first

D

First come First served

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

35.

What is Scheduling?

A

allowing a job to use the processor

B

making proper use of processor

C

all of the mentioned

D

none of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

36.

There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?

A

tQ = 15ms

B

tQ=40ms

C

tQ=45ms

D

tQ=50ms

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

37.

Orders are processed in the sequence they arrive if _______ rule sequences the jobs.

A

earliest due date

B

slack time remaining

C

first come, first served

D

critical ratio

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

38.

Which of the following algorithms tends to minimize the process flow time?

A

First come First served

B

Shortest Job First

C

Earliest Deadline First

D

Longest Job First

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

39.

Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________

A

Lengthened; Shortened

B

Shortened; Lengthened

C

Shortened; Shortened

D

Shortened; Unchanged

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

40.

Which is the most optimal scheduling algorithm?

A

FCFS (First come First served)

B

SJF (Shortest Job First)

C

RR (Round Robin)

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion