Quiz 6

Create an illustration showing an abstract representation of process scheduling, featuring various scheduling algorithms, visualized as interconnected flow charts, gears, and clocks, with a digital and tech aesthetic.

Mastering Process Scheduling

Test your knowledge on process scheduling and interprocess communication with our expert quiz! Designed for students and professionals alike, this quiz covers crucial concepts in operating systems, ensuring you have a solid understanding of essential topics.

Join now and dive into these interesting subjects:

Semaphore processes
Round Robin scheduling
Interprocess communication models
Deadlock and starvation

18 Questions4 MinutesCreated by LearningGuru21

All semaphore processes are atomic.

True

False

What type of scheduler is the most frequently executed one?

Medium Term

Long Term

Short Term

I/O Scheduler

Which processes are called processor-bound processes?

Processes that mainly perform computational tasks

Processes that mainly stay at blocked state

Processes that are recently created

Processes that mainly perform I/O operations

Which of the following options is one of the decisions that the scheduler should make?

Which thread to kill

Which job or jobs to accept and turn into process

Which location in memory to move process

To create an extra thread to support execution

Less time quantum in Round Robin will create more starvation.

True

False

It is impossible to have concurrency without parallelism.

True

False

In Round Robin algorithm time-slice is longer than required time to execute longest process.

Round Robin performs it's best.

There will be interruptions by other processes.

System will crush.

Round Robin will act like FCFS

Which statement is not true about mutex?

It is used to grab and release an resource.

Mutex similar to binary semaphore

Mutex is a programming flag.

Process can be unlocked by another process.

What is the maximum number for normalized turnaround time in FCFS?

Because of the Resource Competition which three control problems may happen?

Mutual exclusion

Deadlock

Starvation

OData Coherence

What kind of addressing can be used between processes?

Direct

Broadcast

Indirect

Loopback

Which type of scheduling is part of moving process temporarily out of the main memory?

Medium-term

Long-term

I/0

Short-term

SPN will provide starvation free environment for longer processes.

True

False

Choose right models for Interprocess communication.

Message passing

Mailbox

Shared memory

Protocol

�. A section of code within a process that requires access to shared resources and that must not be executed while another process is in a corresponding section of code.

Critical section

Mutual exclusion

Race condition

Process interaction

Which policies use preemptive decision mode?

Round Robin

Feedback

FIFO

SPN

Why Long-term scheduler limits new processes?

For better performance of the main memory.

To exploit computer resources.

Better performance of current processes.

Better performance for FCFS

Other process can't interrupt the operation.

Individual

Atomic

Concurrent

Distributed

Quiz 6

Mastering Process Scheduling

More Surveys