NPTEL Advanced Computer Architecture Week 5 Assignment Answers 2024

Join Our WhatsApp Group Join Now
Join Us On Telegram Join Now

NPTEL Advanced Computer Architecture Week 5 Assignment Answers 2024

1. Which of the following is true regarding non-selective replay in case of a misspeculation?

  • The entire pipeline is flushed.
  • All the instructions in the window of vulnerability are squashed.
  • All the instructions in the ROB are flushed.
  • All the instructions in the instruction window are squashed.
Answer :- For Answer Click Here 

2. The ____________ is used to squash the instructions whose timer is not equal to_____________ in non-selective replay.

  • Squash bit, 1
  • Kill wire, 1
  • Squash bit, 0
  • Kill wire, 0
Answer :- For Answer Click Here 

3. When an instruction is squashed, its ready flag is ______________ .

  • Unaffected
  • Set
  • Reset
  • Removed
Answer :- For Answer Click Here 

4. In the delayed selective replay scheme, when is the poison bit set?

  • At the time of speculation.
  • At the time the instruction is issued.
  • At the time of asserting the kill wire.
  • None of these
Answer :- 

5. Which among the following can help to save orphan instructions? (Select the most appropriate option).

  • Poison bit
  • Kill wire
  • Early broadcast
  • A second broadcast at an appropriate time
Answer :- 

6. In token based selective replay, if the maximum number of tokens is N, then the size of the token vector is __ bits.

  • N
  • N-1
  • 2*N
  • N/2
Answer :- For Answer Click Here 

7. In the ARF (Architectural Register File) based design, the temporary state (uncommitted results) of the system is available in the _____________

  • Architectural register file
  • Physical register file
  • Reorder buffer
  • None of these
Answer :- 

8. Which of the following structures doesn’t store the values of operands in the ARF (Architectural Register File) based design?

  • ARF (Architectural Register File)
  • Free list
  • ROB (Reorder Buffer)
  • IW (Instruction Window)
Answer :- 

9. Which of the following is not a type of compiler-based optimization?

  • Strength reduction
  • Constant folding
  • Common subexpression evaluation
  • Dead code elimination
Answer :- 

10. Which of the following statements is true?

  • Induction variable based optimization is not a loop-based optimization.
  • Loop invariant based code motion is not a compiler-based optimization.
  • Loop fusion increases the instruction count and the number of branches.
  • Software pipelining can accommodate multi-cycle loads without stalls.
Answer :- For Answer Click Here