Courses

# Test: Replacement Algorithms

## 10 Questions MCQ Test Computer Architecture & Organisation (CAO) | Test: Replacement Algorithms

Description
This mock test of Test: Replacement Algorithms for Computer Science Engineering (CSE) helps you for every Computer Science Engineering (CSE) entrance exam. This contains 10 Multiple Choice Questions for Computer Science Engineering (CSE) Test: Replacement Algorithms (mcq) to study with solutions a complete question bank. The solved questions answers in this Test: Replacement Algorithms quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE) students definitely take this Test: Replacement Algorithms exercise for a better result in the exam. You can find other Test: Replacement Algorithms extra questions, long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.
QUESTION: 1

### The directly mapped cache no replacement algorithm is required.

Solution:

Explanation: The position of each block is pre-determined in the direct mapped cache, hence not need for replacement.

QUESTION: 2

### The surroundings of the recently accessed block is called as ______

Solution:

Explanation: The locality of reference is a key factor in many of the replacement algorithms.

QUESTION: 3

### In set associative and associative mapping there exists less flexibility.

Solution:

Explanation: The above two methods of mapping the descision of which block to be removed rests with the cache controller.

QUESTION: 4

THe algorithm which replaces the block which has not been referenced for awhile is called _____

Solution:

Explanation: LRU stands for Least Recently Used first.

QUESTION: 5

In associative mapping during LRU, the counter of the new block is set to ‘0’ and all the others are incremented by one, when _____ occurs.

Solution:

Explanation: Miss usually occurs when the memory block requiered is not present in the cache.

QUESTION: 6

The LRU provides very bad performance when it comes to _________

Solution:

Explanation: The LRU in case of the sequential blocks as to waste its one cycle just incrementing the counters.

QUESTION: 7

The algorithm which removes the recently used page first is ________

Solution:

Explanation: In MRU it is assumed that the page accessed now is less likely to be accessed again.

QUESTION: 8

The LRU can be improved by providing a little randomness in the access.

Solution:
QUESTION: 9

In LRU, the referenced blocks counter is set to’0′ and that of the previous blocks are incremented by one and others remain same, in case of ______

Solution: