Menu

Question Discussion & Solution

MCQ

Q.

In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________

A

all process

B

currently running process

C

parent process

D

init process

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

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

Discussion

MCQ

2.

The interval from the time of submission of a process to the time of completion is termed as ____________

A

waiting time

B

turnaround time

C

response time

D

throughput

Discussion

MCQ

3.

Earliest deadline first algorithm assigns priorities according to ____________

A

periods

B

deadlines

C

burst times

D

none of the mentioned

Discussion

MCQ

4.

Which algorithm is defined in Time quantum?

A

shortest job scheduling algorithm

B

round robin scheduling algorithm

C

priority scheduling algorithm

D

multilevel queue scheduling algorithm

Discussion

MCQ

5.

Time duration required for scheduling dispatcher to stop one process and start another is known as ____________

A

process latency

B

dispatch latency

C

execution latency

D

interrupt latency

Discussion

More Operating System Topics

Introduction to Operating System

5 MCQs

Types

16 MCQs

Services

2 MCQs

Structures

3 MCQs

Processes

58 MCQs

Threads

47 MCQs

CPU Scheduling

79 MCQs

Process Synchronization

117 MCQs

Memory Management

179 MCQs

Storage Management

283 MCQs

Input Output Systems

55 MCQs

Networking

36 MCQs

Distributed Operating System

73 MCQs

Protection and Security

123 MCQs

Unix

145 MCQs

Linux

160 MCQs

MS Windows

1 MCQs

Mixed

10 MCQs