Process - Part-II Quiz

Process - Part-II Quiz

University

16 Qs

quiz-placeholder

Similar activities

Forum Activity Tech quiz

Forum Activity Tech quiz

University

15 Qs

Electronic Diary Systems Assessment

Electronic Diary Systems Assessment

10th Grade - University

15 Qs

Operating System Unit 2

Operating System Unit 2

University

20 Qs

DSA (QUIZ 2) Stacks and Queues Quiz

DSA (QUIZ 2) Stacks and Queues Quiz

University

15 Qs

LONG QUIZ MIS

LONG QUIZ MIS

University

20 Qs

Smart Home Devices Quiz

Smart Home Devices Quiz

8th Grade - University

20 Qs

OSS (QUIZ 7) Input/Output Systems

OSS (QUIZ 7) Input/Output Systems

University

20 Qs

Domain 4 - Network Security

Domain 4 - Network Security

10th Grade - University

16 Qs

Process - Part-II Quiz

Process - Part-II Quiz

Assessment

Quiz

Information Technology (IT)

University

Medium

Created by

Sandip Sadhukhan

Used 8+ times

FREE Resource

16 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Which of the following scheduling criteria should be minimized?

CPU utilization

Throughput

Turnaround time

Both a and b

2.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

What is a major disadvantage of FCFS scheduling?

It is complex to understand.

It can lead to starvation.

It suffers from the convoy effect.

It is not easy to implement.

3.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

What is the preemptive version of the Shortest-Job-First (SJF) scheduling algorithm called?

First-Come, First-Served (FCFS)

Round Robin (RR)

Shortest Remaining Time First (SRTF)

Priority Scheduling

4.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

What is a key advantage of the Shortest Remaining Time First (SRTF) algorithm?

It prevents starvation.

It is simple and easy to understand.

It guarantees the minimum average waiting time.

It is easy to implement practically.

5.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

A disadvantage of Shortest-Job-First (SJF) scheduling is that it can't be implemented practically because:

It is a preemptive algorithm.

The burst time of processes cannot be known in advance.

It is a non-preemptive algorithm.

It leads to starvation for processes with smaller burst times.

6.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

In priority scheduling, what is the solution to the problem of indefinite blocking or starvation for low-priority processes?

Convoy effect

Aging

Time quantum

Context switching

7.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

What happens to Round Robin (RR) scheduling as the time quantum increases?

It tends to become FCFS scheduling.

The number of context switches increases.

The response time decreases.

The chances of starvation decrease.

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?