GATE CS 2026 Set 2 — All 65 Questions with Solutions

T                 S
I:   Inorder      L: left subtree, node, right subtree
II:  Preorder     M: node, left subtree, right subtree
III: Postorder    N: left subtree, right subtree, node

T                     S
I:   Logical schema   L: Views
II:  Physical schema  M: File organization and indexes
III: External schema  N: Relations

c
// P1
#include <stdio.h>
int a=5;
int main(){
  int a=7;
  return(0);
}
// P2
#include <stdio.h>
int main(){
  int a=5;
  int a=7;
  return(0);
}
// P3
#include <stdio.h>
int main(){
  int a=5;
  float a=7;
  return(0);
}

letter -> [A-Za-z]
digit  -> [0-9]
id     -> letter (letter | digit)*
number -> digit+
ws     -> (blank | tab | newline)+

x1   23mm  78   y   7z   zz5   14A  8H  AaYcD

Algorithm B1:
  For i = 1,2,...,n
    For j = 1,2,...,n
      T[i][j] = 2*T[i-1][j] + 3*T[i][j-1]

Algorithm B2:
  For s = 2,3,...,2n
    For i = 1,2,...,n
      For j = 1,2,...,n
        If (i+j == s)
          T[i][j] = 2*T[i-1][j] + 3*T[i][j-1]

Wait(A);
Print(*);
X = X+1;
If (X == 2) {
   Print($);
   Signal(B);
}
Signal(A);
Wait(B);
Print(#);
Signal(B);

c
#include <stdio.h>
int main(){
  int *ptr, a, b, c;
  a=5; b=11; c=20;
  ptr=&a; *ptr=c; ptr=&c;
  a=*(&b); c=*ptr-a;
  printf("%d",c);
  return(0);
}

c
int func(int start, int end){
  int length=end+1-start;
  if((length<1)||(start<0)||(end<0)){ return(0); }
  if(length%3==0){
    return(func(start+1, end));
  } else if(length%3==1){
    return(1+func(start, end-1));
  } else {
    return(func(start+2, end));
  }
}