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 5 of 21

Explore more Topics under UGC CBSE NET Exam

Q41.
A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements .............. criteria.

a.

Priority scheduling

b.

Round Robin Scheduling

c.

Shortest Job First

d.

FCFS

Discuss
Answer: (b).Round Robin Scheduling
Q42.
There are three processes P1, P2 and P3 sharing a semaphore for synchronising a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access the semaphore in following order:

(a) P2 needs to access
(b) P1 needs to access
(c) P3 needs to access
(d) P2 exits critical section
(e) Pi exits critical section

The final value of semaphore will be:

a.

0

b.

1

c.

-1

d.

-2

Discuss
Answer: (a).0
Q43.
In a paging system, it takes 30 ns to search translation Look-aside Buffer (TLB) and 90 ns to access the main memory. If the TLB hit ratio is 70%, the effective memory access time is:

a.

48 ns

b.

147 ns

c.

120 ns

d.

84 ns

Discuss
Answer: (b).147 ns
Q44.
Match the following w.r.t. Input/Output management:

List-l List-II
a. Device controller i. Extracts information from the controller register and store it in data buffer
b. Device driver ii. I/O scheduling
c. Interrupt handler iii. Performs data transfer
d. Kernel I/O subsystem iv. Processing of I/O request

Codes: a b c d

a.

iii iv i ii

b.

ii i iv iii

c.

iv i ii iii

d.

i iii iv ii

Discuss
Answer: (d).i iii iv ii
Q45.
Which of the following scheduling algorithms may cause starvation?
a. First-come-first-served
b. Round Robin
c. Priority
d. Shortest process next
e. Shortest remaining time first

a.

a, c and e

b.

c, d and e

c.

b, d and e

d.

b, c and d

Discuss
Answer: (b).c, d and e
Q46.
Distributed operating systems consist of:

a.

Loosely coupled O.S. software on a loosely coupled hardware

b.

Loosely coupled O.S. software on a tightly coupled hardware

c.

Tightly coupled O.S. software on a loosely coupled hardware

d.

Tightly coupled O.S. software on a tightly coupled hardware

Discuss
Answer: (a).Loosely coupled O.S. software on a loosely coupled hardware
Q47.
Which of the following is incorrect for virtual memory

a.

Large programs can be written

b.

More I/O is required

c.

More addressable memory available

d.

Faster and easy swapping of process

Discuss
Answer: (b).More I/O is required
Q48.
Consider following schedules involving two transactions:

S1: r1(X); r1(Y); r2(X); r2(Y); w2(Y); w1(X)
S2: r1(X); r2(X); r2(Y); w2(Y); r1(Y); w1(X)

Which of the following statement is true?

a.

Both S1 and S2 are conflict serializable

b.

S1 is conflict serializable and S2 is not conflict serializable

c.

S1 is not conflict serializable and S2 is conflict serializable

d.

Both S1 and S2 are not conflict serializable

Discuss
Answer: (c).S1 is not conflict serializable and S2 is conflict serializable
Q49.
A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively:

a.

14 and 15

b.

14 and 29

c.

15 and 14

d.

16 and 32

Discuss
Answer: (c).15 and 14
Q50.
Consider a disk queue with I/O requests on the following cylinders in their arriving order:

6,10,12,54,97,73,128,15,44,110,34,45

The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number of cylinders. Total number of cylinders in the disk is 150. The disk head movement using SCAN-scheduling algorithm is:

a.

172

b.

173

c.

227

d.

228

Discuss
Answer: (b).173
Page 5 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!

Software Engineering

Learn about the systematic approach to developing software with our Software...

MATLAB

Hone your computational mathematics skills with our MATLAB MCQs. Understand...

Data Science

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

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Systems Analysis and Design Methods

Get familiar with the process of designing and improving business systems with our...

MySQL Database

Enhance your knowledge of relational databases with our MySQL MCQs. Understand...

Neural Networks

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

Digital Communication

Master the basics of electronic communication with our Digital Communication MCQs....

Systems Programming

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