loader
Cart
  • 0
  • 0
Go to Checkout - 0
    CART IS EMPTY
Item removed. Undo

Cart

vaniinstitute logo

GATE Online Preparation - 2019

We fill the gap between Aspiration & Reality of GATE

GATE 2019 Syllabus for Computer Science and Engineering

Engineering Mathematics Syllabus


  • Discrete Mathematics

  • Propositional and first order logic

  • Sets

  • Relation

  • 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.

Digital Logic


  • Boolean algebra

  • Combinational and sequential circuits

  • Minimization

  • Number representations and computer arithmetic ( fixed and floating point ).

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 ).

Programming and Data Structures


  • Programming in C

  • Recursion

  • Arrays

  • Stacks

  • Queues

  • linked lists

  • trees

  • binary search trees

  • binary heaps

  • graphs.

Algorithms


  • Searchin

  • 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.

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.

Compiler Design


  • Lexical analysi

  • Parsing

  • syntax – directed translation

  • Runtime environments

  • Intermediate code generation.

Operating System


  • Processes

  • Threads

  • inter ‐ process communication

  • concurrency and synchronization

  • Deadlock

  • CPU scheduling

  • Memory management and virtual memory

  • File systems

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.

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 certificate

  • firewalls.

notificationX