Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Tests  >  Computer Architecture & Organisation (CAO)  >  Test: Replacement Algorithms - Computer Science Engineering (CSE) MCQ

Test: Replacement Algorithms - Computer Science Engineering (CSE) MCQ


Test Description

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

Test: Replacement Algorithms for Computer Science Engineering (CSE) 2024 is part of Computer Architecture & Organisation (CAO) preparation. The Test: Replacement Algorithms questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Replacement Algorithms MCQs are made for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Replacement Algorithms below.
Solutions of Test: Replacement Algorithms questions in English are available as part of our Computer Architecture & Organisation (CAO) for Computer Science Engineering (CSE) & Test: Replacement Algorithms solutions in Hindi for Computer Architecture & Organisation (CAO) course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Replacement Algorithms | 10 questions in 10 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study Computer Architecture & Organisation (CAO) for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
Test: Replacement Algorithms - Question 1

The directly mapped cache no replacement algorithm is required. 

Detailed Solution for Test: Replacement Algorithms - Question 1

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

Test: Replacement Algorithms - Question 2

The surroundings of the recently accessed block is called as ______

Detailed Solution for Test: Replacement Algorithms - Question 2

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

1 Crore+ students have signed up on EduRev. Have you? Download the App
Test: Replacement Algorithms - Question 3

In set associative and associative mapping there exists less flexibility. 

Detailed Solution for Test: Replacement Algorithms - Question 3

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

Test: Replacement Algorithms - Question 4

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

Detailed Solution for Test: Replacement Algorithms - Question 4

Answer: a
Explanation: LRU stands for Least Recently Used first.

Test: Replacement Algorithms - 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.

Detailed Solution for Test: Replacement Algorithms - Question 5

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

Test: Replacement Algorithms - Question 6

 The LRU provides very bad performance when it comes to _________

Detailed Solution for Test: Replacement Algorithms - Question 6

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

Test: Replacement Algorithms - Question 7

The algorithm which removes the recently used page first is ________

Detailed Solution for Test: Replacement Algorithms - Question 7

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

Test: Replacement Algorithms - Question 8

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

Test: Replacement Algorithms - 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 ______

Detailed Solution for Test: Replacement Algorithms - Question 9

Answer: a
Explanation: If the referenced block is present in the memory it is called as hit.

Test: Replacement Algorithms - Question 10

The counter that keeps track of how many times a block is most likely used is _______

20 videos|86 docs|48 tests
Information about Test: Replacement Algorithms Page
In this test you can find the Exam questions for Test: Replacement Algorithms solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Replacement Algorithms, EduRev gives you an ample number of Online tests for practice

Top Courses for Computer Science Engineering (CSE)

Download as PDF

Top Courses for Computer Science Engineering (CSE)