Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
Look up keyword
Like this
0 of .
Results for:
No results containing your search query
P. 1
(Www.entrance-exam.net)-GATE - 2012 CS Syllabus

(Www.entrance-exam.net)-GATE - 2012 CS Syllabus

Ratings: (0)|Views: 0 |Likes:
Published by Piyush Raghav

More info:

Published by: Piyush Raghav on Oct 15, 2012
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





Engineering Mathematics
Mathematical Logic:
Propositional Logic; First Order Logic.
Conditional Probability; Mean, Median, Mode and Standard Deviation; RandomVariables; Distributions; uniform, normal, exponential, Poisson, Binomial.
Set Theory & Algebra:
Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.
Permutations; Combinations; Counting; Summation; generating functions; recurrencerelations; asymptotics.
Graph Theory:
Connectivity; spanning trees; Cut vertices & edges; covering; matching; independentsets; Colouring; Planarity; Isomorphism.
Linear Algebra:
Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigenvectors.
Numerical Methods:
LU decomposition for systems of linear equations; numerical solutions of non-linearalgebraic equations by Secant, Bisection and Newton-Raphson Methods; Numericalintegration by trapezoidal and Simpson's rules.
Limit, Continuity & differentiability, Mean value Theorems, Theorems of integralcalculus, evaluation of definite & improper integrals, Partial derivatives, Totalderivatives, maxima & minima.
Computer Science and Information Technology
Digital Logic:
Logic functions, Minimization, Design and synthesis of combinational and sequentialcircuits; 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, Cacheand main memory, Secondary storage.
Programming and Data Structures:
Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstractdata types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binaryheaps.
Analysis, Asymptotic notation, Notions of space and time complexity, Worst andaverage case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortestpaths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) oftime 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-downautomata, 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:

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->