πŸ“Š Computer Architecture
Q. The directly mapped cache no replacement algorithm is required.
  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
πŸ’¬ Discuss
βœ… Correct Answer: (A) true

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

πŸ“Š Computer Architecture
Q. 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.
  • (A) delay
  • (B) miss
  • (C) hit
  • (D) delayed hit
πŸ’¬ Discuss
βœ… Correct Answer: (B) miss

Explanation: miss usually occurs when the memory block required is not present in the cache.

πŸ“Š Computer Architecture
Q. In set associative and associative mapping there exists less flexibility.
  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
πŸ’¬ Discuss
βœ… Correct Answer: (B) false

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

πŸ“Š Computer Architecture
Q. The algorithm which replaces the block which has not been referenced for a while is called
  • (A) lru
  • (B) orf
  • (C) direct
  • (D) both lru and orf
πŸ’¬ Discuss
βœ… Correct Answer: (A) lru

Explanation: lru stands for least recently used first.

πŸ“Š Computer Architecture
Q. The algorithm which removes the recently used page first is
  • (A) lru
  • (B) mru
  • (C) ofm
  • (D) none of the mentioned
πŸ’¬ Discuss
βœ… Correct Answer: (B) mru

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

πŸ“Š Computer Architecture
Q. The LRU can be improved by providing a little randomness in the access.
  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
πŸ’¬ Discuss
βœ… Correct Answer: (A) true

Explanation: none.

πŸ“Š Computer Architecture
Q. The counter that keeps track of how many times a block is most likely used is
  • (A) count
  • (B) reference counter
  • (C) use counter
  • (D) probable counter
πŸ’¬ Discuss
βœ… Correct Answer: (B) reference counter

Explanation: none.

πŸ“Š Computer Architecture
Q. The key factor/s in commercial success of a computer is/are
  • (A) performance
  • (B) cost
  • (C) speed
  • (D) both performance and cost
πŸ’¬ Discuss
βœ… Correct Answer: (D) both performance and cost

Explanation: the performance and cost of the computer system is a key decider in the commercial success of the system.

πŸ“Š Computer Architecture
Q. A common measure of performance is
  • (A) price/performance ratio
  • (B) performance/price ratio
  • (C) operation/price ratio
  • (D) none of the mentioned
πŸ’¬ Discuss
βœ… Correct Answer: (A) price/performance ratio

Explanation: if this measure is less than one then the system is optimal.

πŸ“Š Computer Architecture
Q. The performance depends on
  • (A) the speed of execution only
  • (B) the speed of fetch and execution
  • (C) the speed of fetch only
  • (D) the hardware of the system only
πŸ’¬ Discuss
βœ… Correct Answer: (B) the speed of fetch and execution

Explanation: the performance of a system is decided by how quick an instruction is brought into the system and executed.

Jump to