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

Explore more Topics under UGC CBSE NET Exam

Q101.
A computer system supports 32 bit virtual address as well as 32 bit physical addresses. Since the virtual address space is of same size as that of physical address space, if we want to get rid of virtual memory, which one of the following is true ?

a.

Efficient implementation of multiuser support is no longer possible.

b.

The processor cache can be made more efficient.

c.

Hardware support for memory management is not needed.

d.

CPU scheduling can be made more efficient.

Discuss
Answer: (c).Hardware support for memory management is not needed.
Q102.
If an instruction takes ‘i’ microseconds and a page fault takes an additional ‘j’ microseconds. The effective instruction time, if on the average a page fault occurs every k instructions, is

a.

i + j/k

b.

i + j * k

c.

(i + j)/k

d.

(i + j) * k

Discuss
Answer: (a).i + j/k
Q103.
Consider the methods used by processes P1 and P2 for accessing their critical sections. The initial values of shared Boolean variables S1 and S2 are randomly assigned,

P1                                         P2
while (S1 = = S2);             while (S1 = = S2);
critical section                  critical section
S1 = S2;                              S1 = S2;

Which one of the following statements describes the properties achieved ?

a.

Mutual exclusion but not progress

b.

Progress but not mutual exclusion

c.

Neither mutual exclusion nor progress

d.

Both mutual exclusion and progress

Discuss
Answer: (c).Neither mutual exclusion nor progress
Q104.
On a disk with 1000 cylinders (0 to 999) find the number of tracks, the disk arm must move to satisfy all the requests in the disk queue. Assume the last request service was at track 345 and the head is moving toward track 0. The queue in FIFO order contains requests for the following tracks :
123, 874, 692, 475, 105, 376
(Assume SCAN algorithm)

a.

2013

b.

1219

c.

1967

d.

1507

Discuss
Answer: (b).1219
Q105.
Dijkestra banking algorithm in an operating system, solves the problem of

a.

deadlock avoidance

b.

deadlock recovery

c.

mutual exclusion

d.

context switching

Discuss
Answer: (a).deadlock avoidance
Q106.
The multiuser operating system, 20 requests are made to use a particular resource per hour, on an average the probability that no request are made in 45 minutes is

a.

e^-15

b.

e^-5

c.

1 – e^-5

d.

1 – e^-10

Discuss
Answer: (a).e^-15
Q107.
The maximum amount of information that is available in one portion of the disk access arm for a removal disk pack (without further movement of the arm with multiple heads)

a.

a plate of data

b.

a cylinder of data

c.

a track of data

d.

a block of data

Discuss
Answer: (b).a cylinder of data
Q108.
A file organization component VSAM file is

a.

Relative records data set

b.

Keyed sequential data set

c.

Entry sequential data set

d.

All of the above

Discuss
Answer: (d).All of the above
Q109.
A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as

a.

Semaphore

b.

Mutual exclusion

c.

Multiprogramming

d.

Message passing

Discuss
Answer: (b).Mutual exclusion
Q110.
How many states can a process be in ?

a.

3

b.

4

c.

2

d.

5

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

Data Science

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

C# programming

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

SQL Server

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

Cloud Computing

Stay on top of the biggest trend in IT with our Cloud Computing MCQs. These questions...

Java Spring Framework

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

Embedded Systems

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

Operating System

Dive deep into the core of computers with our Operating System MCQs. Learn about...

Software Engineering

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

HTML

Start your journey in web development with our HTML MCQs. Learn the building blocks...