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 GATE CSE 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 GATE CSE 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 GATE CSE 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 2 of 16

Explore more Topics under GATE CSE Exam

01

Networking

02

Data Structures and Algorithms

03

Computer Architecture

04

DBMS

05

Compiler Design

06

Theory of Computation(TOC)

07

Engineering Mathematics

Q11.

Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 On a demand paged virtual memory system running on a computer system that main memory size of 3 pages frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacements policy. Then

OPTIMAL < LRU < FIFO

OPTIMAL < FIFO < LRU

OPTIMAL = LRU

OPTIMAL = FIFO

Discuss

Answer: (b).OPTIMAL < FIFO < LRU

Q12.

Let the page fault service time be 10ms in a computer with average memory access time being 20ns. If one page fault is generated for every 10^6 memory accesses, what is the effective access time for the memory?

21ns

30ns

23ns

35ns

Discuss

Answer: (b).30ns

Q13.

A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 100 distinct pages in some order and then accesses the same 100 pages but now in the reverse order. How many page faults will occur?

196

192

197

195

Discuss

Answer: (a).196

Q14.

The essential content(s) in each entry of a page table is / are

Virtual page number

Page frame number

Both virtual page number and page frame number

Access right information

Discuss

Answer: (b).Page frame number

Q15.

A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because

It reduces the memory access time to read or write a memory location

It helps to reduce the size of page table needed to implement the virtual address space of a process

It is required by the translation lookaside buffer

It helps to reduce the number of page faults in page replacement algorithms

Discuss

Answer: (b).It helps to reduce the size of page table needed to implement the virtual address space of a process

Q16.

A processor uses 36 bit physical addresses and 32 bit virtual addresses, with a page frame size of 4 Kbytes. Each page table entry is of size 4 bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as follows • Bits 30-31 are used to index into the first level page table • Bits 21-29 are used to index into the second level page table • Bits 12-20 are used to index into the third level page table, and • Bits 0-11 are used as offset within the page The number of bits required for addressing the next level page table (or page frame) in the page table entry of the first, second and third level page tables are respectively.

20, 20 and 20

24, 24 and 24

24, 24 and 20

25, 25 and 24

Discuss

Answer: (b).24, 24 and 24

Q17.

A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements:

P: Increasing the number of page frames allocated to a
process sometimes increases the page fault rate.
Q: Some programs do not exhibit locality of reference.

Which one of the following is TRUE?

Both P and Q are true, and Q is the reason for P

Both P and Q are true, but Q is not the reason for P

P is false, but Q is true

Both P and Q are false

Discuss

Answer: (b).Both P and Q are true, but Q is not the reason for P

Q18.

A process has been allocated 3 page frames. Assume that none of the pages of the process are available in the memory initially. The process makes the following sequence of page references (reference string): 1, 2, 1, 3, 7, 4, 5, 6, 3, 1 If optimal page replacement policy is used, how many page faults occur for the above reference string?

Discuss

Answer: (a).7

Q19.

Consider the data given in above question. Least Recently Used (LRU) page replacement policy is a practical approximation to optimal page replacement. For the above reference string, how many more page faults occur with LRU than with the optimal page replacement policy?

Discuss

Answer: (c).2

Q20.

Assume that there are 3 page frames which are initially empty. If the page reference string is 1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6, the number of page faults using the optimal replacement policy is__________.

Discuss

Answer: (c).7

Page 2 of 16

Welcome to the Operating System MCQs Page

Operating System MCQs | Page 2 of 16

Explore more Topics under GATE CSE Exam

Networking

Data Structures and Algorithms

Computer Architecture

DBMS

Compiler Design

Theory of Computation(TOC)

Engineering Mathematics

Suggested Topics

Human Computer Interaction

Artificial Intelligence

Python

Cloud Computing

Data Structures and Algorithms

Java Spring Framework

Hadoop

Object Oriented Programming

Formal Languages and Automata Theory