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.

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

Explore more Topics under UGC CBSE NET Exam

01

Networking

02

Software Engineering

03

Systems Programming

04

Data Structures and Algorithms

05

Computer Architecture

06

DBMS

07

Computer Graphics

08

Artificial Intelligence

09

Web Technologies

10

Theory of Computation(TOC)

11

Discrete Structures

12

Computer Arithmetic

13

Programming in C

14

UNIX System

15

Current Trends and Technologies

16

Neural Networks

17

Fuzzy Systems

Q31.

A LRU page replacement is used with four page frames and eight pages. How many page faults will occur with the reference string 0172327103 if the four frames are initially empty?

Discuss

Answer: (b).7

Q32.

Match the following for operating system techniques with the most appropriate advantage :

List – I List – II

(a) Spooling (i) Allows several jobs in memory to improve CPU utilization

(b) Multiprogramming (ii) Access to shared resources among geographically dispersed computers in a transparent way

(c) Time sharing (iii) Overlapping I/O and computations

(d) Distributed computing (iv) Allows many users to share a computer simultaneously by switching processor frequently

Codes:
a b c d

(iii) (i) (ii) (iv)

(iii) (i) (iv) (ii)

(iv) (iii) (ii) (i)

(ii) (iii) (iv) (i)

Discuss

Answer: (b).(iii) (i) (iv) (ii)

Q33.

Which of the following statements is not true for Multi-Level Feedback Queue processor scheduling algorithm?

Queues have different priorities

Each queue may have different scheduling algorithm

Processes are permanently assigned to a queue

This algorithm can be configured to match a specific system under design

Discuss

Answer: (c).Processes are permanently assigned to a queue

Q34.

What is the most appropriate function of Memory Management Unit (MMU)?

It is an associative memory to store TLB

It is a technique of supporting multiprogramming by creating dynamic partitions

It is a chip to map virtual address to physical address

It is an algorithm to allocate and deallocate main memory to a process

Discuss

Answer: (c).It is a chip to map virtual address to physical address

Q35.

In ___________ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy.

Index

Linked

Contiguous

Bit Map

Discuss

Answer: (b).Linked

Q36.

Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory
for the pages. The page reference string is :
1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 1
The number of page faults in LRU and optimal page replacement algorithms are respectively (without including initial page faults to fill available page frames with, pages) :

9 and 6

10 and 7

9 and 7

10 and 6

Discuss

Answer: (b).10 and 7

Q37.

Which of the following statements is not true about disk-arm scheduling algorithms?

SSTF (shortest seek time first) algorithm increases performance of FCFS

The number of requests for disk service are not influenced by file allocation method

Caching the directories and index blocks in main memory can also help in reducing disk arm movements

SCAN and C-SCAN algorithms are less likely to have a starvation problem

Discuss

Answer: (b).The number of requests for disk service are not influenced by file allocation method

Q38.

Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively.

10, 9

9, 9

10, 10

9, 10

Discuss

Answer: (d).9, 10

Q39.

Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below:
Process Max. Need Current Allocation
P1 8 3
P2 9 4
P3 5 2
P4 3 1

With reference to current allocation, is system safe? If so, what is the safe sequence?

Yes, P1 P2 P3 P4

Yes, P4 P3 P1 P2

Yes, P2 P1 P3 P4

Discuss

Answer: (c).Yes, P4 P3 P1 P2

Q40.

If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67

320

322

321

319

Discuss

Answer: (c).321

Page 4 of 21

Welcome to the Operating System MCQs Page

Operating System MCQs | Page 4 of 21

Explore more Topics under UGC CBSE NET Exam

Networking

Software Engineering

Systems Programming

Data Structures and Algorithms

Computer Architecture

DBMS

Computer Graphics

Artificial Intelligence

Web Technologies

Theory of Computation(TOC)

Discrete Structures

Computer Arithmetic

Programming in C

UNIX System

Current Trends and Technologies

Neural Networks

Fuzzy Systems

Suggested Topics

UNIX

C# programming

Systems Analysis and Design Methods

Compiler Design

Java Programming

DBMS

Web Technologies

MongoDB

C Programming