Welcome to the Operating System MCQs Page
Dive deep into the fascinating world of Operating System with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Operating System, a crucial aspect of GATE CSE Exam. In this section, you will encounter a diverse range of MCQs that cover various aspects of Operating System, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within GATE CSE Exam.
Check out the MCQs below to embark on an enriching journey through Operating System. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of GATE CSE Exam.
Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Operating System. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!
Operating System MCQs | Page 10 of 16
Explore more Topics under GATE CSE Exam
Process Arrival time Time Units Required
P1 0 5
P2 1 7
P3 3 4
The completion order of the 3 processes under the policies FCFS and RR2 (round robin scheduling with CPU quantum of 2 time units) are
Process Arrival time Burst Time
P0 : 0 ms 9 ms
P1 : 1 ms 4 ms
P2 : 2 ms 9 ms
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?
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
Group I Group II
(P) Gang Scheduling (1) Guaranteed Scheduling
(Q) Rate Monotonic Scheduling (2) Real-time Scheduling
(R) Fair Share Scheduling (3) Thread Scheduling
Process Execution time Arrival time
P1 : 20 0
P2 : 25 15
P3 : 10 30
P4 : 15 45
What is the total waiting time for process P2?
Process id tc tio
A : 100 ms 500 ms
B : 350 ms 500 ms
C : 200 ms 500 ms
The processes A, B, and C are started at times 0, 5 and 10 milliseconds respectively, in a pure time sharing system (round robin scheduling) that uses a time slice of 50 milliseconds. The time in milliseconds at which process C would complete its first I/O operation is ___________.
Process : Arrival Time Burst Time
P1 : 0 12
P2 : 2 4
P3 : 3 6
P4 : 8 5
The average waiting time (in milliseconds) of the processes is _________.
Process: Arrival Time Burst Time
P1 : 0 5
P2 : 1 3
P3 : 2 3
P4 : 4 1
What is the average turnaround time for these processes with the preemptive shortest remaining processing time first (SRPT) algorithm ?
Suggested Topics
Are you eager to expand your knowledge beyond Operating System? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
.png)
.png)
