GATE Computer Science Syllabus

GATE Paper Code for Computer Science Engineering is CS and the GATE CS syllabus summery is ENGINEERING MATHEMATICS: Mathematical Logic, Probability, Set Theory & Algebra, Combinatorics, Graph Theory, Linear Algebra, Numerical Methods, Calculus, COMPUTER SCIENCE AND INFORMATION TECHNOLOGY: Digital Logic, Computer Organization and Architecture, Programming and Data Structures, Algorithms, Theory of Computation, Compiler Design, Operating System, Databases, Information Systems and Software Engineering, Computer Networks, Web technologies. Detailed syllabus for GATE 2013 Computer Science is as follows

GATE 2013 Syllabus for Computer Science and Information Technology (CS)

Mathematical Logic: Propositional Logic; First Order Logic.
Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.
Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.
Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.
Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism.
Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.
Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson’s rules.
Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.
Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).
Computer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.
Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.
Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete.
Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.
Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.
Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.
Databases: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control.
Information Systems and Software Engineering: information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance.
Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. Network security – basic concepts of public key and private key cryptography, digital signature, firewalls.
Web technologies: HTML, XML, basic concepts of client-server computing.

65 thoughts on “GATE Computer Science Syllabus”

  1. hi i am a 4th year b teh it student i have to prepare for gate where to start my preparation and tell me about the books and syllbus stday material

  2. Hello, I’ve completed B.E in CSE and later MBA IT, I want to go ahead with PhD. Should I give the GATE for the same and GATE in CSE or Management?

  3. hi sir i am seenu good evening i want small help some students told to me 2014 gate syllobus can be change . its fact or lie plz reply me

    1. Pattern of GATE-2014 Question Papers and Marking Scheme Single paper of 65 questions (Combination of multiple choice questions (MCQ) and numerical answer type questions i.e. question without any options, you need to enter your answer using computer based Key-board) Duration : 3-hour Total Marks : 100 10 questions of 15 marks from General Aptitude (GA), 15% of the total marks Engineering Mathematics will carry around, 13% of the total marks GATE 2014 would contain questions of two different types in various papers: (i) Multiple Choice Questions (MCQ) carrying 1 or 2 marks each in all papers and sections. These questions are objective in nature, and each will have a choice of four answers, out of which the candidate has to mark the correct answer(s). (ii) Numerical Answer Questions of 1 or 2 marks each in all papers and sections. For these questions the answer is a real number, to be entered by the candidate using the virtual keypad. No choices will be shown for this type of questions. Pattern & Format of Questions : These are based on facts, principles, formulae or laws of the discipline of the paper. The candidate is expected to be able to obtain the answer either from his/her memory of the subject or at most from a one-line computation. GATE-2014 examination Important Dates GATE Online Application form through IIT website (Processing System (GOAPS): 2nd September 2013 Last Date for GATE-2014 Enrolment (after this only enrolled candidates can fill the application) : 1st October 2013 Last date for Submission of GATE-2014 Online Application through Website: 3rd October 2013

  4. i am btech 4th semester student. i want to know that how should i start preparation for GATE , plz tell book or way to proceed in that direction.

  5. Pingback: Archive | GATE 2013 Exam Date, Syllabus, Coaching, Study materials, Question Papers, GATE Prep
    1. frnd aap abhi se un subject pe dhyaan dena shuru kr dijiye jo GATE k test me aate hai..isse aap ki thodi thodi tyaari bhi hoti jayegi or acchi scoring bhi kr skte ho aap.

  6. i am studying cse 3 year.i want to know about the GATE exam and how i want to prepare for the exams from now itself and alsi which book i want to prefer.plz help me………..

  7. sir i want to know what are the scopes after doing mtech as rite nw i am confused whether to go for campus placement or for mtech.. i am from cse branch so plz guide me with best of ur knowledge..

  8. hi i am a final year student of cs.i want to prepare for gate exam.tell me the syllabus and procedure for preparation and which book i have to refer.please help me

  9. i am studying cse first year.i want to know about the GATE exam and how i want to prepare for the exams from now itself and alsi which book i want to prefer.plz help me………..

    Syllabi –> General Aptitude Verbal Ability: English grammar, sentence completion, verbal analogies, word groups, instructions, critical reasoning and verbal deduction.

    Numerical Ability: Numerical computation, numerical estimation, numerical reasoning and data interpretation.

    search and find more videos

Leave a Reply