GATE 2026 CSE Shift 1 Question Paper with Solutions Available: Download PDF Here

GATE 2026 CSE Question Paper with Solutions PDF Free Download

You can use the GATE 2026 CSE question paper with solutions PDF free download option from below. The official GATE question paper will be added to the table soon. The memory-based questions for shift 1 and shift 2 are given below.

GATE CSE 2026 Question Paper Shift 1 and 2 - Available soon

CSE Paper I (Memory-based questions):

Question 1: Which of the following cannot be the number of states in the minimal DFA equivalent to the NFA of 6 states?
A) 1
B) 32
C) 65
D) 128

Question 2: Consider the following C statement:

char * str1 = "Hello"; // stmt S1 char * str2 = "Hello"; // stmt S2 char * str3 = "Hello" // stmt S3
Which of the following are correct?

Question 3: Which of the following is always true for LL(1) parser?
A) Grammar must be left factored
B) LL(1) parser is more powerful than SLR(1).
C) LL(1) is non back tracking.
D) Grammar must be left recursive.

Question 4: Consider a relation R(A,B,C,D) and functional dependencies of X→Y. Which of the following statement are correct?
A) If PQ→R, then P→R or Q→R.
B) If P→R and Q→S, then PQ→RS.
C) If P→R, then PQ→R.
D) If PQ→R and P→R, then Q→R.

Question 5: With respect to the TCP connection between client and server, which of the following is True?

A) TCP connection is half-duplex

B) The client and server use the three-way Handshake mechanism

C) Before starting data Transmission client and server can initiate closing the connection at the same time
D) The server can not initiate closing of correction once the client initiates closing of the connection

Question 6: For n>1, the maximum multiplicity of any eigenvalue of an n×n matrix with real entries is?
A) n−1
B) n+1
C) n
D) 1

Question 7: A n×n, n>1. If (1,0,1,0,0,…,0)∈R n belongs to the null space of A then
A) |A| = 0
B) |A| = 1
C) Rank A = 1
D) There are at least 2 non zero vectors in the null space of A.

Question 8: There are 5 processes in a system. The maximum number of records a process can take is 2. At a time, a process can take only a single resource and can free only a single resource. How many records are required to ensure deadlock-free execution ______?

Question 9: Which of the following is may not dependency preserving decomposition?
A) 1NF
B) 2NF
C) 3NF
D) BCNF

CSE Paper II ( Memory-based questions):

Question1 :If an IP network uses a S.M of 255.255.208.0, the max number of IP add. that can be assigned to network interfaces is ____ .

Question 2: Let the determinant of a 4×4 matrix A is 3, then what is the determinant of 2A?

Question 3: Consider a probability density function (PDF) of a random variable X as fX(x)=132πe−x218, x∈(−∞,+∞). Then, which one of the following statements is/are true?
A) X is following Poisson distribution
B) X is following normal distribution.
C) X is following exponential distribution
D) X is following uniform distribution

Question 4: Let R be a binary relation on the set A={1,2,…,10} defined by (x,y)∈R⟺xy is a perfect square. Which of the following properties does R satisfy?

A) Symmetric

B) Antisymmetric

C) Transitive

D) Reflexive

Question 5: For how many combinations of S1,Sb will the output y=1 for the given circuit [A,B,S1,S0] ?

Question 6: Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word-addressible. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLB miss?

A) 16×210

B) 256×210

C) 4×220

D) 8×220

Question 7: Which of the following CPU scheduling algo cannot be pre-emptive?
A) RR (Round Robin)
B) SRTF (Shortest Remaining Time First)
C) Priority
D) FCFS (First Come First Served)

Question 8: Which can be recurrence relations to an algo. with T.C O(n)?
A) T(n)=2T(n2)+n, T(1)=1
B) T(n)=T(n−1)+1
C) T(n)=2T(n2)+1, T(1)=1
D) T(n)=T(n−1)+n

Question 9: Four 4 bit 2's-complement numbers are given: N1=1011,N2=1101,N3=1010,N4=1001. Which of the following arithmetic operations results in overflow?
A) N1+N2
B) N2+N3
C) N1+N4
D) N3−N4

Question 10: In C runtime eigenvalues which one of the following our is stored in heap.
A) Local variables
B) Global variables
C) Static variables
D) Dynamically allocated memory

GATE CS Question Paper: Overview

The GATE CS question paper is one of the most important exams for aspirants aiming to pursue MTech or other opportunities in computer science and related fields. Go through the table below to understand the exam paper pattern for the GATE CS question paper 2026:

You can also check the exam pattern of GATE 2026 to the marking scheme.

GATE 2026 CSE Question Paper with Solutions: Marking Scheme

The GATE 2026 CSE exam is now over, and candidates can assess their performance by using the memory-based question paper and answers above. Before the results are announced, you can estimate your score using the official marking scheme shown in the table below:

Students can calculate/ assume their marks based on the given formula below:

Formula: Total marks = Total marks secured for correct response – Negative marks for wrong response.

How to Download GATE Computer Science Question Papers with Answers PDF?

First, click on the GATE Computer Science Question Papers link available in the table above. By clicking on that link, you will be redirected to the official website of Careers360. Old users can log in using their registered email ID and password, while new users will need to complete the registration process. After logging in, click on the Download PDF option. The GATE Computer Science Question Paper with Answers PDF will be sent to your registered email ID. Check your inbox to view and download the PDF for reference and practice.

GATE CS Question Paper 2026: Weightage Distribution

The GATE CS question paper covers the computer and data science syllabus. However, like any other exam, this subject also has a weightage average depending on the last 5 years of the exam. Upon reviewing the GATE 2026 CSE question paper with solutions, the following weightage table was prepared. This can help you prepare better for the GATE CS question paper 2026:

You can also understand the weightage table by the following graph:

GATE CS Question Paper: Previous Years

You can also download the GATE Computer Science Question Papers with Answers PDF: