1
GATE CSE 2025 Set 2
Numerical
+2
-0

An application executes $6.4 \times 10^8$ number of instructions in 6.3 seconds. There are four types of instructions, the details of which are given in the table. The duration of a clock cycle in nanoseconds is _________. (rounded off to one decimal place)

Instruction
type
Clock cycles
required per
instruction (CPI)
Number of
Instructions
executed
Branch 2 $2.25\times10^8$
Load 5 $1.20\times10^8$
Store 4 $1.65\times10^8$
Arithmetic 3 $1.30\times10^8$

Your input ____
2
GATE CSE 2025 Set 2
MCQ (Single Correct Answer)
+1
-0.67

Consider a binary tree $T$ in which every node has either zero or two children. Let $n>0$ be the number of nodes in $T$. Which ONE of the following is the number of nodes in $T$ that have exactly two children?

A
$\frac{n-2}{2}$
B
$\frac{n-1}{2}$
C
$\frac{n}{2}$
D
$\frac{n+1}{2}$
3
GATE CSE 2025 Set 2
MCQ (More than One Correct Answer)
+1
-0

Which of the following statements regarding Breadth First Search (BFS) and Depth First Search (DFS) on an undirected simple graph G is/are TRUE?

A
A DFS tree of $G$ is a Shortest Path tree of $G$.
B
Every non-tree edge of $G$ with respect to a DFS tree is a forward/back edge.
C
If $(u, v)$ is a non-tree edge of $G$ with respect to a BFS tree, then the distances from the source vertex $s$ to $u$ and $v$ in the BFS tree are within $\pm 1$ of each other.
D
Both BFS and DFS can be used to find the connected components of $G$.
4
GATE CSE 2025 Set 2
Numerical
+1
-0

Suppose the values $10,-4,15,30,20,5,60,19$ are inserted in that order into an initially empty binary search tree. Let $T$ be the resulting binary search tree. The number of edges in the path from the node containing 19 to the root node of $T$ is ________ (Answer in integer)

Your input ____
EXAM MAP