GATE Computer Science  Engineering Syllabus

GATE Computer Science & Engineering (CS) Syllabus – Download Syllabus in PDF – Learn Dunia

Engineering GATE

GATE Computer Science  Engineering Syllabus:GATE Syllabus is based on the different stream according to the qualifying examination. IIT Madras has define GATE syllabus in this year according to the 23 papers. These will be conducted for admissions to the M.Tech programmes which is offered by the  IITs and IISC. The GATE syllabus 2019 will be same according to the previous year. The national level engineering entrance exam will be conducted for post graduation courses on February 2rd & 3th and February 9th & 10th, 2019. Candidates need to review GATE syllabus 2019 for the stream that they will be appearing for.The syllabus defines that what are the topics their subtopics they need to prepares for the appearing examination.Candidates can download GATE syllabus 2019from below given table where the syllabus are given for every stream. The syllabus is the very important part of the examination because it plays an important role in the examination.

newiconGATE 2019 Exam Dates has been released now, Click Here for more information

GATE Computer Science Engineering Syllabus – CS

GATE Computer Science (CS) Syllabus Consists of several sections General Aptitude, Engineering Mathematics, Main Syllabus.

Lets discuss the Computer Science  Engineering Syllabus, Check Below:

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 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. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).

Also Check:

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, 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

Also Check:

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.

Click Here to Download GATE Computer Science & Engineering Syllabus in PDF

GATE Computer Science & Engineering Books

Books Buy Now

GATE 2018: Computer Science & IT Engineering – Solved Papers (26 Years)

Click Here

Computer science and Information Technology – Made Easy GATE Notes

Click Here

Computer Science & Information Technology GATE 2018

Click Here

GATE Topic-Wise Previous Years Solved Papers for Computer Science & Information Technology

Click Here

GATE Test Series & Previous Year Solved Papers – Computer Science & Information Technology

Click Here

Click Here to Download and Buy GATE Computer Science (CS) & Engineering Books

for more information & query regarding GATE, leave a query in below comment box

We wish you all the best for your Bright Future.

Best Wishes!!!!!!!!!

Team

Take Help from us

Leave a Reply

Your email address will not be published. Required fields are marked *