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.

For every process there is a __________

A

page table

B

copy of page table

C

pointer to page table

D

all of the mentioned

Discussion

MCQ

2.

The segment limit contains the ____________

A

starting logical address of the process

B

starting physical address of the segment in memory

C

segment length

D

none of the mentioned

Discussion

MCQ

3.

________ replacement generally results in greater system throughput.

A

Local

B

Global

C

Universal

D

Public

Discussion

MCQ

4.

There is a set of page replacement algorithms that can never exhibit Belady

A

queue algorithms

B

stack algorithms

C

string algorithms

D

none of the mentioned

Discussion

MCQ

5.

If working set window is too large ____________

A

it will not encompass entire locality

B

it may overlap several localities

C

it will cause memory problems

D

none of the mentioned

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