Syllabus of MSC Mathematics CUJ
Syllabus of MSC Mathematics CUJ
Syllabus of MSC Mathematics CUJ
FIRST SEMESTER
SECOND SEMESTER
Total Credits 24
THIRD SEMESTER
Total Credits 20
FOURTH SEMESTER
3 Elective – III 3 1 0 4
Total Credits 20
1 Discrete Mathematics 3 1 0 4
2 Optimization Techniques 3 1 0 4
3 Field Theory 3 1 0 4
4 Cryptography 3 1 0 4
8 Operator Theory 3 1 0 4
10 Statistics-II 3 1 0 4
11 Fluid Dynamics 3 1 0 4
12 Coding Theory 3 1 0 4
15 Operating System 3 1 0 4
16 Theory of Computations 3 1 0 4
17 Statistics - III 3 1 0 4
FIRST SEMESTER
Complex Analysis (3-1-0 4)
Basic algebraic properties of complex numbers, Exponential form, Roots of complex numbers.
Functions of a complex variable, mappings, Cauchy-Riemann equations, sufficient conditions
for differentiability, Analytic functions, Harmonic functions. Elementary functions: The
exponential, logarithm functions, branches and derivatives of logarithms. Complex exponents,
trigonometric, hyperbolic functions and their inverses.
Integrals: Complex integrals, Upper bounds for moduli of contour integrals, Cauchy’s theorem,
Cauchy’s integral formula, Liouvilles’ theorem and fundamental theorem of algebra, maximum
modulus principle. Series: Classification of singularities. Representations of holomorphic
functions in terms of power series, Meromorphic functions, zeros and poles, Laurent
expansions. Residues and Poles: poles and zeroes, Cauchy’s residue theorem, Residue at
infinity, Residue at poles. Evaluation of improper integrals and definite integrals using contour
integration. Argument principle and Rouche’s theorem. Mapping by Elementary functions:
Linear transformations, linear fractional transformations, other mappings by elementary
functions. Conformal mapping: Preservation of angles, transformations of harmonic functions
and boundary conditions. Applications of conformal mappings.
Texts/References
1. R. V. Churchill and J. W. Brown: Complex Variables and Applications, 8th edition, McGraw Hill, 2009.
2. L. Ahlfors: Complex Analysis: an Introduction to the Theory of Analytic Functions of One Complex
Variable, 3rd edition, Tata McGraw Hill, 1979.
3. E.T. Copson: Theory of Functions of a Complex Variable, Oxford University Press, 1970.
4. J.B. Conway: Functions of One Complex Variable, 2nd edition, Narosa, 1973.
5. D. Sarason: Complex Function Theory, 2nd edition, Hindustan Publishing Company, 2008.
6. M.J. Ablowitz: Complex Variables Introduction and Applications, 2nd edition, Cambridge University
Press, 2003.
7. S. Ponnusamy and H. Silverman: Complex Variables with Applications, Birkh¨auser, 2006.
Texts/References
M. Braun: Differential Equations and Their Applications, 3rd edition, Springer, 1983.
2. S. Padhy and J. Sinha Roy: A Course in Ordinary and Partial Differential Equations, 3rd
edition, Kalyani, 2003.
3. W. E. Boyce and R. C. DiPrima: Elementary Differential Equation, 8th edition, Wiley,
2005.
4. C. H. Edwards and D. E. Penney: Elementary Differential Equations, 6th edition,
Pearson, 2008.
5. J.R. Hanna and J.H. Rowland: Fourier series, Transforms, and Boundary Value
Problems, Wiley, 1990.
6. J.W. Brown and R.V. Churchill: Fourier Series and Boundary Value Problems, 7th
edition, McGraw Hill, 2008.
7. A. Vretblad: Fourier Analysis and its Applications, Springer, 2003.
8. E.A. Coddington and R. Carlson: Linear Ordinary Differential Equations, SIAM, 1997.
Texts/References
2. D.S. Dummit and R.M. Foote: Abstract Algebra, 3rd edition, Wiley, 2003.
3. O. Zariski and P. Samuel: Commutative Algebra I. Vol. 1, Springer, 1975.
nd
4. P. B. Bhattacharya, S. K. Jain, S. R. Nagpaul: Basic Abstract Algebra, 2 edition, Cambridge,
1995.
Texts/References
1. B.W. Kernighan, D.M. Ritchie: The C Programming Language, Prentice Hall India, 1990.
2. Y.P. Kanetkar: Let us C, BPB Publications, 2002.
3. E. Balagurusamy: Programming in ANSI C, 4th edition, Tata McGraw Hill.
Statistics- I
UNIT- I
Introduction to Probability: Concept of Random Experiment, Sample Space, Event, Definitions
of Probability, Conditional Probability, Independent events and Mutually exclusive events.
Addition and Multiplication Theorems, Bayes’ Theorem.
Random Variables and Probability Distributions: Concept of a random variable, Discrete and
Continuous Random Variables, Distribution Function, Probability Mass and Density Functions,
Mathematical Expectation, Moment Generating Function, Characteristic Function, Probability
Generating Function, Discrete and Continuous Probability Distributions such as Bernoulli,
Binomial, Negative Binomial, Geometric, Hyper-Geometric, Poisson, Multinomial, Uniform,
Exponential, Beta, Gamma and Normal.
UNIT- II
Joint Probability Distributions: Introduction, Joint Distribution for Two Dimensional Random
Variables, Marginal Distributions, Conditional Distributions, Covariance, Conditional
Expectation, Independence of Random Variables, Distribution of Sum of Two Independent
Random Variables.
Sampling Distributions: Sampling Distribution based on Normal Random Variables, t-
Distribution, Chi-Square Distribution, F- Distribution, Order Statistics and their Distributions,
Bivariate Normal Distribution, Multivariate Normal Distribution.
UNIT- III
Correlation and Regression Analysis: Introduction, Types of Correlation, Karl Pearson’s
Coefficient of Correlation, Spearman’s Rank Correlation, Multiple and Partial Correlation,
Linear Regression Model, Regression Coefficient and its Properties, Computation of
Regression Equation, Multiple Regression Analysis.
Stochastic Process: Introduction, Poisson Process, Birth and Death Process, Markov Chain,
Transition Probabilities, Classification of States, Stationary Process.
Texts/ References
1. S.M. Ross: Introduction to Probability and Statistics for Engineers and Scientists,
Academic Press, 4th Edition, 2010.
2. W.W. Hines, D.C. Montgomery, D.M. Goldsman, and C.M. Borror: Probability and
th
Statistics in Engineering, John Wiley and Sons, 4 Edition, 2007.
3. S.C. Gupta and V.K. Kapoor: Fundamentals of Mathematical Statistics, Sultan Chand and
Sons, 2007.
4. A.M. Goon, M.K. Gupta, B. Dasgupta: Fundamental of Statistics, Vol. I, II, World Press,
2001.
5. V.K. Rohatgi and A.K. Ehsanes Saleh: An Introduction to Probability and Statistics, John
Wiley and Sons, Inc. 2003.
6. G. Casella and R.L. Berger: Statistical Inference, Cengage Learning, 3rd Edition, 2008.
Unit II Topology.
Topological Spaces: Introduction, open set topology, Basis, Subbasis, closed sets and closure,
Order Topology, Product Topology, Subspace Topology, Quotient Topology, Metric Topology,
Continous functions, Homeomorphisms, Open and Closed Maps.
Connectedness and Compactness: Connected and Path Connected Spaces, Components and
Path Components, Local Connectedness, Compact Spaces, Local compact spaces, Heine
Borel Theorem, Tychonoff Theorem.
Countability and Seperation Axioms: Countability Axioms, Separation Axioms, Urysohn
Lemma, Urysohn Metrization Theorem, Tietze extension Theorem.
Texts/References
A Quick review of matrices : Algebra of matrices, determinants, rank and nullity of matrices,
system of linear equations, Symmetric, orthogonal and other special types of matrices,
eigenvalues and eigen vectors of matrices, minimal and char. polynomial of a matrix, similar
matrices, diagonalizable matrices.
Finite dimensional vector spaces over a field: Linear span, linear dependence and
independence, basis and dimension. Linear transformation and rank-nullity theorem . Matrix
representation of a Linear transformation. Matrix of Change of basis, algebra of linear
operators, eigenvalues and eigenvectors, minimal and char. polynomial of a linear operator,
Cayley-Hamilton theorem, transformation of linear operators to canonical forms: diagonal,
triangular and Jordan forms.
Texts/References
1. P. D. Lax: Linear Algebra and Its Applications, 2nd edition, Wiley, 2007.
2. R. A. Horn and C.R. Johnson: Matrix Analysis, Cambridge University Press, 1990.
3. K. Hoffman and R. Kunze: Linear Algebra, 2nd edition, Prentice Hall, 1971.
4. P. R. Halmos: Finite-dimensional Vector Spaces, Springer, 1974.
5. C.D. Meyer: Matrix Analysis and Applied Linear Algebra, SIAM, 2000.
6. S.L. Campbell and C.D. Meyer: Generalized Inverses of Linear Transformations, SIAM,
2008.
7. A. J. Laub: Matrix Analysis for Scientists and Engineers, SIAM, 2004.
8. H. Anton and C.Rorres: Elementary Linear Algebra, Wiley India Edition 2009.
9. V. Krishnamurthy, V.P Mainra and J.L Arora: An Introduction to Linear Algebra, East-
West Press, New Delhi 2011.
Texts/References
th
1. R. V. Churchill and J. W. Brown: Complex Variables and Applications, 8 edition, McGraw Hill,
2009.
2. L. Ahlfors: Complex Analysis: an Introduction to the Theory of Analytic Functions of
One Complex Variable, 3rd edition, Tata McGraw Hill, 1979.
3. E.T. Copson: Theory of Functions of a Complex Variable, Oxford University Press, 1970.
nd
4. J.B. Conway: Functions of One Complex Variable, 2 edition, Narosa, 1973.
nd
5. D. Sarason: Complex Function Theory, 2 edition, Hindustan Publishing Company, 2008.
6. M.J. Ablowitz: Complex Variables Introduction and Applications, 2nd edition, Cambridge
University Press, 2003.
7. S. Ponnusamy and H. Silverman: Complex Variables with Applications, Birkh¨auser, 2006.
Texts/References:
K. Atkinson: An Introduction to Numerical Analysis, 2nd edition, Wiley, 1989.
R.L. Burden, J.D. Faires: Numerical analysis, 7th edition, Brooks Cole, 2001.
Iserles: A first course in the numerical analysis of differential equations, Cambridge
University Press, 1996.
R. LeVeque: Finite Difference Methods for Ordinary and Partial Differential Equations
Steady-State and Time-Dependent Problems, SIAM, 2007.
L. N. Trefethen and D. Bau, III:Numerical Linear Algebra. Philadelphia, SIAM, 1997.
nd
G. Sewell: The Numerical Solution of Ordinary and Partial Differential Equations, 2 ed.,
Wiley, 2005.
J.M. Ortega: Numerical Analysis: A Second Course, SIAM, 1987.
E. Isaacson, H.B. Keller: Analysis of numerical methods, Dover, 1994.
Unit II
Texts/References
1. G.H. Hardy and E.M. Wright: An Introduction to The Theory of Numbers, 6th edition, Oxford
University Press, 2008.
2. D.M. Burton: Elementary Number Theory, 6th edition, McGraw-Hill, 2005.
3. I. Niven, H.S. Zuckerman and H.L. Montgomery: An Introduction to The Theory of Numbers,
5th edition, Wiley, 1991.
4. T. M. Apostol: Introduction to Analytic Number Theory, Springer- Verlag, 1976.
References:
1. Expert Data Structures with C by R.B. Patel; Khanna Publishers, New Delhi.
2. Algorithms + Data Structures = Programs by Niklaus Wirth; Prentice Hall, 1976.
3. Horowitz and Sahani: Fundamentals of Computer Algorithms.
4. T.H. Coremen, C.E. Leiserson, R.L. Rivest and C. Stein: Introduction to Algorithms, 20th
edition,
Prentice Hall India, 2010.
5. Shaum’s Outline Series by Lipschutz; McGraw Hill Education P Ltd , New Delhi.
Statistics- II
UNIT- I
Inequalities and Limit Theorems: Introduction, Markov’s Inequality, Chebyshev’s Inequality,
One-sided Chebyshev Inequality, Jensen’s Inequality, Random Sample, Modes of Convergence
of a sequence of random variables: Convergence in Distribution, Convergence in Probability,
Convergence Almost Sure; Weak Law of Large Numbers (WLLN), Strong Law of Large
Numbers (SLLN) and Central Limit Theorems (CLT).
UNIT- II
Theory of Estimation: Introduction, Point Estimation and Interval Estimation, Methods of
Estimation: Method of Maximum Likelihood, Method of Moments; Properties of Estimators:
Unbiasedness, Consistency, Efficiency, Sufficiency; Minimum Variance Unbiased Estimator
(MVUE), Cramer-Rao Inequality, Minimum Variance Bound (MVB) Estimator, Bayes Estimators.
Confidence Interval (CI) Estimation: Introduction, CI on Mean and Variance of a Normal
Distribution, CI on a Proportion, CI on the difference between Means for Paired Observations,
CI on the ratio of Variances of Two Normal Distributions, CI on the difference between Two
Proportions.
UNIT- III
Tests of Hypotheses: Introduction, Statistical Hypotheses, Type-I and Type-II Errors, One-
Sided and Two-Sided Hypotheses, Tests of Hypotheses on the Mean of a Normal Distribution;
Variance Known as well as Unknown Cases, Tests of Hypotheses on the Variance of a Normal
Distribution, Tests of Hypotheses on a Proportion, Tests of Hypotheses on the Means of Two
Normal Distributions; Variances Known as well as Unknown Cases, The Paired t-Test, Tests
for Equality of two Variances, Tests of Hypotheses on two Proportions, Testing for Goodness
of Fit, Contingency Table Tests, Neyman-Pearson Theory of Testing of Hypotheses, Uniformly
Most Powerful Tests, Likelihood Ratio Tests, Unbiased Tests.
Texts/ References
1. S.M. Ross: Introduction to Probability and Statistics for Engineers and Scientists,
Academic Press, 4th Edition, 2010.
2. W.W. Hines, D.C. Montgomery, D.M. Goldsman, and C.M. Borror: Probability and
th
Statistics in Engineering, John Wiley and Sons, 4 Edition, 2007.
3. S.C. Gupta and V.K. Kapoor: Fundamentals of Mathematical Statistics, Sultan Chand and
Sons, 2007.
4. A.M. Goon, M.K. Gupta, B. Dasgupta: Fundamental of Statistics, Vol. I, II, World Press,
2001.
5. V.K. Rohatgi and A.K. Ehsanes Saleh: An Introduction to Probability and Statistics, John
Wiley and Sons, Inc. 2003.
6. G. Casella and R.L. Berger: Statistical Inference, Cengage Learning, 3rd Edition, 2008.
SEMESTER III
Normed linear spaces: Finite dimensional normed spaces, Heine-Borel theorem, Riesz lemma,
Continuity of linear maps, Hahn-Banach extension theorem, Banach spaces, Dual spaces and
transposes, Uniform-boundedness principle and its applications; Spectrum of a bounded
operator.
Inner product spaces: Hilbert spaces, Orthonormal basis, Total Orthonormal Sets and
Sequences Projection theorem and Riesz representation theorem. Representation of
Functionals on Hilbert Spaces, Hilbert-Adjoint Operator, Self-Adjoint, Unitary and Normal
Operators, Open Mapping Theorem, Closed Graph Theorem.
Texts/References
Text/References:
Texts/References
Unit II
Mathematical Logic, Truth Table, Introduction to Lattice theory, Boolean algebra with
application to switching circuits.
Unit III
Introduction to Graph Theory, Basic terms of graph theory, handshaking theorem, Eulerian
Graph, Hamiltonian Graph, Planar Graph, Colouring of Graphs, Colouring problem, Five colour
Theorem.
Texts/References
Optimization Techniques
UNIT- I
Linear Programming: Introduction, Linear Programming Problem (LPP) and its formulation,
Graphical method for solving LPP, Basic Feasible Solution, Simplex Method, Big-M and Two-
phase methods, Degeneracy, Alternative Optimal Solution, Unbounded Solution, Infeasible
Solution, Dual Problem and Duality Theorems, Dual Simplex Method and its application in post
-optimality analysis.
UNIT- II
Transportation and Assignment Problems: Introduction, Transportation algorithm,
Mathematical formulation, Balanced and Unbalanced Transportation Problems, Vogel’s
approximation method for solving Transportation Problems, Hungarian method for solving
Assignment Problems.
UNIT- III
Queueing and Inventory Theory: Introduction, Queueing System, Elements of a Queueing
System, Operating Characteristics, Probability distributions in Queueing Systems, Elementary
Queueing and Inventory Models, Steady-state solutions of Markovian Queueing Models:
M/M/1, M/M/1 with limited waiting space, M/M/C, M/M/C with limited waiting space, M/G/1.
Texts/ References
1. E.K.P. Chong and S.H. Zak: An Introduction to Optimization, 2nd edition, Wiley, 2001.
2. D.G. Luenberger, Y. Ye: Linear and Nonlinear Programming, 3rd edition, Springer, 2008.
3. A.Ravindran, K.M. Ragsdell, G.V. Reklaitis: Engineering Optimization, 2nd edition, Wiley,
2006.
4. H.A. Taha: Operations Research: An Introduction, 8th edition, Prentice Hall, 2007.
5. K. Swarup, P.K. Gupta and M. Mohan: Operations Research, Sultan Chand and Sons,
2004.
Text/References
nd
1. P. B. Bhattacharya, S. K. Jain, S. R. Nagpaul: Basic Abstract Algebra, 2 edition, Cambridge,
1995.
2. M. Artin: Algebra, Prentice Hall India, 2009.
rd
3. S. Lang: Algebra, 3 edition, Springer, 2002.
nd
4. J. Rotman: Galois Theory, 2 edition, Springer, 2006.
5. P. Morandi: Field and Galois Theory, Springer, 2010.
6. I. S. Luthar and I. B. S. Passi: Algebra 4 - Field Theory, Narosa, 2004.
Cryptography (3-1-0 4)
Texts/References
J. A. Buchmann: Introduction to Cryptography, Springer, 2004.
N. Koblitz: A Course in Number Theory and Cryptography, Springer, 1994.
M. Welschenbach: Cryptography in C and C++, 2nd edition, Apress, 2002.
Unit 1: Data and Database Management System, the Database Life Cycle, the Relational Model.
ER Model: Entities, Relationship, Attributes, Degree of Relationship connectivity, attributes of a
relationship. Concepts of Generalization, Specialization & Aggregation. Concepts of FD.
Normalisation: 1NF, 2NF, 3NF & BCNF, lossless join, dependency preservation.
Denormalization.
Unit 2: Relational Algebra & Calculus. Transforming the Conceptual Data Model to SQL
Storage using RAID architecture. B-tree and B+-tree Index Files. Measures of Query Cost &
overview of query evaluation.
Unit 3: Transaction concept, Concurrency Control, Database Recovery.
Laboratory: Types of SQL commands: DDL, DML, DQL & DCL. Tables: create, alter, drop. View:
creating view, Data query and manipulation with view. Testing for NULL and when not to use
NULL. Aggregate Functions: Count(), SUM(), AVG(), MAX(), MIN(). Select Statement,
Subquaries, INSERT, UPDATE and DELETE operation. Joins: Natural join, Self join, outer join
and Cartesian product. Data security: GRANT and REVOKE.
Texts/References
T. J. Teorey et al.: Database Modelling and Design: Logical Design, 4th Edition, Morgan
Kaufmann, 2005.
th
A. Silberschatz, H. F. Korth and S. Sudarshan: – Database System Concepts, 6 edition,
McGraw Hill, 2010.
A. Leon, M. Leon: SQL A Complete Reference, McGraw Hill, 1999.
History of java, Features of java, JVM Architecture, Data Types, Operators, Arrays, Command
Line Arguments, OOPS in java, Abstract Classes, Interfaces, Packages, Access modifiers,
Access Specifiers, Exception Handling, Applet, Multithreading, Streams(File I/O), Introduction
to AWT, Introduction to Collection Framework (java.util.*), String Handling.
Lab: JAVA lab.
Text/References
1. H. Schildt: The complete Reference, 8th Edition, Tata McGraw Hill, 2011.
2. K. Sierra, B. Bates; SCJP Sun certified Programmer for java 6 study Guide, Tata McGraw
Hill, 2008.
3. E. Balagurusamy: Programming with java, 4th Edition Tata McGraw Hill 2009.
Basic concepts of fuzzy sets, fuzzy logic, operations on fuzzy sets, fuzzy relations,
equivalence and similarity relations, ordering, morphisms, fuzzy relation equations, fuzzy
measures, probability measures, possibility and necessity measures, measures of uncertainty,
dissonance, confusion and nonspecificity. Principles of uncertainty and information.
Applications of fuzzy sets in management, decision making, computer science and systems
science.
Texts/References:
T. J. Ross: Fuzzy Logic with Engineering Applications, 3rd edition, Wiley, 2010.
1. G. J. Klir and B. Yuan: Fuzzy Sets and Fuzzy Logic Theory and Applications,
Prentice Hall, 1995.
2. G. Chen and T. Pham: Introduction to Fuzzy Sets, Fuzzy Logic, and Fuzzy
Control Systems, CRC, 2000.
3. H. J. Zimmermann: Fuzzy Set Theory - and Its Applications, 2nd edition,
Springer, 1991.
Texts/References
1. B. Choudhary and S. Nanda: Functional Analysis with Applications, Wiley, 1989.
2. E. Kreyszig: Introductory Functional Analysis with Applications, Wiley, 1978.
3. N. Dunford and J. T. Schwartz: Linear Operators, Part I-III, Wiley, 2009.
4. G. Bachman and L. Narici: Functional analysis, AP, 1966.
SEMESTER IV
Partial Differential Equations (3-1-0 4)
Elliptic equations: Existence of weak solutions, The maximum principle, Green’s identities.
Texts/References
1. P.V. O’Neil: Beginning Partial Differential Equations, 2nd edition, Wiley, 2008.
2. Y. Pinchover and J. Rubinstein: An Introduction to Partial Differential Equations,
Cambridge University Press, 2005.
3. R. Haberman: Applied Partial Differential Equations with Fourier Series and Boundary
Value Problems, 4th edition, Pearson, 2004.
4. M. D. Raisinghania: Ordinary and Partial Differential Equations, 12th edition, S. Chand,
2010.
5. R. Agarwal and D. O'Regan: Ordinary and Partial Differential Equations. With Special
Functions, Fourier Series, Boundary Value Problems, Springer 2009.
6. L.C. Evans: Partial Differential Equations, AMS, 1998.
7. E. A. Coddington and N. Levinson: Theory of Ordinary Differential Equations, Tata
McGraw Hill, 1987.
rd th
Electives for 3 and 4 Semesters
Discrete Mathematics (3,1,0 4)
Unit I
Unit II
Mathematical Logic, Truth Table, Introduction to Lattice theory, Boolean algebra with
application to switching circuits.
Unit III
Introduction to Graph Theory, Basic terms of graph theory, handshaking theorem, Eulerian
Graph, Hamiltonian Graph, Planar Graph, Colouring of Graphs, Colouring problem, Five colour
Theorem.
Texts/References
Optimization Techniques
UNIT- I
Linear Programming: Introduction, Linear Programming Problem (LPP) and its formulation,
Graphical method for solving LPP, Basic Feasible Solution, Simplex Method, Big-M and Two-
phase methods, Degeneracy, Alternative Optimal Solution, Unbounded Solution, Infeasible
Solution, Dual Problem and Duality Theorems, Dual Simplex Method and its application in post
-optimality analysis.
UNIT- II
Transportation and Assignment Problems: Introduction, Transportation algorithm,
Mathematical formulation, Balanced and Unbalanced Transportation Problems, Vogel’s
approximation method for solving Transportation Problems, Hungarian method for solving
Assignment Problems.
UNIT- III
Queueing and Inventory Theory: Introduction, Queueing System, Elements of a Queueing
System, Operating Characteristics, Probability distributions in Queueing Systems, Elementary
Queueing and Inventory Models, Steady-state solutions of Markovian Queueing Models:
M/M/1, M/M/1 with limited waiting space, M/M/C, M/M/C with limited waiting space, M/G/1.
Texts/ References
1. E.K.P. Chong and S.H. Zak: An Introduction to Optimization, 2nd edition, Wiley, 2001.
2. D.G. Luenberger, Y. Ye: Linear and Nonlinear Programming, 3rd edition, Springer, 2008.
3. A.Ravindran, K.M. Ragsdell, G.V. Reklaitis: Engineering Optimization, 2nd edition, Wiley,
2006.
4. H.A. Taha: Operations Research: An Introduction, 8th edition, Prentice Hall, 2007.
5. K. Swarup, P.K. Gupta and M. Mohan: Operations Research, Sultan Chand and Sons,
2004.
Text/References
nd
1. P. B. Bhattacharya, S. K. Jain, S. R. Nagpaul: Basic Abstract Algebra, 2 edition, Cambridge,
1995.
2. M. Artin: Algebra, Prentice Hall India, 2009.
rd
3. S. Lang: Algebra, 3 edition, Springer, 2002.
nd
4. J. Rotman: Galois Theory, 2 edition, Springer, 2006.
5. P. Morandi: Field and Galois Theory, Springer, 2010.
6. I. S. Luthar and I. B. S. Passi: Algebra 4 - Field Theory, Narosa, 2004.
Cryptography (3-1-0 4)
Texts/References
1. J. A. Buchmann: Introduction to Cryptography, Springer, 2004.
2. N. Koblitz: A Course in Number Theory and Cryptography, Springer, 1994.
3. M. Welschenbach: Cryptography in C and C++, 2nd edition, Apress, 2002.
Unit 1: Data and Database Management System, the Database Life Cycle, the Relational Model.
ER Model: Entities, Relationship, Attributes, Degree of Relationship connectivity, attributes of a
relationship. Concepts of Generalization, Specialization & Aggregation. Concepts of FD.
Normalisation: 1NF, 2NF, 3NF & BCNF, lossless join, dependency preservation.
Denormalization.
Unit 2: Relational Algebra & Calculus. Transforming the Conceptual Data Model to SQL
Storage using RAID architecture. B-tree and B+-tree Index Files. Measures of Query Cost &
overview of query evaluation.
Unit 3: Transaction concept, Concurrency Control, Database Recovery.
Laboratory: Types of SQL commands: DDL, DML, DQL & DCL. Tables: create, alter, drop. View:
creating view, Data query and manipulation with view. Testing for NULL and when not to use
NULL. Aggregate Functions: Count(), SUM(), AVG(), MAX(), MIN(). Select Statement,
Subquaries, INSERT, UPDATE and DELETE operation. Joins: Natural join, Self join, outer join
and Cartesian product. Data security: GRANT and REVOKE.
Texts/References
1. T. J. Teorey et al.: Database Modelling and Design: Logical Design, 4th Edition,
Morgan Kaufmann, 2005.
th
2. A. Silberschatz, H. F. Korth and S. Sudarshan: – Database System Concepts, 6
edition, McGraw Hill, 2010.
3. A. Leon, M. Leon: SQL A Complete Reference, McGraw Hill, 1999.
History of java, Features of java, JVM Architecture, Data Types, Operators, Arrays, Command
Line Arguments, OOPS in java, Abstract Classes, Interfaces, Packages, Access modifiers,
Access Specifiers, Exception Handling, Applet, Multithreading, Streams(File I/O), Introduction
to AWT, Introduction to Collection Framework (java.util.*), String Handling.
Lab: JAVA lab.
Text/References
1. H. Schildt: The complete Reference, 8th Edition, Tata McGraw Hill, 2011.
2. K. Sierra, B. Bates; SCJP Sun certified Programmer for java 6 study Guide, Tata McGraw
Hill, 2008.
3. E. Balagurusamy: Programming with java, 4th Edition Tata McGraw Hill 2009.
Basic concepts of fuzzy sets, fuzzy logic, operations on fuzzy sets, fuzzy relations,
equivalence and similarity relations, ordering, morphisms, fuzzy relation equations, fuzzy
measures, probability measures, possibility and necessity measures, measures of uncertainty,
dissonance, confusion and nonspecificity. Principles of uncertainty and information.
Applications of fuzzy sets in management, decision making, computer science and systems
science.
Texts/References:
1. T. J. Ross: Fuzzy Logic with Engineering Applications, 3rd edition, Wiley, 2010.
2. G. J. Klir and B. Yuan: Fuzzy Sets and Fuzzy Logic Theory and Applications,
Prentice Hall, 1995.
3. G. Chen and T. Pham: Introduction to Fuzzy Sets, Fuzzy Logic, and Fuzzy
Control Systems, CRC, 2000.
4. H. J. Zimmermann: Fuzzy Set Theory - and Its Applications, 2nd edition,
Springer, 1991.
Texts/References
1. B. Choudhary and S. Nanda: Functional Analysis with Applications, Wiley, 1989.
2. E. Kreyszig: Introductory Functional Analysis with Applications, Wiley, 1978.
3. N. Dunford and J. T. Schwartz: Linear Operators, Part I-III, Wiley, 2009.
4. G. Bachman and L. Narici: Functional analysis, AP, 1966.
Lagrangian and Eularian description, stream lines, path lines, streak lines, vortex lines, vorticity
vector, equation of continuity, circulation, rotational and irrotational flows, boundary surface.
General equations of motion, Bernoulli’s theorem ( Compressible , incompressible flows)
Kelvin’s theorem (constancy of circulation). Stream function, complex potential, sources, sinks
and dublets, Circle theorem, Method of images. Theorem of Blasius. Viscuss flows- stress
analysis in fluid motion, relations between stress and rate of strain. Stoke’s stream function,
Spherical Harmonics and motion of a Sphere. Helmholtz’s vorticity equation (permanence of
vorticity) Vortx filaments, vortex pair. Navier-Stoke’s equations. Dissipation of energy.
Diffusion of vorticity, Steady flow between two infinite parallel plates, through a circular pipe
(Hagen Poiseuille flow).
Text/References
R.W. Fox et.al. Introduction to Fluid Mechanics, 7th edition, Wiley, 2009.
B.R. Munson et.al. Fundamentals of Fluid Mechanics, 6th edition, Wiley, 2009.
A.K. Mohanty: Fluid Mechanics, 2nd edition, PHI, 2009.
M.D. Raisinghania: Fluid Dynamics, 9th edition, S. Chand, 2010.
F. Durst, Fluid Mechanics: An introduction to the Theory of Fluid Flows, Springer, 2008.
Texts/References
W.C. Huffman and V. Pless: Fundamentals of Error-correcting Codes, Cambridge
University Press, 2003.
S. Ling and C. Xing: Coding Theory - A First Course, Cambridge University Press, 2004.
E. R. Berlekamp: Algebraic Coding Theory, Aegean Park Press, 1984.
rd
J. H. Van Lint: Introduction to Coding Theory, 3 edition, Springer, 1999.
R. Roth: Introduction to Coding Theory, Cambridge University Press, 2006.
S. Roman: Introduction to Coding and Information Theory, Springer-Verlag, 1997.
Harry Pollard, Harold G. Diamond: The Theory of Algebraic Numbers, 3rd edition, Dover,
2010.
S. Alaca, K. S. Williams: Introductory Algebraic Number Theory, CUP, 2003.
E. Weiss: Algebraic Number Theory, Dover, 1998.
I. Stewart, D. Tall: Algebraic Number Theory and Fermat’s Last Theorem, 3rd edition, A K
Peters/CRC Press, 2001.
nd
G. J. Janusz: Algebraic Number Fields, 2 edition, 1996.
Artificial Intelligent and Hybrid Systems ( 3-1-0 4 )
Text/References
rd
1. A. S. Tanenbaum: Operating System Design and Implementation, 3 edition, Phi Learning,
2009.
2. A. Silberschatz, G. Gagne and P.B. Galvin: Operating System Concepts, Wiley, 2009.
3. D. M. Dhamdhere: Operating Systems - A Concept Based Approach, 3rd edition, 2012.
4. W. Stallings: Operating Systems: Internals and Design Principles, 6th edition, Pearson
Education, 2009.
5. S. Das: Unix Concept and Application, Tata McGraw-Hill, 2006.
Texts/References
K.L.P. Mishra and N. Chandrasekharan: Theory of Computer Science: Automata
Language and Computation, Prentice Hall of India, 3rd edition, 2007.
nd
P. Linz: Introduction to Formal Language and Computation, Narosa, 2 edition, 2006.
Statistics III
Sampling Theory: Introduction, Concept of Population and Sample, Primary and Secondary
data, Methods of Collecting Primary data, Sampling frame, Sampling design, Determination of
sample size, Census and Sample Surveys, Sampling and Non-sampling errors, Simple Random
Sampling, Stratified Sampling, Systematic Sampling, Probability Proportional to Size (PPS)
Sampling, Ratio and Regression Methods of Estimation.
Design and Analysis of Experiments: Introduction, Analysis of Variance (ANOVA) and Analysis
of Covariance (ANCOVA), Fixed, Random and Mixed effects Models, ANOVA for one-way and
two-way Classified Data, Basic principles of Design of Experiments, Completely Randomized
Design (CRD), Randomized Block Design (RBD) and Latin Square Design (LSD), Factorial
Experiments, Confounding in symmetrical factorial experiments (2n series), Connectedness
and Orthogonality of Block Designs, Balanced Incomplete Block Design (BIBD).
Texts/ References
1. W. G. Cochran: Sampling Techniques, John Wiley and Sons, 3rd Edition, 1977.
4. D. C. Montgomery: Design and Analysis of Experiments, John Wiley and Sons, 8th Edition,
2013.
5. S.C. Gupta and V.K. Kapoor: Fundamentals of Applied Statistics, Sultan Chand and
Sons, 1994.
nd
6. M.N. Das and N.C. Giri: Design and Analysis of Experiments, New Age Publication, 2
Edition, 1986.
Discrete Dynamical Systems: Discrete and continuous dynamical systems, One and two
dimensional maps as discrete dynamical systems, Fixed points, periodic points and
stability, Chaos, Lyapunov exponents and chaotic attractors, Differential equations as
continuous dynamical systems, Periodic orbits and limit sets, Bifurcations.
Text/References
1. S. Goldberg: Introduction to difference Equations, Dover, 1986.
2. K.T. Alligood, T.D. Sauer and J.A. Yorke: An Introduction to Dynamical Systems, Springer,
1997.
3. E. Ott: Chaos in Dynamical Systems, Cambridge University Press, 2nd edition 2002.
4. S.H. Strogatz: Nonlinear Dynamics and Chaos - With Applications to Physics, Biology,
Chemistry and Engineering, Westview Press, 2000.
5. S. Elaydi: An Introduction to Difference Equations, Springer, 1995.
6. W.G. Kelley and A.C. Peterson: Difference Equations - An Introduction with Applications,
nd
2 edition, AP, 2001.
Texts/References:
5. K. Atkinson: An Introduction to Numerical Analysis, 2nd edition, Wiley, 1989.
6. R.L. Burden, J.D. Faires: Numerical analysis, 7th edition, Brooks Cole, 2001.
7. A. Iserles: A first course in the numerical analysis of differential equations,
Cambridge University Press, 1996.
8. R. LeVeque: Finite Difference Methods for Ordinary and Partial Differential
Equations Steady-State and Time-Dependent Problems, SIAM, 2007.
9. L. N. Trefethen and D. Bau, III:Numerical Linear Algebra. Philadelphia, SIAM, 1997.
10. G. Sewell: The Numerical Solution of Ordinary and Partial Differential Equations, 2nd
ed., Wiley, 2005.
11. J.M. Ortega: Numerical Analysis: A Second Course, SIAM, 1987.
12. E. Isaacson, H.B. Keller: Analysis of numerical methods, Dover, 1994.
13. Timothy A. Davis, Direct Methods for Sparse Linear Systems, Society for Industrial
and Applied Mathematics, Philadelphia, PA, USA, 2006, ISBN 0-89871-613-6,
xii+217pp.
14. James W. Demmel, Applied Numerical Linear Algebra, Society for Industrial and
Applied Mathematics, Philadelphia, PA, USA, 1997, ISBN 0-89871-389-7, xi+419pp.
15. Gene H. Golub and Charles F. Van~Loan, Matrix Computations Johns Hopkins
University Press, Baltimore, MD, USA, third edition, 1996, ISBN 0-8018-5413-X
(hardback), 0-8018-5414-8 (paperback), xxvii+694pp.
16. Desmond J. Higham and Nicholas J. Higham, MATLAB Guide, Society for Industrial
and Applied Mathematics, Philadelphia, PA, USA, second edition, 2005, ISBN 0-
89871-578-4, xxiii+382pp.
17. Nicholas J. Higham, Accuracy and Stability of Numerical Algorithms, Society for
Industrial and Applied Mathematics, Philadelphia, PA, USA, second edition, 2002,
ISBN 0-89871-521-0, xxx+680pp.
18. G. W. Stewart, Introduction to Matrix Computations, Academic Press, New York,
1973, ISBN 0-12-670350-7, xiii+441pp.
19. G. W. Stewart, Matrix Algorithms, Volume I: Basic Decompositions, Society for
Industrial and Applied Mathematics, Philadelphia, PA, USA, 1998, ISBN 0-89871-414-
1, xx+458pp.
20. G. W. Stewart, Matrix Algorithms, Volume II: Eigensystems, Society for Industrial
and Applied Mathematics, Philadelphia, PA, USA, 2001, ISBN 0-89871-503-2,
xix+469pp.
21. Lloyd N. Trefethen and David Bau III, Numerical Linear Algebra, Society for Industrial
and Applied Mathematics, Philadelphia, PA, USA, 1997, ISBN 0-89871-361-7,
xii+361pp.
22. David S. Watkins, Fundamentals of Matrix Computations, Wiley, New York, second
edition, 2002, ISBN 0-471-21394-2, xiii+618pp.
23. Per Christian Hansen, James G. Nagy, and Dianne P. O'Leary, Deblurring Images:
Matrices, Spectra, and Filtering, Society for Industrial and Applied Mathematics,
Philadelphia, PA, USA, 2006, ISBN 0-89871-618-7, xiv+130pp.
24. C. T. Kelley, Iterative Methods for Linear and Nonlinear Equations, Society for
Industrial and Applied Mathematics, Philadelphia, PA, USA, 1995, ISBN 0-89871-352-
8, xiii+165pp.
25. Amy N. Langville and Carl D. Meyer, Google's PageRank and Beyond: The Science of
Search Engine Rankings, Princeton University Press, Princeton, NJ, USA, 2006, ISBN
0-691-12202-4, x+224 pp.