Gate Syllabus - Computer Science and Engineering
Gate Syllabus - Computer Science and Engineering
Contents
COMPUTER SCIENCE AND INFORMATION TECHNOLOGY – CS & IT Compilers Ebooks (9)
Engineering and Machine Drawing Ebooks
Engineering Mathematics
(1)
Mathematical Logic: Propositional Logic; First Order Logic. Finite Element Method Ebooks (8)
Fluid Mechanics and Machinery Ebooks (4)
Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Fluid Mechanics Notes (1)
Variables; Distributions; uniform, normal, exponential, Poisson, Binomial. Machine Design Ebooks (1)
MATLAB Codes (1)
Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean
MATLAB Ebooks (7)
Algebra.
Refrigeration and air conditioning (4)
Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; Strength of Materials Ebooks (1)
Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching;
independent sets; Colouring; Planarity; Isomorphism.
Archives
Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigen values
and Eigen vectors. March 2017
February 2017
Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of January 2017
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 Upload Files
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.
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.
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.
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.
GENERAL APTITUDE
Verbal Ability: English grammar, sentence completion, verbal analogies, word groups,
instructions, critical reasoning and verbal deduction.
RECENT COMMENTS
DK BAJPAI on PSYCHROMETRY