1
GATE CSE 2022
Numerical
+1
-0.33

A processor X1 operating at 2 GHz has a standard 5-stage RISC instruction pipeline having a base CPI (cycles per instruction) of one without any pipeline hazards. For a given program P that has 30% branch instructions, control hazards incur 2 cycles stall for every branch. A new version of the processor X2 operating at same clock frequency has an additional branch predictor unit (BPU) that completely eliminates stalls for correctly predicted branches. There is neither any savings nor any additional stalls for wrong predictions. There are no structural hazards and data hazards for X1 and X2. If the BPU has a prediction accuracy of 90%, the speed up (rounded off to two decimal places) obtained by X2 over X1 in executing P is ____________.

Your input ____
2
GATE CSE 2022
MCQ (Single Correct Answer)
+1
-0.33

Consider the problem of reversing a singly linked list. To take an example, given the linked list below:

GATE CSE 2022 Data Structures - Linked List Question 1 English 1

the reversed linked list should look like

GATE CSE 2022 Data Structures - Linked List Question 1 English 2

Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in O(1) space?

A
The best algorithm for the problem takes $$\theta$$(n) time in the worst case.
B
The best algorithm for the problem takes $$\theta$$(n log n) time in the worst case.
C
The best algorithm for the problem takes $$\theta$$(n2) time in the worst case.
D
It is not possible to reverse a singly linked list in O(1) space.
3
GATE CSE 2022
MCQ (Single Correct Answer)
+1
-0.33

Suppose we are given n keys, m has table slots, and two simple uniform hash functions h1 and h2. Further suppose our hashing scheme uses h1 for the odd keys and h2 for the even keys. What is the expected number of keys in a slot?

A
$${m \over n}$$
B
$${n \over m}$$
C
$${2n \over m}$$
D
$${n \over 2m}$$
4
GATE CSE 2022
Numerical
+1
-0.33

Suppose a binary search tree with 1000 distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with 0, the 3rd largest element of the tree is stored at index ___________.

Your input ____
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12