GATE CSE Exam Pattern 2023 consists of 65 questions of 100 marks in total. The questions asked will be one of the three types - Multiple Choice Questions (MCQ), Multiple Select Questions (MSQ) and Numerical Answer type Question (NAT). About 72% weightage (of the total marks) is given to GATE CSE Core syllabus, 15% to General Aptitude and 13% to the Engineering mathematics.The important topics from which the questions are asked are - Digital Logic, Algorithms, Theory of Computation, Computer Organizations etc.Candidates appearing for the GATE CSE paper can also choose to appear for Mathematics (MA) as their second paper. Check GATE 2023 CSE Syllabus
With more than 3 Lakhs students appearing specifically for GATE CSE exam each year, it is absolutely vital for the candidates to get familiarised with the GATE CSE Syllabus and GATE CSE Exam pattern.The article below explains the GATE CSE Exam pattern in detail.
Check Out:
GATE CSE Exam Pattern 2023: Highlights
The various highlights of the GATE CSE 2023 Exam pattern are given below:
| Mode | Online - Computer Based Test (CBT) |
| Duration | 3 Hours (180 Minutes) |
| Nature of Questions | MCQ – Multiple Choice Questions MSQ – Multiple Select Questions NAT – Numerical Answer Type |
| Number of Questions | 65 Questions |
| Total Marks | 100 Marks |
| Marks Awarded | 1 or 2 marks per correct answer |
| Negative Marking | 1/3rd Mark will be deducted for 1 mark question; 2/3rd Mark will be deducted for 2 marks question |
| Medium | English |
GATE CSE Marking Scheme 2023
- The paper is of 100 marks and the total number of questions is 65
- The language of the paper is English.
- MCQs - 1 Marks – For each right answer; 1/3 marks will be deducted for each wrong answer.
- MCQs - 2 Marks – For each right answer; 2/3 marks will be deducted for each of the wrong answers.
- NAT – There is no negative checking for Numerical Answer Type (NAT) questions.
- MSQ – There is no negative marking for a wrong answer in MSQ questions. However, there are no partial marks awarded for choosing partially correct combinations of choices or any single wrong choice
Here is the table for the summarised Section wise distribution of marks for GATE CSE 2023 -
| Section | Number of questions | Marks per Question | Total Marks |
|---|---|---|---|
| Computer Science Engineering | 25 (MCQ/NAT) | 1 | 25 |
| 30 (MSQ/NAT) | 2 | 60 | |
| General Aptitude | 10 (NAT/MCQ/MCQ) | 1 or 2 | 15 |
| Total | 65 | - | 100 |
GATE CSE Exam Pattern 2023: Weightage of Sections
With over 10 sections which include complex topics like Algorithms, Data logic, Discrete mathematics, Compiler Design and others, GATE CSE syllabus definitely requires a long preparation duration of over 8 months to be completed in full. Students can reduce this period significantly by focusing solely on the topics with high weightage in the GATE Exam. A list of such sections are tabulated below.
Section 1: General Aptitude
| Section | Topics | Average Weightage of Marks |
|---|---|---|
| Numerical Ability | Numerical Computation | 8 |
| Numerical Estimation | ||
| Numerical Reasoning and DATA Interpretation | ||
| Verbal Ability | English Grammar | 10 |
| Sentence Completion | ||
| Verbal Analogies | ||
| Word Groups | ||
| Instructions | ||
| Critical Reasoning and Verbal Deduction |
Section 2: Engineering Mathematics
1.Discrete Mathematics
| Subject | Topics | Average Weightage of Marks |
|---|---|---|
| Discrete Mathematics | Propositional and first-order logic | 10 |
| Sets, Relations | ||
| Functions | ||
| Partial Orders and lattices | ||
| Groups | ||
| Graphs: connectivity,matching,colouring | ||
| Combinators: counting,recurrence,relations,generating functions |
2.Engineering Mathematics
| Subject | Topics | Average Weightage of Marks |
|---|---|---|
| Engineering Mathematics | Matrices | 6 |
| Determinants | ||
| The system of linear equations | ||
| Eigenvalues and Eigenvectors,LU decomposition | ||
| Limits | ||
| Continuity and differentiability | ||
| Maxima and Minima | ||
| Mean, Median, Mode & Standard deviation | ||
| Mean value theorem | ||
| Integration | ||
| Conditional Probability & Bayes theorem | ||
| Uniform ,Normal,Exponential,Poisson and Binomial distributions |
Section 3: Computer Science subjects
1.Digital Logic
| Section | Topics | Average Weightage of Marks |
|---|---|---|
| Digital Logic | Number Representation and Computer arithmetic (fixed & floating point) | 7 |
| Combinational and Sequential circuits | ||
| Boolean Algebra | ||
| Minimization |
2.Computer Organization and Architecture
| Section | Topics | Average Weightage of Marks |
|---|---|---|
| Computer Organization and Architecture | Machine instructions and addressing modes | 5 |
| ALU | ||
| Data-path and control unit | ||
| Instruction Pipelining | ||
| Memory Hierarchy:cache | ||
| Main Memory | ||
| Secondary Storage | ||
| I/O interface( Interrupt and DMA) |
3.Programming and Data structure
| Section | Topics | Average Weightage of Marks |
|---|---|---|
| Programming and Data structure | Programming C | 15 |
| Recursion | ||
| Boolean Algebra | ||
| Arrays | ||
| Stacks | ||
| Linked List | ||
| Queues | ||
| Binary Heaps | ||
| Graphs | ||
| Trees | ||
| Binary search trees |
Quick Links:
4.Algorithms
| Section | Topics | Average Weightage of Marks |
|---|---|---|
| Algorithms | Searching, sorting & hashing | 5 |
| Asymptotic worst-case time and space complexity | ||
| Algorithm design techniques: greedy,dynamic programming and divide-and-conquer | ||
| Minimum spanning trees | ||
| Graph search | ||
| Shortest Paths |
5.Theory of Computation
| Section | Topics | Average Weightage of Marks |
|---|---|---|
| Theory of Computation | Regular expressions and finite automata | 6 |
| Context-free grammars and pushdown automata | ||
| Regular and context-free languages | ||
| Pumping Lemma | ||
| Turing Machines | ||
| Undecidability |
6.Compiler Design
| Section | Topics | Average Weightage of Marks |
|---|---|---|
| Compiler Design | Lexical analysis | 5 |
| Parsing | ||
| Syntax-directed translation | ||
| Runtime Environments | ||
| Intermediate code |
7.Operating Systems
| Section | Topics | Average Weightage of Marks |
|---|---|---|
| Operating Systems | Processes | 8 |
| Thread | ||
| Inter-process communication | ||
| Deadlock | ||
| Concurrency and synchronization | ||
| CPU Scheduling | ||
| Memory management and virtual memory | ||
| File systems |
8.Database
| Section | Topics | Average Weightage of Marks |
|---|---|---|
| Database | ER-Model | 9 |
| Relational Model: Relational algebra,tuple,calculus,SQL | ||
| Integrity constraints,normal forms | ||
| File organization,indexing (e.g. B and B+ trees) | ||
| Transactions and concurrency control |
9.Computer Networks
| Section | Topics | Average Weightage of Marks |
|---|---|---|
| Computer Networks | Concept of Layering | 9 |
| LAN technologies (Ethernet) | ||
| IPv4/IPv6, routers and routing algorithms (distance vector, link state) | ||
| TCP/UDP and sockets, congestion control | ||
| Application layer protocols (DNS,SMTP,POP,FTP,HTTP) | ||
| Basics of WiFi | ||
| Network Security: authentication,basics of the public key cryptography, digital signatures and certificates,firewalls |
GATE CSE Previous Year Paper Analysis
The data presented above regarding the weightage of sections has been compiled by the detailed Paper Analysis of the Previous years question papers. However the data from each year's question paper also has other uses than estimating the ‘general average weightage of sections’, it can also show us the trends of weightage from different sections over the years. SO for that purpose a brief analysis of the previous year question papers are given below
GATE CSE 2021 Paper Analysis
| Topics | Number of Questions in the Exam |
|---|---|
| Algorithms | 4 |
| Digital Logic | 3 |
| Computer Network | 4 |
| Data Structure | 2 |
| Computer Organisations | 6 |
| Theory of Computation | 6 |
| Databases | 7 |
| Compiler Design | 4 |
| Operating Systems | 6 |
| Discrete Mathematics | 5 |
| Engineering Mathematics | 8 |
| General Aptitude | 10 |
Previous Years Analysis for GATE CSE: Weightage of Topics
| SUBJECTS | GATE 2012 | GATE 2013 | GATE 2014 | GATE 2015 | GATE 2016 | GATE 2017 | GATE 2018 | GATE 2019 | GATE 2020 |
|---|---|---|---|---|---|---|---|---|---|
| Engineering Mathematics* | 17% | 12% | 21% | 17% | 13.75% | 8% | 7% | 6% | 5% |
| Discrete Mathematics & Graph Theory | 11% | 10% | 12.7% | 11% | 4.5% | 7% | 11% | 5% | 10% |
| Design & Analysis Algorithms | 9% | 8% | 9% | 8.5% | 9.75% | 6.5% | 7% | 7% | 6% |
| Programming & Data Structure | 18% | 17% | 12% | 16% | 9.75% | 13.5% | 11% | 10% | 12% |
| Digital Logic | 5% | 4% | 6% | 7% | 6% | 5% | 4% | 9% | 4% |
| Computer Organization* | 5% | 11% | 8% | 6% | 7% | 9% | 11% | 3% | 8% |
| Theory Of Computation | 4% | 7% | 7% | 6% | 8.25% | 9.5% | 7% | 8% | 10% |
| Compiler design | 5% | 4% | 3% | 4% | 3.5% | 4% | 6% | 6% | 4% |
| Operating Systems* | 8% | 11% | 8% | 8% | 15.5% | 9% | 9% | 11% | 9% |
| DBMS* | 12% | 8% | 8% | 6% | 5.75% | 6% | 5% | 8% | 8% |
| Computer Networks | 9% | 7% | 8% | 8% | 10% | 7.5% | 7% | 11% | 9% |
Must Read:
GATE CSE Exam Pattern 2023: Sample Questions from Major Topics
Given below are the 1 & 2 Mark Questions from GATE CS Previous Years Papers With Solution
- Ques. What is the worst-case time complexity of inserting n2 elements into an AVL-tree with n elements initially?
Answer. Θ(n2 log n)
Explanation: Since the AVL tree is a balanced tree, the height is O(log n). So, time complexity to insert an element in an AVL tree is O(log n) in the worst case.
- Ques. A processor has 64 registers and uses a 16-bit instruction format. It has two types of instructions: I-type and R-type. Each I-type instruction contains an opcode, a registered name, and a 4-bit immediate value. Each R-type instruction contains an opcode and two register names. If there are 8 distinct I-type opcodes, then the maximum number of distinct R-type opcodes is _______.
Answer: 14 (Note – This question was Numerical Type.)
- Ques. Consider a database implemented using a B+ tree for file indexing and installed on a disk drive with a block size of 4 KB. The size of the search key is 12 bytes and the size of the tree/disk pointer is 8 bytes. Assume that the database has one million records. Also, assume that no node of the B+ tree and no records are present initially in the main memory. Consider that each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is ___________?
Answer: 4 (Note – This question was Numerical Type)
- Ques. Raman is confident of speaking English _______ six months as he has been practicing regularly _______ the last three weeks.
Answer: within, for
Download GATE Computer Science Practice Paper
GATE CSE Exam Pattern 2023:Important Instructions For Candidates
- To be on the safer side, try to reach the test centre an hour before the exam.
- Do not take any prohibited items such as mobile, notes, electronic watch etc inside the test center. In case one does carry them inside by mistake , promptly deposit them at the exam centre itself. A candidate will be outright banned from taking the GATE Exam if found in possentition of such items after the exam has begun.
- After taking your appointed seat do check that the computer allotted is working fine. Reach out to the administration quickly if there is any problem in the system.
- Make sure that one has occupied his allotted seat by confirming his photograph which would be displayed on the allotted system
- Do read the important instructions before the exam to get an idea of the marking and pattern.
- Do write GATE registration number on the rough/scribble pad provided
Must Read:
GATE CSE 2023 Exam Pattern FAQs
Ques. Are there any changes in the exam pattern of GATE CSE Exam Pattern 2023?
Ans: No. There are no changes in the marking scheme, weightage of sections, total number of questions, etc. The only change in the exam pattern is that from this year candidates can sit for a maximum of two papers.
Ques. How many sections are there in GATE CSE Exam Pattern 2023 and what is the weightage of each section?
Ans: There are three sections in the GATE CSE Exam Pattern 2023:
- General aptitude
- Engineering Mathematics
- Core subject syllabus
- General Aptitude carrying 15% of the total marks, Engineering Mathematics carrying 13% of the total marks, and Computer science Subject Questions carrying 72% of the total marks.
Ques. Will there be any negative marking as per GATE CSE Exam Pattern 2023?
Ans: Yes. For wrong answers, marks will be deducted depending on the total marks of that question.
The marking scheme is given below
| Type of question | Negative marking for wrong answer | Marking for correct answer |
|---|---|---|
| MCQs |
| +1 or 2 marks |
| MSQs, NATs | No negative marking | +1 or 2 marks |
Ques. What is the standard duration of the exam as per the GATE CSE Exam Pattern 2023?
Ans: The duration of the exam is 3 Hours. No extra time would be allotted to any candidate under any circumstances even if the candidate manages to acquire permission for delayed entry into the examination hall.
Ques. Many questions would be asked from the General Aptitude section in the exam as per the GATE CSE Exam Pattern 2023?
Ans. 10 Questions would be asked from the General Aptitude section comprising 15 marks in total. The rest of the 55 Question and 85 marks would be from Core CSE subjects and Engineering Mathematics.
Ques. How many 1 mark and 2 mark questions would be asked in the exam as per the GATE CSE Exam Pattern 2023?
Ans. The table below details the 1 and 2 marks questions asked in the GATE exam:
| Section | Marks per Question | Number of questions |
|---|---|---|
| Computer Science Engineering | 1 | 25 (MCQ/NAT) |
| 2 | 30 (MSQ/NAT) | |
| General Aptitude | 1 or 2 | 5 |
| Total | - | 65 |
Ques. How many questions from Theory of Computation are asked in the exam as per the GATE CSE Exam Pattern 2023?
Ans. There is no official statement/ provision regarding the inclusion of a set number of questions from a particular topic. Only 10 questions are to be asked from the General Aptitude section and the rest 55 Questions can be asked from any topic in the GATE CSE Syllabus. However, through the Computer Science Paper Analysis we are able to determine that Questions of 4-6 marks from Theory of Computation are asked in the paper each year.
Ques. How many questions from Digital logic are asked in the exam according to GATE CSE Exam Pattern 2023?
Ans. There is no official statement/ provision regarding the inclusion of a set number of questions from a particular topic. Only 10 questions are to be asked from the General Aptitude section and the rest 55 Questions can be asked from any topic in the GATE CSE Syllabus. However, through the Computer Science Paper Analysis we are able to determine that Questions of 4-7 marks from Discrete mathematics are asked in the paper each year.
Ques. Does the CSE Exam Pattern 2023 have provisions for undertaking the exam in Hindi?
Ans. No. The GATE exam is carried out in English language only. There is simply no provision for carrying out GATE in Hindi or any other regional language- marathi, Tamil, Urdu etc. Since, english is the medium of instruction across several engineering institutes, any applicant even slightly familiar with the language would not face any problem in comprehending the questions.
*The article might have information for the previous academic years, which will be updated soon subject to the notification issued by the University/College.
Comments