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 21 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 2009
MCQ (Single Correct Answer)
+1
-0.3
A $$CPU$$ generally handles an interrupt by executing an interrupt service routine
A
as soon as an interrupt is raised
B
by checking the interrupt register at the end of fetch cycle
C
by checking the interrupt register after finishing the execution of the current instruction
D
by checking the interrupt register at fixed time intervals.
3
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0.
A
2
B
3
C
4
D
5
4
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using open addressing with hash function h(k) = k mod 10 and linear probing. What is the resultant hash table?
A
GATE CSE 2009 Data Structures - Hashing Question 11 English Option 1
B
GATE CSE 2009 Data Structures - Hashing Question 11 English Option 2
C
GATE CSE 2009 Data Structures - Hashing Question 11 English Option 3
D
GATE CSE 2009 Data Structures - Hashing Question 11 English Option 4
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12