GATE - Computer Science Engineering 2017

Graduate Aptitude Test in Engineering 2017

National level Exam
  • Computer Science
  • Eligibility
  • Exam Pattern
  • Syllabus
  • Study material
  • EXAM DATE
    Feb 4 2017 12:00AM - Feb 4 2017 12:00AM
  • APPLICATION FORM
    Sep 1 2016 12:00AM - Oct 4 2016 12:00AM
  • RESULT
    Mar 27 2017 12:00AM

GATE Computer Science - Syllabus

 

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.
Topics removed: Graph Theory: Planarity; Isomorphism.
Linear Algebra: Matrices, determinants, system of linear equations, eigen values 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.
Topics removed: 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. Computer Science and Information Technology
 
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).
Topic removed: Memory Interface
 
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 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.
Topics removed: Target code generation, Basics of code optimization.
 
Section 8: Operating System
Processes, threads, interprocess communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.
Topics removed: I/O systems, Protection and security
 
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. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.
Topics removed: Token Ring, SEWT (Complete topic)
New topics: Basics of Wifi & switching, Digital signals

SUBSCRIBE News

GET LATEST NEWS ABOUT EXAMS. FORMS DATE AND OTHERS