Register
Dark Mode

Made Easy test series

in CO and Architecture edited by
387 views
1 vote
1 vote

in CO and Architecture edited by
by
387 views

4 Comments

by
Please Write the Instruction Clearly :(
0
0
by
pls check again.
0
0
by
Every instruction takes only one clock cycle.

So the answer should be $9$ right?

 $(k+n-1)\times T_p=(5+5-1)\times 1=9\:clock\: cycles.$
0
0
by
I made a similar mistake, but I've identified the error. The correct answer is 10.
0
0

1 Answer

1 vote
1 vote
Best answer
(K + n - 1) = 5 + 5 - 1 = 9.
1 extra cycle due to data dependency between I2 and I3.
Operand forwarding can only solve data dependancy between ALU to ALU  

Hence, 9 + 1 = 10.

Answer : 10
selected by
by

2 Comments

by
How is it possible? Can you share the resource from where you read about this condition on operand forwarding?
0
0
by
1
1
← PreviousNext →
← Previous in categoryNext in category →

Related questions

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!