πŸ“Š Computer Architecture
Q. An effective to introduce parallelism in memory access is by
  • (A) memory interleaving
  • (B) tlb
  • (C) pages
  • (D) frames
πŸ’¬ Discuss
βœ… Correct Answer: (A) memory interleaving

Explanation: interleaving divides the memory into modules.

πŸ“Š Computer Architecture
Q. The memory transfers between two variable speed devices are always done at the speed of the faster device.
  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
πŸ’¬ Discuss
βœ… Correct Answer: (A) true
πŸ“Š Computer Architecture
Q. The main purpose of having memory hierarchy is to
  • (A) reduce access time
  • (B) provide large capacity
  • (C) reduce propagation time
  • (D) reduce access time & provide large capacity
πŸ’¬ Discuss
βœ… Correct Answer: (D) reduce access time & provide large capacity

Explanation: by using the memory hierarchy, we can increase the performance of the system.

πŸ“Š 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.

πŸ“Š 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 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. 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
πŸ“Š 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 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.