1
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
Consider a $$4$$ stage pipeline processor. The number of cycles needed by the four instructions $${\rm I}1,$$ $${\rm I}2,$$ $${\rm I}3,$$ $${\rm I}4,$$ in stages $$S1, S2, S3, S4$$ is shown below. GATE CSE 2009 Computer Organization - Pipelining Question 26 English

What is the number of cycles needed to execute the following loop?
For $$\left( {i = 1} \right.$$ to $$\left. 2 \right)$$ $$\left\{ {{\rm I}1;{\rm I}2;{\rm I}3;{\rm I}4;} \right\}$$

A
$$16$$
B
$$23$$
C
$$28$$
D
$$30$$
2
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
The use of multiple register windows with overlap causes a reduction in the number of memory accesses for
$$1.\,\,\,\,$$ Function locals and parameters
$$2.\,\,\,\,$$ Register saves and restores
$$3.\,\,\,\,$$ Instruction fetches
A
$$1$$ only
B
$$2$$ only
C
$$3$$ only
D
$$1,2$$ and $$3$$
3
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Which of the following are NOT true in a pipelined processor?
$$1.$$ Bypassing can handle all RAW hazards
$$2.$$ Register renaming can eliminate all register carried WAR hazards
$$3.$$ Control hazard penalties can be eliminated by dynamic branch prediction.
A
$$1$$ and $$2$$ only
B
$$1$$ and $$3$$ only
C
$$2$$ and $$3$$ only
D
$$1,2$$ and $$3$$
4
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
In an instruction execution pipeline, the earliest that the data $$TLB$$ (Translation Look aside Buffer) can be accessed is
A
Before effective address calculation has started
B
During effective address calculation
C
After effective address calculation has completed
D
After data cache lookup has completed
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12