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

Explore more Topics under UGC CBSE NET Exam

Q91.
Suppose S and Q are two semaphores initialized to 1. P1 and P2 are two processes which are sharing resources.

P1 has statements                 P2 has statements
wait(S) ;                                     wait(Q) ;
wait(Q) ;                                     wait(S) ;
critical section1;                       critical section 2;
signal(S) ;                                 signal(Q) ;
signal(Q) ;                                 signal(S) ;

Their execution may sometimes lead to an undesirable situation called

a.

Starvation

b.

Race condition

c.

Multithreading

d.

Deadlock

Discuss
Answer: (d).Deadlock
Q92.
An operating system using banker’s algorithm for deadlock avoidance has ten dedicated devices (of same type) and has three processes P1, P2 and P3 with maximum resource requirements of 4, 5 and 8 respectively. There are two states of allocation of devices as follows:

State 1   Processes                 P1       P2       P3
Devices allocated    2          3          4

State 2   Processes                 P1       P2       P3
Devices allocated    0          2          4

Which of the following is correct?

a.

State 1 is unsafe and state 2 is safe.

b.

State 1 is safe and state 2 is unsafe.

c.

Both, state 1 and state 2 are safe.

d.

Both, state 1 and state 2 are unsafe.

Discuss
Answer: (a).State 1 is unsafe and state 2 is safe.
Q93.
Let the time taken to switch between user mode and kernel mode of execution be T1 while time taken to switch between two user processes be T2. Which of the following is correct?

a.

T1 < T2

b.

T1 > T2

c.

T1 = T2

d.

Nothing can be said about the relation between T1 and T2.

Discuss
Answer: (a).T1 < T2
Q94.
Working set model is used in memory management to implement the concept of

a.

Swapping

b.

Principal of Locality

c.

Segmentation

d.

Thrashing

Discuss
Answer: (b).Principal of Locality
Q95.
A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct?

a.

OS maintains only scheduling and accounting information for each thread.

b.

OS maintains only CPU registers for each thread.

c.

OS does not maintain a separate stack for each thread.

d.

OS does not maintain virtual memory state for each thread.

Discuss
Answer: (b).OS maintains only CPU registers for each thread.
Q96.
The versions of windows operating system like windows XP and window Vista uses following file system:

a.

FAT-16

b.

FAT-32

c.

NTFS (NT File System)

d.

All of the above

Discuss
Answer: (d).All of the above
Q97.
Pre-emptive scheduling is the strategy of temporarily suspending a gunning process

a.

before the CPU time slice expires

b.

to allow starving processes to run

c.

when it requests I/O

d.

to avoid collision

Discuss
Answer: (a).before the CPU time slice expires
Q98.
In round robin CPU scheduling as time quantum is increased the average turn around time

a.

increases

b.

decreases

c.

remains constant

d.

varies irregularly

Discuss
Answer: (d).varies irregularly
Q99.
Consider the following page trace : 4,3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5. Percentage of page fault that would occur if FIFO page replacement algorithm is used with number of frames for the JOB m=4 will be

a.

8

b.

9

c.

10

d.

12

Discuss
Answer: (c).10
Q100.
Which of the following is scheme to deal with deadlock ?

a.

Time out

b.

Time in

c.

Both (A) & (B)

d.

None of the above

Discuss
Answer: (a).Time out
Page 10 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 Structures and Algorithms

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

Microprocessor

Understand the heart of your computer with our Microprocessor MCQs. Topics include...

SQL Server

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

Embedded Systems

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

Java Spring Framework

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

HTML

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

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

Systems Programming

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

Python

Dive into one of the most popular languages with our Python MCQs. Understand...