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 UGC CBSE NET 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 UGC CBSE NET 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 UGC CBSE NET 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 20 of 21

Explore more Topics under UGC CBSE NET Exam

Q191.
In which of the following scheduling criteria, context switching will never take place?

a.

ROUND ROBIN

b.

Preemptive SJF

c.

Non-preemptive SJF

d.

Preemptive priority

Discuss
Answer: (c).Non-preemptive SJF
Q192.
In Distributed system, the capacity of a system to adapt the increased service load is called .................

a.

Tolerance

b.

Scalability

c.

Capability

d.

Loading

Discuss
Answer: (b).Scalability
Q193.
In .................... disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without serving any requests on the return trip.

a.

LOOK

b.

SCAN

c.

C - LOOK

d.

C - SCAN

Discuss
Answer: (d).C - SCAN
Q194.
Suppose there are six files F1, F2, F3, F4, F5, F6 with corresponding sizes 150 KB, 225KB, 75 KB, 60 KB, 275 KB and 65 KB respectively. The files are to be stored on a sequential device in such a way that optimizes access time. In what order should the files be stored?

a.

F5, F2, F1, F3, F6, F4

b.

F4, F6, F3, F1, F2, F5

c.

F1, F2, F3, F4, F5, F6

d.

F6, F5, F4, F3, F2, F1

Discuss
Answer: (b).F4, F6, F3, F1, F2, F5
Q195.
Which module gives control of the CPU to the process selected by the short - term scheduler?

a.

Dispatcher

b.

Interrupt

c.

Scheduler

d.

Threading

Discuss
Answer: (a).Dispatcher
Q196.
Two atomic operations permissible on Semaphores are .................. and ...............

a.

wait, stop

b.

wait, hold

c.

hold, signal

d.

wait, signal

Discuss
Answer: (d).wait, signal
Q197.
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item X, denoted by r(X) and w(X) respectively. Which one of them is conflict serializable?

S1 : r1(X); r2(X); w1(X); r3(X); w2(X)
S2 : r2(X); r1(X); w2(X); r3(X); w1(X)
S3 : r3(X); r2(X); r1(X); w2(X); w1(X)
S4 : r2(X); w2(X); r3(X); r1(X); w1(X)

a.

S1

b.

S2

c.

S3

d.

S4

Discuss
Answer: (d).S4
Q198.
Suppose a database schedule S involves transactions T1, T2, .............,Tn. Consider the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?

a.

Topological order

b.

Depth - first order

c.

Breadth - first order

d.

Ascending order of transaction indices

Discuss
Answer: (a).Topological order
Q199.
Consider the following four processes with the arrival time and length of CPU burst given in milliseconds :

Process Arrival Time Burst Time
P1 0 8
P2 1 4
P3 2 9
P4 3 5

The average waiting time for preemptive SJF scheduling algorithm is .................

a.

6.5 ms

b.

7.5 ms

c.

6.75 ms

d.

7.75 ms

Discuss
Answer: (a).6.5 ms
Q200.
Consider a virtual page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1. Suppose a demand paged virtual memory system running on a computer system such that the main memory has 3 page frames. Then ................. page replacement algorithm has minimum number of page faults.

a.

FIFO

b.

LIFO

c.

LRU

d.

Optimal

Discuss
Answer: (d).Optimal
Page 20 of 21

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!

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

Data Warehousing and OLAP

Strengthen your knowledge of Data Warehousing and OLAP with our specialized MCQs....

SQL Server

Master Microsoft's database server with our SQL Server MCQs. Topics cover database...

MongoDB

Learn the leading NoSQL database with our MongoDB MCQs. Understand everything from...

MS Office

Master the suite of productivity tools with our MS Office MCQs. From Word and Excel...

Java Spring Framework

Enhance your Java development skills with our Spring Framework MCQs. Learn about...

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

Systems Programming

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