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 15 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

Q141.

An example of a non-preemptive CPU scheduling algorithm is:

Shortest job first scheduling

Round robin scheduling

Priority scheduling

Fair share scheduling

Discuss

Answer: (a).Shortest job first scheduling

Q142.

There are ‘n’ processes in memory. A process spends a fraction ‘p’ of its time waiting for I/O to complete. The CPU utilization is given by:

p^n

1 - p^n

(1-p)^n

1-np

Discuss

Answer: (b).1 - p^n

Q143.

With 64 bit virtual addresses, a 4KB page and 256 MB of RAM, an inverted page table requires:

8192 entries

16384 entries

32768 entries

65536 entries

Discuss

Answer: (d).65536 entries

Q144.

A computer has 6 tape drives with ‘n’ processes competing for them. Each process may need two drives. For which values of ‘n’ is the system deadlock free ?

Discuss

Answer: (c).3

Q145.

A program has five virtual pages, numbered from 0 to 4. If the pages are referenced in the order 012301401234, with three page frames, the total number of page faults with FIFO will be equal to:

Discuss

Answer: (d).9

Q146.

Average process size=s bytes. Each page entry requires e bytes. The optimum page size is given by:

√(se)

√(2se)

Discuss

Answer: (b).√(2se)

Q147.

The aging algorithm with a=0.5 is used to predict run times. The previous four runs from oldest to most recent are 40, 20, 20 and 15 msec. The prediction for the next time will be:

15 msec

25 msec

39 msec

40 msec

Discuss

Answer: (b).25 msec

Q148.

Moving process from main memory to disk is called:

Caching

Termination

Swapping

Interruption

Discuss

Answer: (c).Swapping

Q149.

Part of a program where the shared memory is accessed and which should be executed indivisibly, is called:

Semaphores

Welcome to the Operating System MCQs Page

Operating System MCQs | Page 15 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

Java Spring Framework

R Programming

Neural Networks

Data Structures and Algorithms

Big Data Computing

Object Oriented Programming Using C++

Data Science

Formal Languages and Automata Theory

Microprocessor