Operating System Quiz 2

Operating System Quiz 2

4th Grade

35 Qs

quiz-placeholder

Similar activities

UTS MAPIL

UTS MAPIL

11th Grade

40 Qs

Prakarya kelas 9

Prakarya kelas 9

9th Grade

40 Qs

SP FINALS EXAM

SP FINALS EXAM

4th Grade

40 Qs

Architecture 2024 Final Exam Review

Architecture 2024 Final Exam Review

9th - 12th Grade

40 Qs

tropical mmidterms

tropical mmidterms

University

35 Qs

Makara2425 7 Lat PSAT Part 5

Makara2425 7 Lat PSAT Part 5

4th Grade - University

40 Qs

CMA 490 - Chapter 4 Review

CMA 490 - Chapter 4 Review

University

30 Qs

Revision of MAAR 7453-23-24

Revision of MAAR 7453-23-24

University - Professional Development

38 Qs

Operating System Quiz 2

Operating System Quiz 2

Assessment

Quiz

Architecture

4th Grade

Hard

Created by

Nisha Rose

Used 1+ times

FREE Resource

35 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

Which of the following scheduling algorithms is non-preemptive? (GATE CS 2002) 

Round Robin 

First-In First-Out 

Multilevel Queue Scheduling 

Multilevel Queue Scheduling with Feedback 

2.

MULTIPLE CHOICE QUESTION

2 mins • 2 pts

Media Image

consider the 3 processes, P1, P2 and P3 shown in the table

The completion order of the 3 processes under the policies FCFS and RRS (round robin scheduling with CPU quantum of 2 time units) are

FCFS: P1, P2, P3 RR2: P1, P2, P3

FCFS: P1, P3, P2 RR2: P1, P3, P2

FCFS: P1, P2, P3 RR2: P1, P3, P2

FCFS: P1, P3, P2 RR2: P1, P2, P3

3.

MULTIPLE CHOICE QUESTION

1 min • 2 pts

Media Image

Consider the following table of arrival time and burst time for three processes P0, P1 and P2.

The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes?

5.0 ms

4.33 ms

6.33 ms

7.33 ms

4.

MULTIPLE CHOICE QUESTION

1 min • 2 pts

Which of the following statements are true? (GATE CS 2010)
I. Shortest remaining time first scheduling may cause starvation
II. Preemptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response time

I only

I and III only

II and III only

I, II and III

5.

MULTIPLE CHOICE QUESTION

1 min • 2 pts

Media Image

An operating system uses Shortest Remaining Time first (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following processes

What is the total waiting time for process P2?

5

15

40

55

6.

MULTIPLE CHOICE QUESTION

1 min • 2 pts

Consider a set of n tasks with known runtimes r1,r2,.....rn to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?.

Round Robin

Shortest-Job First

Highest-Response-Ratio-Next

First-Come-First-Served

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Allocating time on the processor to individual processes is known as...
CPU Scheduling
CPU Timing
CPU Clocking
CPU Sorting

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?