
Operating System Quiz 2
Quiz
•
Architecture
•
4th Grade
•
Practice Problem
•
Hard
Nisha Rose
Used 1+ times
FREE Resource
Enhance your content in a minute
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
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
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
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...
Create a free account and access millions of resources
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?
Similar Resources on Wayground
34 questions
VDA - History (Part 3)
Quiz
•
University
39 questions
Orthographic/Isometric Matching
Quiz
•
8th Grade
30 questions
Architectural Styles and Terms
Quiz
•
9th - 12th Grade
40 questions
Architectural Drawing
Quiz
•
12th Grade - University
35 questions
KB_1-9Wks_POA_AD1_Review
Quiz
•
9th - 12th Grade
30 questions
Quiz: Introduction to Building Materials (30 Questions)
Quiz
•
University
30 questions
BLDG. TECH 1 FINAL EXAMINATION
Quiz
•
University
31 questions
quiz
Quiz
•
1st - 12th Grade
Popular Resources on Wayground
5 questions
This is not a...winter edition (Drawing game)
Quiz
•
1st - 5th Grade
25 questions
Multiplication Facts
Quiz
•
5th Grade
10 questions
Identify Iconic Christmas Movie Scenes
Interactive video
•
6th - 10th Grade
20 questions
Christmas Trivia
Quiz
•
6th - 8th Grade
18 questions
Kids Christmas Trivia
Quiz
•
KG - 5th Grade
11 questions
How well do you know your Christmas Characters?
Lesson
•
3rd Grade
14 questions
Christmas Trivia
Quiz
•
5th Grade
20 questions
How the Grinch Stole Christmas
Quiz
•
5th Grade
Discover more resources for Architecture
5 questions
This is not a...winter edition (Drawing game)
Quiz
•
1st - 5th Grade
18 questions
Kids Christmas Trivia
Quiz
•
KG - 5th Grade
12 questions
Adding and Subtracting Fractions with Like Denominators
Quiz
•
4th Grade
6 questions
Winter Creative Drawing Activity
Quiz
•
4th Grade
10 questions
Holiday Song Guessing Game!
Quiz
•
3rd - 5th Grade
6 questions
Would You Rather Christmas
Lesson
•
4th Grade
20 questions
Christmas Movies
Quiz
•
1st - 12th Grade
22 questions
Christmas Math Fun--5th grade
Quiz
•
4th - 6th Grade
