GATE Computer Science Engineering Syllabus 2019 – GATE CSE Chapters & Topics

0

GATE Computer Science Engineering Syllabus 2019: Check out the latest GATE Syllabus for Computer Science Engineering (CSE). Computer Science subject is the one of the papers in GATE 2019 Exam. Earlier we’ve provided GATE Exam pattern 2019, Now we are providing GATE Syllabus 2019 of Computer Science Paper. CS is the subject code of GATE Computer Science Engineering Exam. Below we’ve provided GATE Computer Science Engineering Syllabus and weight-age for GATE    2019 Exam. Here you can see Computer Science Engineering applicable chapters and topics for GATE exam 2019.

GATE Paper Pattern & Marks Weightage

GATE paper questions are divided into three sections.  As given below GATE marks are distributed for each section. 70% of the marks covers the core subject of the GATE Exam. i.e here Core Subject is Computer Science Engineering.

GATE 2018 – 2019
Paper Pattern for Computer Science Engineering (CS)

GATE Paper SectionsGATE Marks Distribution
Subject Questions (Core Subject)70% of the total marks.
Engineering Mathematics15% of the total marks.
General Aptitude (GA)15% of the total marks.
📢 Get Latest Exam Updates via E-mail ✉

Note : Submit your name, email, state and updates category below.
  • This field is for validation purposes and should be left unchanged.

GATE Computer Science Engineering Syllabus (CSE)

The GATE exam will also have General Aptitude section. General Aptitude section is common for all papers. You can download the GATE 2019 Syllabus for General Aptitude (GA) in PDF or you can check

GATE General Aptitude (GA) Syllabus (Full Details)

GATE 2019 Syllabus pdf

GATE Computer Science Engineering Syllabus

General Aptitude Syllabus (Common to all papers)Download
GATE Syllabus for Computer Science Engineering (CS)Download

 

Computer science Section 1: Engineering Mathematics

Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions.

Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigen vectors, 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.

Computer science 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. 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 search, minimum spanning trees, and 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.

Section 8: Operating System

Processes, threads, inter‐process communication, concurrency and synchronization.

Deadlock. CPU 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. LAN technologies (Ethernet). Flow and error control techniques, switching. 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 Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.

Related Topics

 

Leave A Reply

Your email address will not be published.