M.SC .-Syllabus
M.SC .-Syllabus
M.SC .-Syllabus
L– P
3–0
Elementary set theory,Real number system and its order completeness, sequences and series
of real numbers. Metric spaces: Basic concepts, continuous functions, completeness,
contraction mapping theorem, connectedness, Intermediate Value Theorem, Compactness,
Heine-Borel Theorem. Differentiation, Taylor's theorem, Riemann Integral, Improper
integrals Sequences and series of functions, Uniform convergence, power series, Weierstrass
approximation theorem, equicontinuity, Arzela-Ascoli theorem.
L– P
3–0
Systems of linear equations, Matrices, Elementary row operations, Row-reduced echelon
matrices. Vector spaces, Subspaces, Bases and dimension, Ordered bases and coordinates.
Linear transformations, Rank-nullity theorem, Algebra of linear transformations,
Isomorphism, Matrix representation, Linear functional, Annihilator, Double dual, Transpose
of a linear transformation.
Characteristic values and characteristic vectors of linear transformations, Diagonalizability,
Minimal polynomial of a linear transformation, Cayley-Hamilton theorem, Invariant
subspaces, Direct-sum decompositions, Invariant direct sums, The primary decomposition
theorem, Cyclic subspaces and annihilators, Cyclic decomposition, Rational, Jordan forms.
Inner product spaces, Orthonormal bases, Gram-Schmidt process.
L– P
3–0
Review of fundamentals of ODEs, Existence and uniqueness theorems.
Series solution of differential equations, power series method, Bessel and Legendre
differential equations, complete solutions of Hermite, Gauss’s hypergeometric and
chebyshev’s differential equations, the generating functions and recurrence relations.
Eigen value problems and Sturm-Liouville problem, Stability of linear and nonlinear systems,
Nonlinear conservative systems, Liapunov’s direct method.
First-order linear and quasi-linear PDE’s, lagrange’smethod, Charpits' method, Cauchy
problem, Second order PDEs, Classification of PDE, Characteristics,Well-posed problems,
Solution of hyperbolic, Parabolic and elliptic equations, Dirichlet and Neumann problems,
Maximum principles.
L– P
3–0
Hyper plane and hyper spheres, Convex sets and their properties, Convex functions, Linear
Programming Problems; Formulation and examples, Basic feasible and optimal solutions,
Extreme points, Graphical Method, Simplex Method, Big-M Method, Degeneracy, Duality
and Dual LPP and its properties, Dual simplex Algorithm and sensitivity analysis.
Transportation problem, mathematical formulation, basic feasible solution, North-West
Corner Method, Least Cost Method, Vogel’s approximation Method, Optimal solution by U-
V Method, Stepping Stone Method, Degeneracy in Transportation problem.
Assignment problem, mathematical formulation, solution by Hungarian Method, unbalanced
problem, Traveling Sales man problem and its solution
Goal programming problem (GPP), mathematical formulation, Graphical goal attainment and
Simplex method for solution of GPP,
Game Theory, Two-Person Zero sum games, The Maximin-minimax principle, pure and
mixed strategies, graphical solution, Dominance property, General solution of mxn
rectangular games, Linear programming of GP
Network Analysis: PERT: Background, development, networking, estimating activity time,
Determination of earliest expected and allowable times, determination of critical path, PERT
cost, scheduling of a project, CPM method, Applications of these methods
Laboratory Work: Laboratory experiments of MTH-116 will be set in consonance with the
content of this course.
TEXT AND REFERENCE BOOKS
1. R. Lafore, Object oriented programming in C++, Pearson Education, 2008.
2. E. Balagurusamy, Object oriented programming with C++, Tata McGraw Hill, 2013.
3. B. Stroustrup, The C++ programming Language, Addison Wesley, 2013
4. G. Booch, Object Oriented Analysis and Design with Applications, Addison Wesley,
1993.
5. C.H. Pappas and W.H. Murray, The Complete Reference Visual C++6, Tata McGraw
Hill, 2011.
MTH-121: COMPLEX ANALYSIS
L– P
3–0
Complex numbers, the topology of the complex plane, the extended complex plane and its
representation using the sphere. Complex functions and their mapping properties, their limits,
continuity and differentiability, analytic functions, analytic branches of a multiple-valued
function. Complex integration, Cauchy's theorems, Cauchy's integral formulae. Power series,
Taylor's series, zeroes of analytic functions, Rouche's theorem, open mapping
theorem. Mobius transformations and their properties.
Isolated singularities and their classification, Laurent’s series, Cauchy’s residue theorem, the
argument principle
L– P
3–0
Groups, subgroups, normal subgroups, quotient groups, homomorphisms, cyclic groups,
permutation groups, Cayley’s theorem, class equations, Sylow theorems. Rings, ideals, prime
and maximal ideals, rings of fractions, Chinese Remainder Theorem for pairwise coaximal
ideals. Euclidean Domains, Principal Ideal Domains and Unique Factorizations Domains.
Polynomial rings over UFD's. Fields, Characteristic and prime subfields, Field extensions,
Finite,algebraic and finitely generated field extensions, Classical ruler and compass
constructions, Splitting fields and normal extensions, algebraic closures. Finite fields,
Cyclotomic fields, Separable and inseparable extensions.Galois groups, Fundamental
Theorem of Galois Theory, Composite extensions, Examples (including cyclotomic
extensions and extensions of finite fields). Solvability by radicals, Galois' Theorem on
solvability.Cyclic and abelian extensions, transcendental extensions.
L– P
3–0
Set Theory: Introduction to the theory of sets; combination of sets; power sets; finite and
infinite sets; principle of inclusion and exclusion; selected problems from each topic.
Logic: Proposition, predicate logic, logic operators, logic proposition and proof, method of
proofs.
Mathematical Induction: Different forms of the principle of mathematical induction. Selected
problems on mathematical induction.
Graph theory: Path, cycles, handshaking theorem, bipartite graphs, sub-graphs, graph
isomorphism, operations on graphs, Eulerian graphs and Hamiltonian graphs, planar graphs,
Euler formula, traveling salesman problem, shortest path algorithms.
Relations and function: Definitions and properties; pigeonhole principle, Equivalence
relations and equivalence classes. Representations of relations by binary matrices and
digraphs; operations on relations. Closure of a relation; reflexive, symmetric and transitive
closures. Warshall's algorithm to compute transitive closure of a relation, growth of function,
big O, hash function., discrete numeric functions; asymptotic behaviour; generating
functions.
Partially Ordered Sets and Lattices: Partial order relations, POSETS, lattices, isomorphism of
lattice
Boolean Algebra and Boolean Functions: Introduction to Boolean algebra and Boolean
functions. Different representations of Boolean functions. Application of Boolean functions
to synthesis of circuits, circuit minimization and simplification, Karnaugh map.
Recurrence Relations: Linear recurrence relations with constant coefficients (homogeneous
case); discussion of all the three sub-cases. Linear recurrence relations with constant
coefficients (non-homogeneous case); discussion of several special cases to obtain particular
solutions. Solution of linear recurrence relations using generating functions.
L– P
3–0
Introduction: Data types, data structures, abstract data types, the running time of a program,
the running time and storage cost of algorithms, complexity, asymptotic complexity,
obtaining the complexity of an algorithm.
Array, Stacks and Queues: Notations and Analysis, Storage structures for arrays - sparse
matrices - structures and arrays of structures, Stacks and Queues: Representations,
implementations and applications.
Linked Lists: Singly linked lists, stacks and queues using linked lists, operations on
Polynomials, Doubly Linked Lists, Circularly Linked Lists, dynamic storage management –
Garbage collection and compaction.
Trees: Basic terminology, General Trees, Binary Trees, Tree Traversing: in-order, pre-order
and post-order traversal, building a binary search tree, Operations on Binary Trees, Height
Balanced Trees(AVL), B-trees, B+ -trees.
Graphs: Basic definitions, representations of directed and undirected graphs, the single-
source shortest path problem, the all-pair shortest path problem, traversals of directed and
undirected graphs, directed acyclic graphs, strong components, minimum cost spanning tress,
articulation points and biconnected components, graph matching.
Sorting and Searching Techniques: Bubble sorting, Insertion sort, Selection sort, Shell sort,
Merge sort, Heap and Heap sort, Quick sort, Radix sort and Bucket sort, Sequential
searching, Binary Searching, Hash table methods.
1. J.P. Tremblay and P.G. Sorenson, “An Introduction to Data Structures with
applications”, Tata McGraw Hill.
2. S. Sahni, “Data structures, Algorithms ad Applications in C++”, WCB/McGraw Hill.
3. Aho Ullman and Hopcroft, “ Data Structures and Algorithms”.
4. Y. Langsam, M. J. Augenstein and A. M. Tenenbaum, “Data Structures using C”,
Pearson Education
5. Richard F. Gilberg, Behrouz A. Forouzan, “Data Structures – A Pseudocode
Approach with C”, Thomson Brooks / COLE