GATE Syllabus For CSE 2023 (PDF) Computer Science Engineering Exam Pattern

Rate this post

GATE CSE Syllabus 2022 PDF: GATE CSE Assistant Professor Syllabus and Exam Pattern PDF are available on this page for Download. The Indian Institute of Technology Kharagpur has released the Subject Wise GATE CSE Syllabus on its Official website @ The GATE CSE Notification 2022 has been released by the Officials and the Karnataka SET Exam 2022 will be held soon. So the Candidates who had applied for GATE CSE 2022 and Stated Exam preparation for the GATE CSE Exam should check this Article now. Here we have provided the GATE CSE Syllabus. The GATE Computer Science Engineering will be conducted to recruit the GATE (Graduate Aptitude Test in Engineering). To help the Aspirants we have uploaded the GATE CSE Syllabus on this page for Download. Here we have provided the Subject Wise GATE CSE Syllabus PDF.

GATE CSE Syllabus 2023 

 OrganizationIndian Institute of Technology Kharagpur (IIT Kharagpur)
 ExaminationGATE (Graduate Aptitude Test in Engineering)
Category Syllabus
Mode of the ExamOnline

Check GATE Exam Pattern 2023 PDF

Examination ModeComputer-Based Test (CBT) [will be conducted at select centers in select cities]
Duration3 Hours*
Number of Subjects (Papers)29
SectionsGeneral Aptitude (GA) + Candidate’s Selected Subject(s)
Type of Questions
  • (a) Multiple Choice Questions (MCQ)
  • (b) Multiple Select Questions (MSQ) and/ or
  • (c) Numerical Answer Type (NAT) Questions
Questions for testing these abilities
  • (a) Recall
  • (b) Comprehension
  • (c) Application
  • (d) Analysis & Synthesis
Number of Questions10 (GA) + 55 (subject) = 65 Questions
Distribution of Marks in all Papers EXCEPT papers AR, CY, EY, GG, MA, PH, ST, XH and XL
  • General Aptitude: 15 Marks
  • Engineering Mathematics **: 13 Marks
  • Subject Questions: 72 Marks
  • Total: 100 Marks

(** XE includes Engineering Mathematics section XE-A of 15 Marks)

Distribution of Marks in papers AR, CY, EY, GG, MA, PH, ST, XH, and XL
  • General Aptitude: 15 Marks
  • Subject Questions: 85 Marks
  • Total: 100 Marks
Marking SchemeQuestions carry 1 mark and 2 marks
Negative Marking
  • For a wrong answer chosen in an MCQ, there will be a negative marking.
  • For 1-mark MCQ, 1/3 mark will be deducted for a wrong answer.
  • Likewise, For 2-mark MCQ, the 2/3 mark will be deducted for a wrong answer.
  • No negative marking for Incorrect answer(s) to MSQ or NAT questions.

GATE Marking Scheme

Paper CodeGeneral Aptitude (GA) MarksSubject MarksTotal MarksTotal Time (Minutes)
AE, AG, BM, BT, CE, CH, CS, CY, EC, EE, ES, EY, IN, MA, ME, MN, MT, NM, PE, PH, PI, ST, TF1585100180
AR [Part A + Part B1 or B2 (B1: Architecture or B2: Planning)] B1 or B2 can be selected during Exam.1560 + 25100180
GE [Part A + Part B1 or B2 (B1 – Surveying and Mapping or B2 -Image Processing and Analysis)] B1 or B2 can be selected during the Exam.1555 + 30100180
GG [Part A + Part B] (Section 1: Geology or Section 2: Geophysics)1525 + 60100180
XE (Section A + Any TWO Sections)
Sections can be selected during Exam.
1515 + (2 x 35)100180
XH (Section B1 + Any ONE Section)1525 + 60100180
XL (Section P + Any TWO Sections)
Sections can be selected during Exam.
1525 + (2 x 30)100180

Download Latest GATE CSE Syllabus 2023 PDF

This article is about to provide the GATE CSE Syllabus and Exam Pattern for those candidates who have applied for GATE Computer Science Engineering Recruitment 2022. Here we provide the latest GATE  Syllabus and Exam Pattern for Examination. Download GATE Computer Science Engineering Syllabus PDF 2022 for Free Download. The Candidates can get the GATE Computer Science Engineering Exam Syllabus and Exam Pattern Free of cost

Section 1: Engineering Mathematics
  • Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Monoids, Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions.
  • Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition
  • Calculus:  Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
  • Probability: Random variables. Uniform, normal, exponential, poisson and binomial
    distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.
Section 2: Digital Logic
  • Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
Section 3: Computer Organization and Architecture
  • Machine instructions and addressing modes. ALU, data-path and control unit. Instruction pipelining,pipeline hazards. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).
Section 4: Programming and Data Structures
  • Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
Section 5: Algorithms
  • Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer. Graph  traversals, minimum spanning trees, shortest paths
Section 6: Theory of Computation
  • Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability. .
Section 7: Compiler Design
  • Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. Local optimisation, Data flow analyses: constant propagation, liveness analysis, common subexpression elimination.
Section 8: Operating System
  • System calls, processes, threads, inter-process communication, concurrency and synchronization. Deadlock. CPU and I/O scheduling. Memory management and virtual memory. File systems.
Section 9: Databases
  • ER-model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.
Section 10: Computer Networks
  • Concept of layering: OSI and TCP/IP Protocol Stacks; Basics of packet, circuit and virtual circuit switching; Data link layer: framing, error detection, Medium Access Control, Ethernet bridging; Routing protocols: shortest path, flooding, distance vector and link state routing; Fragmentation and IP addressing, IPv4, CIDR notation, Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT); Transport layer: flow control and congestion control, UDP, TCP, sockets; Application layer protocols: DNS, SMTP, HTTP, FTP, Email.

Direct Download Links for GATE Syllabus 2023

More related articles