Menu

Question Discussion & Solution

MCQ

Q.

Which of the following page replacement algorithms suffers from Belady

A

Optimal replacement

B

LRU

C

FIFO

D

Both optimal replacement and FIFO

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

What are the two methods of the LRU page replacement policy that can be implemented in hardware?

A

Counters

B

RAM & Registers

C

Stack & Counters

D

Registers

Discussion

MCQ

2.

In virtual memory. the programmer __________ of overlays.

A

has to take care

B

does not have to take care

C

all of the mentioned

D

none of the mentioned

Discussion

MCQ

3.

Because of virtual memory, the memory can be shared among ____________

A

processes

B

threads

C

instructions

D

none of the mentioned

Discussion

MCQ

4.

Virtual memory allows ____________

A

execution of a process that may not be completely in memory

B

a program to be smaller than the physical memory

C

a program to be larger than the secondary storage

D

execution of a process without being in physical memory

Discussion

MCQ

5.

The ________ consists of all processes whose memory images are in the backing store or in memory and are ready to run.

A

wait queue

B

ready queue

C

cpu

D

secondary storage

Discussion

More Operating System Topics

Introduction to Operating System

5 MCQs

Types

16 MCQs

Services

2 MCQs

Structures

3 MCQs

Processes

58 MCQs

Threads

47 MCQs

CPU Scheduling

79 MCQs

Process Synchronization

117 MCQs

Memory Management

179 MCQs

Storage Management

283 MCQs

Input Output Systems

55 MCQs

Networking

36 MCQs

Distributed Operating System

73 MCQs

Protection and Security

123 MCQs

Unix

145 MCQs

Linux

160 MCQs

MS Windows

1 MCQs

Mixed

10 MCQs

Operating Systems Overview

0 MCQs

Process Management

0 MCQs

Finding and Processing Files

0 MCQs

File Management

0 MCQs