adplus-dvertising

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.

frame-decoration

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 11 of 16

Explore more Topics under GATE CSE Exam

Q101.
A uni-processor computer system only has two processes, both of which alternate 10ms CPU bursts with 90ms I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes can proceed in parallel. Which of the following scheduling strategies will result in the least CPU utilization (over a long period of time) for this system ?

a.

First come first served scheduling

b.

Shortest remaining time first scheduling

c.

Static priority scheduling with different priorities for the two processes

d.

Round robin scheduling with a time quantum of 5 ms

Discuss
Answer: (d).Round robin scheduling with a time quantum of 5 ms
Q102.
Which of the following scheduling algorithms is non-preemptive?

a.

Round Robin

b.

First-In First-Out

c.

Multilevel Queue Scheduling

d.

Multilevel Queue Scheduling with Feedbac

Discuss
Answer: (b).First-In First-Out
Q103.
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?

a.

Round-Robin

b.

Shortest-Job-First

c.

Highest-Response-Ratio-Next

d.

First-Come-First-Served

Discuss
Answer: (b).Shortest-Job-First
Q104.
Consider a uniprocessor system executing three tasks T1, T2 and T3, each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of 3, 7 and 20 milliseconds, respectively. The priority of each task is the inverse of its period and the available tasks are scheduled in order of priority, with the highest priority task scheduled first. Each instance of T1, T2 and T3 requires an execution time of 1, 2 and 4 milliseconds, respectively. Given that all tasks initially arrive at the beginning of the 1st milliseconds and task preemptions are allowed, the first instance of T3 completes its execution at the end of ______________ milliseconds.

a.

5

b.

10

c.

12

d.

15

Discuss
Answer: (c).12
Q105.
The maximum number of processes that can be in Ready state for a computer system with n CPUs is

a.

n

b.

n^2

c.

2n

d.

Independent of n

Discuss
Answer: (d).Independent of n
Q106.
For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?

Process : Arrival Time Processing Time
A : 0 3
B : 1 6
C : 4 4
D : 6 2

a.

First Come First Serve

b.

Non-preemptive Shortest Job First

c.

Shortest Remaining Time

d.

Round Robin with Quantum value two

Discuss
Answer: (c).Shortest Remaining Time
Q107.
Which of the following is FALSE about SJF (Shortest Job First Scheduling)?

S1: It causes minimum average waiting time
S2: It can cause starvation

a.

Only S1

b.

Only S2

c.

Both S1 and S2

d.

Neither S1 nor S2

Discuss
Answer: (d).Neither S1 nor S2
Q108.
Two concurrent processes P1 and P2 use four shared resources R1, R2, R3 and R4, as shown below.

P1 P2
Compute: Use R1; Use R2; Use R3; Use R4; Compute; Use R1; Use R2; Use R3;. Use R4;

Both processes are started at the same time, and each resource can be accessed by only one process at a time The following scheduling constraints exist between the access of resources by the processes:

P2 must complete use of R1 before P1 gets access to R1
P1 must complete use of R2 before P2 gets access to R2.
P2 must complete use of R3 before P1 gets access to R3.
P1 must complete use of R4 before P2 gets access to R4.

There are no other scheduling constraints between the processes. If only binary semaphores are used to enforce the above scheduling constraints, what is the minimum number of binary semaphores needed?  

a.

1

b.

2

c.

3

d.

4

Discuss
Answer: (b).2
Q109.
We wish to schedule three processes P1, P2 and P3 on a uniprocessor system. The priorities, CPU time requirements and arrival times of the processes are as shown below.

 Process  Priority  CPU time required  Arrival time (hh:mm:ss)
 P1 10(highest)  20 sec  00:00:05
 P2  9  10 sec  00:00:03
 P3  8 (lowest)  15 sec  00:00:00

We have a choice of preemptive or non-preemptive scheduling. In preemptive scheduling, a late-arriving higher priority process can preempt a currently running process with lower priority. In non-preemptive scheduling, a late-arriving higher priority process must wait for the currently executing process to complete before it can be scheduled on the processor. What are the turnaround times (time from arrival till completion) of P2 using preemptive and non-preemptive scheduling respectively.

a.

30 sec, 30 sec

b.

30 sec, 10 sec

c.

42 sec, 42 sec

d.

30 sec, 42 sec

Discuss
Answer: (d).30 sec, 42 sec
Q110.
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?

a.

Shortest remaining time first

b.

Round-robin with time quantum less than the shortest CPU burst

c.

Uniform random

d.

Highest priority first with priority proportional to CPU burst length

Discuss
Answer: (a).Shortest remaining time first
Page 11 of 16

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!

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

Digital Image Processing (DIP)

Delve into the techniques of enhancing digital images with our Digital Image...

Data Science

Discover the fascinating world of extracting insights from data with our Data Science...

Software Architecture and Design

Get a strong hold on the blueprint of software systems with our Software Architecture...