COMPUTER SCIENCE ENGINEERING
ENGINEERING MATHEMATICS
Mathematical Logic: Propositional Logic;
First Order Logic.
Probability: Conditional Probability; Mean,
Median, Mode and Standard Deviation; Random
Variables; Distributions; uniform, normal,
exponential, Poisson, Binomial.
Set Theory & Algebra: Sets; Relations;
Functions; Groups; Partial Orders; Lattice;
Boolean Algebra.
Combinatorics: Permutations; Combinations;
Counting; Summation; generating functions;
recurrence relations; asymptotics.
Graph Theory: Connectivity; spanning trees;
Cut vertices & edges; covering;
matching; independent sets; Colouring;
Planarity; Isomorphism.
Linear Algebra: Algebra of matrices,
determinants, systems of linear equations,
Eigen values and Eigen vectors.
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.
Calculus: Limit, Continuity &
differentiability, Mean value Theorems,
Theorems of integral calculus, evaluation of
definite & improper integrals, Partial
derivatives, Total derivatives, maxima &
minima.
THEORY OF COMPUTATION
Formal Languages and Automata Theory:
Regular languages and finite automata,
Context free languages and Push-down
automata, Recursively enumerable sets and
Turing machines, Un-decidability;
Analysis of Algorithms and Computational
Complexity: Asymptotic analysis (best,
worst, average case) of time and space,
Upper and lower bounds on the complexity of
specific problems, NP-completeness.
COMPUTER HARDWARE
Digital Logic: Logic functions,
Minimization, Design and synthesis of
Combinational and Sequential circuits;
Number representation and Computer
Arithmetic (fixed and floating point);
Computer Organization: Machine instructions
and addressing modes, ALU and Data-path,
hardwired and micro-programmed control,
Memory interface, I/O interface (Interrupt
and DMA mode), Serial communication
interface, Instruction pipelining, Cache,
main and secondary storage.
SOFTWARE SYSTEMS
Data structures: Notion of abstract data
types, Stack, Queue, List, Set, String,
Tree, Binary search tree, Heap, Graph;
Programming Methodology: C programming,
Program control (iteration, recursion,
Functions), Scope, Binding, Parameter
passing, Elementary concepts of Object
oriented, Functional and Logic Programming;
Algorithms for problem solving: Tree and
graph traversals, Connected components,
Spanning trees, Shortest paths; Hashing,
Sorting, Searching; Design techniques
(Greedy, Dynamic Programming,
Divide-and-conquer);
Compiler Design: Lexical analysis, Parsing,
Syntax directed translation, Runtime
environment, Code generation, Linking
(static and dynamic); Operating Systems:
Classical concepts (concurrency,
synchronization, deadlock), Processes,
threads and Inter-process communication, CPU
scheduling, Memory management, File systems,
I/O systems, Protection and security.
Databases: Relational model (ER-model,
relational algebra, tuple calculus),
Database design (integrity constraints,
normal forms), Query languages (SQL), File
structures (sequential files, indexing, B+
trees), Transactions and concurrency
control;
Computer Networks: ISO/OSI stack, sliding
window protocol, LAN Technologies (Ethernet,
Token ring), TCP/UDP, IP, Basic concepts of
switches, gateways, and routers.
-------------
For more papers visit:
http://onestopgate.com/gate-preparation// - http://onestopgate.com/gate-preparation//
|