# Introduction to Memory Hierarchy Design MCQs Quiz Online PDF eBook Download

Learn Introduction to Memory Hierarchy Design MCQs, introduction to memory hierarchy design quiz answers pdf to study computer architecture online course. Practice Memory Hierarchy Design Multiple Choice Questions & Answers (MCQs), "Introduction to Memory Hierarchy Design" quiz questions and answers for top online computer science programs. Learn introduction to memory hierarchy design, cache performance optimizations test prep for master's degree in computer science.

Practice introduction to memory hierarchy design MCQ: Scheme having set, in cache as a group of blocks, is known as, with choices set distributive, principle of locality, set associative, and none of above for top online computer science programs. Practice merit scholarships assessment test, online learning Introduction to Memory Hierarchy Design Quiz Questions for competitive exams in computer science major for BSc computer science.

## MCQs on Introduction to Memory Hierarchy Design PDF eBook Download

MCQ: Scheme having set, in the cache as a group of blocks, is known as

1. Set distributive
2. Principle of locality
3. Set associative
4. None of above

C

MCQ: Very owns way for reducing capacity misses, is to increase

1. Hit penalty
2. Cache hit
3. Cache capacity
4. Fully distributive

C

MCQ: Cache not able of containing the entire blocks needed while execution of a program, is known as

1. Cache full
2. Cache hit
3. Hit rate
4. Cache misses

D

MCQ: Average memory access time can be calculated as

1. Average memory access time = Hit time + Miss rate ? Miss penalty
2. Average memory access time = Hit time - Miss rate ? Miss penalty
3. Average memory access time = Hit time + Miss rate _ Miss penalty
4. Average memory access time = Miss rate ? Miss penalty

A

MCQ: A direct-mapped cache has only 1 block/set and a

1. Partially associative
2. Half associative
3. Fully associative
4. Fully distributive

C