1
GATE CSE 2025 Set 1
Numerical
+1
-0

The height of any rooted tree is defined as the maximum number of edges in the path from the root node to any leaf node.

Suppose a Min-Heap $T$ stores 32 keys. The height of $T$ is ________ (Answer in integer)

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

Let $G(V, E)$ be an undirected and unweighted graph with 100 vertices. Let $d(u, v)$ denote the number of edges in a shortest path between vertices $u$ and $v$ in $V$. Let the maximum value of $d(u, v), u, v \in V$ such that $u \neq v$, be 30 . Let $T$ be any breadth-first-search tree of $G$. Which ONE of the given options is CORRECT for every such graph $G$ ?

A
The height of $T$ is exactly 15.
B
The height of $T$ is exactly 30.
C
The height of $T$ is at least 15 .
D
The height of $T$ is at least 30 .
3
GATE CSE 2025 Set 1
Numerical
+2
-0

Let LIST be a datatype for an implementation of linked list defined as follows:

typedef struct list {
    int data;
    struct list *next;
} LIST;

Suppose a program has created two linked lists, L1 and L2, whose contents are given in the figure below (code for creating L1 and L2 is not provided here). L1 contains 9 nodes, and L2 contains 7 nodes. Consider the following C program segment that modifies the list L1. The number of nodes that will be there in L1 after the execution of the code segment is _________. (Answer in integer)

GATE CSE 2025 Set 1 Data Structures - Linked List Question 1 English

Your input ____
4
GATE CSE 2025 Set 1
Numerical
+2
-0

In a double hashing scheme, $h_1(k)=k \bmod 11$ and $h_2(k)=1+(k \bmod 7)$ are the auxiliary hash functions. The size $m$ of the hash table is 11 . The hash function for the $i^{\text {th }}$ probe in the open address table is $\left[h_1(k)+i h_2(k)\right]$ mod $m$. The following keys are inserted in the given order: $63,50,25,79,67,24$.

The slot at which key 24 gets stored is _______. (Answer in integer)

Your input ____
EXAM MAP