1/15 /1 2 GATE 2012 Exam Sy llabus, GATE 2012 Sy llabus, Sy ll abus for GATE 2012, Sy ll abus Mtech GATE 2012, 1/13 www.gateforum.com/GATE_syllabus.php AdiiNificaiTANC ET Nifica iNIT RaiAdiiPSU NificaieTeTicebaed cachig fGATE. • Computer Based Classes Can be accessed at any time from any computerthrough the internet and DVD. • More than 250 hours ofHome > Gate > Gate Syllabus G A T EC | CS | EE | ME | CE | IN | PY CeSciece & IfaiT echg - CS ENGINEERING MATHEMATICS Mahemaical Logic: Propositional Logic; First Order Logic. Pbabii: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Dis normal, exponential, Poiss on, Binomial. SeThe& Ageba: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algeb ra. Cbiaic: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; Gah The: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; C Isomorphism. LieaAgeba: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors NeicaMehd: LU decomposition for systems of linear equations; numerical solutions of non-linear alg Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpsons rules. Cac: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation ofintegrals, Partial derivatives, Total derivatives, maxima & minima. COMPUTER SCIENCE AND INFORMATION TECHN OLOGY DigiaLgic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Nu and computer arithmetic (fixed and floating point). CeOgaiaiad Achiece: Machine instructions and addressing modes, ALU and data-path, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secon Pgaig ad Daa Sce: Programming in C; Functions, Recursion, Parameter passing, Scope, Bin types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps. Agih: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected componen Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and spa bounds, Basic concepts of complexity classes - P, NP, NP-hard, NP-complete. He AbUGATE PSU CeRegiaiNificaiDadF AQ CaeePaeih UCacUNificai
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
concepts of hubs, switches, gateways, and routers. Network security basic concepts of public key and priv
digital s ignature, firewalls.
Web echgie: HTML, XML, basic concepts of client-server computing.
Eecica Egieeig - EE
ENGINEERING MATHEMATICS
Liea Ageba: Matrix Algebra, Systems of linear equations, Eigen values and eigen vectors.
Cac: Mean value theorems, Theorems of integral calculus, Evaluation of definite and improper integra
Maxima and minima, Multiple integrals, Fourier series. Vector identities, Directional derivatives, Line, Surface
Stokes, Gauss and Greens theorems.
Diffeeia eai: First order equation (linear and nonlinear), Higher order linear differential equ
coefficients, Method of variation of parameters, Cauchys and Eulers equations, Initial and boundary vaDifferential Equations and variable separable method.
Ce aiabe: Analytic functions, Cauchys integral theorem and integral formula, Taylors and Lau
theorem, solution integrals.
Pbabii ad Saiic: Sampling theorems, Conditional probability, Mean, median, mode and standa
variables, Discrete and continuous distributions, Poisson, Normal and Binomial distribution, Correlation and reg
Neica Mehd: Solutions of non-linear algebraic equations, single and multi-step methods for differential