CS and IT Gate 2026 Set-1 Questions with Answer

Ques 53 GATE 2026 SET-1

In the 2020 summer Olympics' Javelin throw finals, Neeraj Chopra exhibited a spectacular performance to win the gold medal. The silver medal was won by Jakub Vadlejch and the bronze medal was won by Vitezlav Vesely. There were six rounds of throws with each athlete having one throw per round. The best of all the throws of each athlete is considered for the medal. Following were the observations about the throws:

i. The first and second rounds were dominated by Neeraj Chopra with a gold medal performance in his second throw, while the other two athletes did not have any medal winning throws in these rounds.
ii. The throws in the last round by both Jakub Vadlejch and Vitezlav Vesely were fouls and were not considered for scoring.
iii. After four rounds, Vitezlav Vesely was in the second position and could not improve upon his best throw in the succeeding rounds.
iv. In the fourth round, the throw by Jakub Vadlejch was the best in that round.

In which round did Vitezlav Vesely have his best throw?

Ques 54 GATE 2026 SET-1

Consider the following program snippet. Assume that the program compiles and runs successfully. Further, assume that the fork() system call is always successful in creating a process.

int main () {
  int i;
  for (i = 0; i < 3; i++){
    if (fork() == 0){
      continue;
    }
    break;
  }
  printf("Hello!");
  return 0;
}

Ques 55 GATE 2026 SET-1

Consider a CPU that has to execute two types of processes. The first type, Actuators (A), requires a CPU burst of 6 seconds. The second type, Controllers (C), requires a CPU burst of 8 seconds. A new process of type A arrives at time t = 10, 20, 30, 40, and 50 (in seconds). Similarly, a new process of type C arrives at time t = 11, 22, 33, 44, and 55 (in seconds). The CPU scheduling policy is First Come First Serve (FCFS). The first process of type A starts running at t = 10 seconds.

The average waiting time (in seconds) for the 10 processes is ___________. (rounded off to one decimal place)

Ques 56 GATE 2026 SET-1

Consider a system consisting of 𝑘 instances of a resource 𝑅, being shared by 5 processes. Assume that each process requires a maximum of two instances of resource 𝑅 and a process can request or release only one instance at a time. Further, a process can request the second instance of the resource only after acquiring the first instance.
The minimum value of 𝑘 for the system to be deadlock-free is ________. (answer in integer)

Ques 57 GATE 2026 SET-1

With respect to deadlocks in an operating system, which of the following statements is/are FALSE?

Ques 58 GATE 2026 SET-1

Consider a system that has a cache memory unit and a memory management unit (MMU). The address input to the cache memory is a physical address. The MMU has a translation lookaside buffer (TLB). Assume that when a page is evicted from the main memory, the corresponding blocks in the cache are marked as invalid.

For a given memory reference, which of the following sequences of events can NEVER happen?

Ques 59 GATE 2026 SET-1

Consider the recursive functions represented by the following code segment:

int bar(int n){
  if (n == 1) return 0;
  else return 1 + bar(n/2);
}
int foo(int n){
  if (n == 1) return 1;
  else return 1 + foo(bar(n));
}

Ques 60 GATE 2026 SET-1

Consider the following program in C:

#include <stdio.h>
void func(int i, int j) {
  if(i < j) {
    int i = 0;
    while (i < 10) {
      j += 2;
      i++;
    }
  }
  printf("%d", i);
}
int main() {
  int i = 9, j = 10;
  func(i, j);
  return 0;
}

Ques 61 GATE 2026 SET-1

Consider the following code snippet in C language that computes the number of nodes in a non-empty singly linked list pointed to by the pointer variable head.

struct node{
  int elt;
  struct node *next;
};
int getListSize (struct node *head)
{
  if( E1 ) return 1;
  return E2;
}

Ques 62 GATE 2026 SET-1

Consider the following grammar where 𝑆 is the start symbol, and 𝑎 and 𝑏 are terminal symbols.

S → aSbS | bS | ε

w which of the following statements is/are true?

Ques 63 GATE 2026 SET-1

Consider the following context free grammar:

S → abaABAbba
A → aaBBAb | bBabaa
B → aBb | ab

L(G) is the language generated by the grammar. For a string s ∈ L(G), let n₁(s) be the number of a's in s and n₂(s) be the number of b's in s. Which of the following is/are correct?

Ques 64 GATE 2026 SET-1

Let M be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet.
Which of the following options CANNOT be the number of states in the minimal deterministic finite automaton (DFA) that is equivalent to 𝑀 ?

Ques 65 GATE 2026 SET-1

Let L₁ and L₂ be two languages over a finite alphabet such that L₁ ∩ L₂ and L₂ are Regular. Which of the following is/are correct?