You are on page 1of 3


Mathematical Logic: Propositional Logic; First Order Logic.

Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation;
Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomia
Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattic
e; Boolean Algebra.
Combinatorics: Permutations; Combinations; Counting; Summation; generating funct
ions; recurrence relations; asymptotics.
Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matc
hing; 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 s
olutions of non linear algebraic equations by Secant, Bisection and Newton-Raphs
on Methods; Numerical integration by trapezoidal and Simpson's rules.
Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems o
f integral calculus, evaluation of definite & improper integrals, Partial deriva
tives, Total derivatives, maxima & minima.
Regular Languages: finite automata, regular expressions, regular grammar.
Context free languages: push down automata, context free grammars
Digital Logic: Logic functions, minimization, design and synthesis of combinator
ial and sequential circuits, number representation and computer arithmetic (fixe
d and floating point)
Computer organization: Machine instructions and addressing modes, ALU and data p
ath, hardwired and microprogrammed control, memory interface, I/O interface (int
errupt and DMA mode), serial communication interface, instruction pipelining, ca
che, main and secondary storage
Data structures and Algorithms: the notion of abstract data types, stack, queue,
list, set, string, tree, binary search tree, heap, graph, tree and graph traver
sals, connected components, spanning trees, shortest paths, hashing, sorting, se
arching, design techniques (greedy, dynamic, divide and conquer), asymptotic ana
lysis (best, worst, average cases) of time and space, upper and lower bounds, in
Programming Methodology: C programming, program control (iteration, recursion, f
unctions), scope, binding, parameter passing, elementary concepts of object orie
nted programming
Operating Systems (in the context of Unix): classical concepts (concurrency, syn
chronization, deadlock), processes, threads and interprocess communication, CPU
scheduling, memory management, file systems, I/O systems, protection and securit
Information Systems and Software Engineering: information gathering, requirement
and feasibility analysis, data flow diagrams, process specifications, input/out
put design, process life cycle, planning and managing the project, design, codin
g, testing, implementation, maintenance.
Databases: relational model, database design, integrity constraints, normal form
s, query languages (SQL), file structures (sequential, indexed), b-trees, transa
ction and concurrency control
Data Communication: data encoding and transmission, data link control, multiplex
ing, packet switching, LAN architecture, LAN systems (Ethernet, token ring), Net
work devices: switches, gateways, routers
Networks: ISO/OSI stack, sliding window protocols, routing protocols, TCP/UDP, a
pplication layer protocols & systems (http, smtp, dns, ftp), network security
Web technologies: three tier web based architecture; JSP, ASP, J2EE, .NET system
s; html, XML
Linear Algebra: Finite dimensional vector spaces. Linear transformations and the
ir matrix representations, rank; systems of linear equations, eigenvalues and ei
genvectors, minimal polynomial, Cayley-Hamilton theorem, diagonalisation, Hermit
ian, Skew-Hermitian and unitary matrices. Finite dimensional inner product space
s, self-adjoint and Normal linear operators, spectral theorem, Quadratic forms.
Complex Analysis: Analytic functions, conformal mappings, bilinear transformatio
ns, complex integration: Cauchy's integral theorem and formula, Liouville's theo
rem, maximum modulus principle, Taylor and Laurent's series, residue theorem and
applications for evaluating real integrals.
Real Analysis: Sequences and series of functions, uniform convergence, power ser
ies, Fourier series, functions of several variables, maxima, minima, multiple in
tegrals, line, surface and volume integrals, theorems of Green, Stokes and Gauss
; metric spaces, completeness, Weierstrass approximation theorem, compactness. L
ebesgue measure, measurable functions; Lebesgue integral, Fatou's lemma, dominat
ed convergence theorem.
Ordinary Differential Equations: First order ordinary differential equations, ex
istence and uniqueness theorems, systems of linear first order ordinary differen
tial equations, linear ordinary differential equations of higher order with cons
tant coefficients; linear second order ordinary differential equations with vari
able coefficients, method of Laplace transforms for solving ordinary differentia
l equations, series solutions; Legendre and Bessel functions and their orthogona
lity, Sturm Liouville system, Greeen's functions.
Algebra: Normal subgroups and homomorphisms theorems, automorphisms. Group actio
ns, sylow's theorems and their applications groups of order less than or equal t
o 20, Finite p-groups. Euclidean domains, Principal ideal domains and unique fac
torizations domains. Prime ideals and maximal ideals in commutative rings.
Functional Analysis: Banach spaces, Hahn-Banach theorems, open mapping and close
d graph theorems, principle of uniform boundedness; Hilbert spaces, orthonormal
sets, Riesz representation theorem, self-adjoint, unitary and normal linear oper
ators on Hilbert Spaces.
Numerical Analysis: Numerical solution of algebraic and transcendental equations
; bisection, secant method, Newton-Raphson method, fixed point iteration, interp
olation: existence and error of polynomial interpolation, Lagrange, Newton, Herm
ite(osculatory)interpolations; numerical differentiation and integration, Trapez
oidal and Simpson rules; Gaussian quadrature; (Gauss-Legendre and Gauss-Chebyshe
v), method of undetermined parameters, least square and orthonormal polynomial a
pproximation; numerical solution of systems of linear equations: direct and iter
ative methods, (Jacobi Gauss-Seidel and SOR) with convergence; matrix eigenvalue
problems: Jacobi and Given's methods, numerical solution of ordinary differenti
al equations: initial value problems, Taylor series method, Runge-Kutta methods,
predictor-corrector methods; convergence and stability.
Partial Differential Equations: Linear and quasilinear first order partial diffe
rential equations, method of characteristics; second order linear equations in t
wo variables and their classification; Cauchy, Dirichlet and Neumann problems, G
reen's functions; solutions of Laplace, wave and diffusion equations in two vari
ables Fourier series and transform methods of solutions of the above equations a
nd applications to physical problems.
Mechanics: Forces in three dimensions, Poinsot central axis, virtual work, Lagra
nge's equations for holonomic systems, theory of small oscillations, Hamiltonian
Topology: Basic concepts of topology, product topology, connectedness, compactne
ss, countability and separation axioms, Urysohn's Lemma, Tietze extension theore
m, metrization theorems, Tychonoff theorem on compactness of product spaces.
Probability and Statistics: Probability space, conditional probability, Bayes' t
heorem, independence, Random variables, joint and conditional distributions, sta
ndard probability distributions and their properties, expectation, conditional e
xpectation, moments. Weak and strong law of large numbers, central limit theorem
. Sampling distributions, UMVU estimators, sufficiency and consistency, maximum
likelihood estimators. Testing of hypotheses, Neyman-Pearson tests, monotone lik
elihood ratio, likelihood ratio tests, standard parametric tests based on normal
, X2 ,t, F-distributions. Linear regression and test for linearity of regression
. Interval estimation.
Linear Programming: Linear programming problem and its formulation, convex sets
their properties, graphical method, basic feasible solution, simplex method, big
-M and two phase methods, infeasible and unbounded LPP's, alternate optima. Dual
problem and duality theorems, dual simplex method and its application in post o
ptimality analysis, interpretation of dual variables. Balanced and unbalanced tr
ansportation problems, unimodular property and u-v method for solving transporta
tion problems. Hungarian method for solving assignment problems.
Calculus of Variations and Integral Equations: Variational problems with fixed b
oundaries; sufficient conditions for extremum, Linear integral equations of Fred
holm and Volterra type, their iterative solutions. Fredholm alternative.