ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY

Guwahati

Course Structure and Syllabus

B.Sc. MATHEMATICS (HONOURS)

Under CBCS

(From Academic Session 2018-19 onwards)

6th Semester
ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY
Course Structure and Syllabus
(From Academic Session 2018-19 onwards)

6th Semester B.Sc. Mathematics (HONOURS)

Course Structure:

Hours Per Credit

Theory/ Sl. Marks
Sub Code Subject week
Practical No
L T P C
CORE (For Mathematics honours) CE ESE
Metric Spaces and 5 1 0 6 30 70
1 BMA181C601
Theory Complex Analysis
Ring Theory and Linear 5 1 0 6 30 70
2 BMA181C602
Algebra-II
DSE-3 (Any one paper) Discipline Specific Elective-III
Theory 1 BMA181DE3603 Theory of Equations 5 1 0 6 30 70

2 BMA181DE3604 Bio Mathematics 5 1 0 6 30 70

3 BMA181DE3605 Linear Programming 5 1 0 6 30 70

DSE-4 (Any one paper) Discipline Specific Elective-IV

1 BMA181DE4606 Industrial Mathematics 5 1 0 6 30 70
Theory 2 BMA181DE4607 Mechanics 5 1 0 6 30 70
3 BMA181DE4608 Graph Theory 5 1 0 6 30 70
Total 20 4 0 24 120 280
Total contact hours per week: 24
Total Credit : 24

NB: Optional Dissertation or Project Work (BMA181621) may be done in place of one
Discipline Specific Elective paper

Assam Science and Technology University Page 1 of 9

Detailed Syllabus:
Course Code Course Title Hours per week Credit
L-T-P C
BMA181C601 Metric Spaces and Complex Analysis 5-1-0 6

MODULE 1: (15 Lectures)

Metric spaces: definition and examples. Sequences in metric spaces, Cauchy sequences.
Complete Metric Spaces. Open and closed balls, neighbourhood, open set, interior of a set.
Limit point of a set, closed set, diameter of a set, Cantor’s theorem. Subspaces, dense sets,
separable spaces.

MODULE 2: (10 Lectures)

Continuous mappings, sequential criterion and other characterizations of continuity. Uniform
continuity. Homeomorphism, Contraction mappings, Banach Fixed point Theorem.
Connectedness, connected subsets of R.

MODULE 3: (15 Lectures)

Limits, Limits involving the point at infinity, continuity. Properties of complex numbers,
regions in the complex plane, functions of complex variable, mappings. Derivatives,
differentiation formulas, Cauchy-Riemann equations, sufficient conditions for differentiability.

MODULE 4: (15 Lectures)

Analytic functions, examples of analytic functions, exponential function, Logarithmic
function, trigonometric function, derivatives of functions, definite integrals of functions.
Contours, Contour integrals and its examples, upper bounds for moduli of contour integrals.
Cauchy-Goursat theorem, Cauchy integral formula.

MODULE 5: (8 Lectures)
Liouville’s theorem and the fundamental theorem of algebra. Convergence of sequences and
series, Taylor series and its examples.

MODULE 6: (7 Lectures)
Laurent series and its examples, absolute and uniform convergence of power series.

Text Books/ Reference Books:

1. Satish Shirali and Harikishan L. Vasudeva, Metric Spaces, Springer Verlag, London, 2006.
2. S. Kumaresan, Topology of Metric Spaces, 2nd Ed., Narosa Publishing House, 2011.
3. G.F. Simmons, Introduction to Topology and Modern Analysis, McGraw-Hill, 2004.
4. James Ward Brown and Ruel V. Churchill, Complex Variables and Applications, 8th Ed.,
McGraw – Hill International Edition, 2009.
5. Joseph Bak and Donald J. Newman, Complex Analysis, 2nd Ed., Undergraduate Texts in
Mathematics, Springer-Verlag New York, Inc., NewYork, 1997.

Assam Science and Technology University Page 2 of 9

Course Code Course Title Hours per week Credit
L-T-P C
BMA181C602 Ring Theory and Linear Algebra-II 5-1-0 6

MODULE 1: (25 Lectures)

Polynomial rings over commutative rings, division algorithm and consequences, principal ideal
domains, factorization of polynomials, reducibility tests, irreducibility tests, Eisenstein
criterion, unique factorization in Z[x]. Divisibility in integral domains, irreducibles, primes,
unique factorization domains, Euclidean domains.

MODULE 2: (20 Lectures)

Dual spaces, dual basis, double dual, transpose of a linear transformation and its matrix in the
dual basis, annihilators, Eigen spaces of a linear operator, diagonalizability, invariant subspaces
and Cayley-Hamilton theorem, the minimal polynomial for a linear operator.

MODULE 3: (25 Lectures)

Inner product spaces and norms, Gram-Schmidt orthogonalisation process, orthogonal
complements, Bessel’s inequality, the adjoint of a linear operator. Normal and self-adjoint
operators, Orthogonal projections and Spectral theorem.

Text Books/ Reference Books:

1. John B. Fraleigh, A First Course in Abstract Algebra, 7th Ed., Pearson, 2002.
2. M. Artin, Abstract Algebra, 2nd Ed., Pearson, 2011.
3. Joseph A. Gallian, Contemporary Abstract Algebra, 4th Ed., Narosa Publishing House,
1999.
4. Stephen H. Friedberg, Arnold J. Insel, Lawrence E. Spence, Linear Algebra, 4th Ed.,
Prentice-Hall of India Pvt. Ltd., New Delhi, 2004.
5. S. Lang, Introduction to Linear Algebra, 2nd Ed., Springer, 2005.
6. Gilbert Strang, Linear Algebra and its Applications, Thomson, 2007.
7. S. Kumaresan, Linear Algebra- A Geometric Approach, Prentice Hall of India, 1999.
8. Kenneth Hoffman, Ray Alden Kunze, Linear Algebra, 2nd Ed., Prentice-Hall of India
Pvt.Ltd., 1971.
9. S.H. Friedberg, A.L. Insel and L.E. Spence, Linear Algebra, Prentice Hall of India Pvt.
Ltd.,2004.

Assam Science and Technology University Page 3 of 9

Course Code Course Title Hours per week Credit
L-T-P C
BMA181DE3603 Theory of Equations 5-1-0 6

MODULE 1: (20 Lectures)

General properties of polynomials, Graphical representation of a polynomial, maximum and
minimum values of a polynomials, General properties of equations, Descarte’s rule of signs
positive and negative rule, Relation between the roots and the coefficients of equations.

MODULE 2: (20 Lectures)

Symmetric functions, Applications of symmetric function of the roots, Transformation of
equations. Solutions of reciprocal and binomial equations. Algebraic solutions of the cubic and
biquadratic. Properties of the derived functions.

MODULE 3: (15 Lectures)

Symmetric functions of the roots, Newton’s theorem on the sums of powers of roots,
homogeneous products, limits of the roots of equations.

MODULE 4: (15 Lectures)

Separation of the roots of equations, Strums theorem, Applications of Strum’s theorem,
Conditions for reality of the roots of an equation and biquadratic. Solution of numerical
equations

Text Books/ Reference Books:

1.W.S. Burnside and A.W. Panton, The Theory of Equations, Dublin University Press, 1954.
2. C. C. MacDuffee, Theory of Equations, John Wiley & Sons Inc., 1954.

Assam Science and Technology University Page 4 of 9

Course Code Course Title Hours per week Credit
L-T-P C
BMA181DE3604 Bio Mathematics 5-1-0 6

Mathematical Biology and the modeling process: an overview. Continuous models: Malthus
model, logistic growth, Allee effect, Gompertz growth, Michaelis-Menten Kinetics, Holling
type growth, Bacterial growth in a Chemostat, Harvesting a single natural population, Prey
predator systems and Lotka Volterra equations, Populations in competitions, Epidemic Models
(SI, SIR,SIRS, SIC), Activator-Inhibitor system, Insect Outbreak Model: Spruce Budworm,
Numerical solution of the models and its graphical representation. Qualitative analysis of
continuous models: Steady state solutions, stability and linearization, multiple species
communities and Routh-Hurwitz Criteria, Phase plane methods and qualitative solutions,
bifurcations and limit cycles with examples in the context of biological scenario. Spatial
Models: One species model with diffusion, Two species model with diffusion, Conditions for
diffusive instability, Spreading colonies of microorganisms, Blood flow in circulatory system,
Travelling wave solutions, Spread of genes in a population. Discrete Models: Overview of
difference equations, steady state solution and linear stability analysis, Introduction to Discrete
Models, Linear Models, Growth models, Decay models, Drug Delivery Problem, Discrete
Prey-Predator models, Density dependent growth models with harvesting, Host-Parasitoid
systems (Nicholson-Bailey model), Numerical solution of the models and its graphical
representation. Case Studies: Optimal Exploitation models, Models in Genetics, Stage
Structure Models, Age Structure Models
Books Recommended
1. L.E. Keshet, Mathematical Models in Biology, SIAM, 1988.

2. J. D. Murray, Mathematical Biology, Springer, 1993.

3. Y.C. Fung, Biomechanics, Springer-Verlag, 1990.

4. F. Brauer, P.V.D. Driessche and J. Wu, Mathematical Epidemiology, Springer, 2008.

5. M. Kot, Elements of Mathematical Ecology, Cambridge University Press, 2001.

Assam Science and Technology University Page 5 of 9

Course Code Course Title Hours per week Credit
L-T-P C
BMA181DE3605 Linear Programming 5-1-0 6

MODULE 1: (15 Lectures)

Introduction to linear programming problem, Theory of simplex method, optimality and
unboundedness, the simplex algorithm, simplex method in tableau format, introduction to
artificial variables, two‐phase method, Big‐M method and their comparison

MODULE 2: (15 Lectures)

Duality, formulation of the dual problem, primal‐dual relationships, economic interpretation of
the dual.

MODULE 3: (25 Lectures)

Transportation problem and its mathematical formulation, northwest‐corner method least cost
method and Vogel approximation method for determination of starting basic solution,
algorithm for solving transportation problem, assignment problem and its mathematical
formulation, Hungarian method for solving assignment problem.
MODULE 4: (15 Lectures)
Game theory: formulation of two person zero sum games, solving two person zero sum games,
games with mixed strategies, graphical solution procedure, linear programming solution of
games.

Text Books/ Reference Books:

1. Mokhtar S. Bazaraa, John J. Jarvis and Hanif D. Sherali, Linear Programming and
NetworkFlows, 2nd Ed., John Wiley and Sons, India, 2004.
2. F.S. Hillier and G.J. Lieberman, Introduction to Operations Research, 9th Ed., Tata
McGrawHill, Singapore, 2009.
3. Hamdy A. Taha, Operations Research, An Introduction, 8th Ed., Prentice-Hall India, 2006.
4. G. Hadley, Linear Programming, Narosa Publishing House, New Delhi, 2002.

Assam Science and Technology University Page 6 of 9

Course Code Course Title Hours per week Credit
L-T-P C
BMA181DE4606 Industrial Mathematics 5-1-0 6

MODULE 1: (15 Lectures)

Medical Imaging and Inverse Problems. The content is based on Mathematics of X-ray and CT
scan based on the knowledge of calculus, elementary differential equations, complex numbers
and matrices.

MODULE 2: (20 Lectures)

Introduction to Inverse problems: Why should we teach Inverse Problems? Illustration of
Inverse problems through problems taught in Pre-Calculus, Calculus, Matrices and differential
equations. Geological anomalies in Earth’s interior from measurements at its surface (Inverse
problems for Natural disaster) and Tomography.

MODULE 3: (10 Lectures)

X-ray: Introduction, X-ray behavior and Beers Law (The fundament question of image
construction) Lines in the place.

MODULE 4: (10 Lectures)

Radon Transform: Definition and Examples, Linearity, Phantom (Shepp - Logan Phantom -
Mathematical phantoms).
Back Projection: Definition, properties and examples.

MODULE 5: (15 Lectures)

CT Scan: Revision of properties of Fourier and inverse Fourier transforms and applications of
their properties in image reconstruction. Algorithms of CT scan machine. Algebraic
reconstruction techniques abbreviated as ART with application to CT scan.

Text Books/ Reference Books:

1. Timothy G. Feeman, The Mathematics of Medical Imaging, A Beginners Guide, Springer

Under graduate Text in Mathematics and Technology, Springer, 2010.
2. C.W. Groetsch, Inverse Problems, Activities for Undergraduates, The Mathematical
Association of America, 1999.
3. Andreas Kirsch, An Introduction to the Mathematical Theory of Inverse Problems, 2nd
Ed.,Springer, 2011.

Assam Science and Technology University Page 7 of 9

Course Code Course Title Hours per week Credit
L-T-P C
BMA181DE4607 Mechanics 5-1-0 6

MODULE 1: (20 Lectures)

Moment of a force about a point and an axis, couple and couple moment, Moment of a couple
about a line, resultant of a force system, distributed force system, free body diagram, free body
involving interior sections, general equations of equilibrium, two point equivalent loading,
problems arising from structures, static indeterminacy.

MODULE 2: (25 Lectures)

Laws of Coulomb friction, application to simple and complex surface contact friction
problems, transmission of power through belts, screw jack, wedge, first moment of an area and
the centroid, other centers, Theorem of Pappus-Guldinus, second moments and the product of
area of a plane area, transfer theorems, relation between second moments and products of area,
polar moment of area, principal axes.

MODULE 3: (25 Lectures)

Conservative force field, conservation for mechanical energy, work energy equation, kinetic
energy and work kinetic energy expression based on center of mass, moment of momentum
equation for a single particle and a system of particles, translation and rotation of rigid bodies,
Chasles’ theorem, general relationship between time derivatives of a vector for different
references, relationship between velocities of a particle for different references, acceleration of
particle for different references.

Text Books/ Reference Books:

1. I.H. Shames and G. Krishna Mohan Rao, Engineering Mechanics: Statics and Dynamics,
(4th Ed.), Dorling Kindersley (India) Pvt. Ltd. (Pearson Education), Delhi, 2009.
2. R.C. Hibbeler and Ashok Gupta, Engineering Mechanics: Statics and Dynamics, 11th
Ed.,Dorling Kindersley (India) Pvt. Ltd. (Pearson Education), Delhi.

Assam Science and Technology University Page 8 of 9

Course Code Course Title Hours per week Credit
L-T-P C
BMA181DE4608 Graph Theory 5-1-0 6

MODULE 1:
Definition, examples and basic properties of graphs, pseudo graphs, complete graphs, bi‐partite
graphs, isomorphism of graphs, paths and circuits, Eulerian circuits, Hamiltonian cycles, the
adjacency matrix, weighted graph, travelling salesman’s problem, shortest path, Dijkstra’s
algorithm, Floyd‐Warshall algorithm.

MODULE 2:
Applications of paths and circuits: The Chinese postman problem, digraphs, the Bellman-Ford
algorithm, tournaments, directed network, scheduling problems, definition, examples and basic
properties of trees, spanning trees, minimum spanning tree algorithms, Kruskal’s algorithm,
Prim’s algorithm, acyclic digraphs, Bellman’s algorithm.

MODULE 3:
Planar graphs, colouring of graphs, statement of the four-colour theorem, the five colour
theorem, circuit testing, facilities design, flows and cuts, construction of flows, constructing
maximal flows, rational weights, applications of directed networks, matchings.

Text Books/ Reference Books:

1. Edgar G. Goodaire and Michael M. Parmenter, Discrete Mathematics with Graph Theory,
2nd Ed., Pearson Education (Singapore) P. Ltd., Indian Reprint, 2003.
2. Rudolf Lidl and Günter Pilz, Applied Abstract Algebra, 2nd Ed., Undergraduate Texts in
Mathematics, Springer (SIE), Indian reprint, 2004.
3. C.L. Liu, Elements of Discrete Mathematics, 2nd Ed., Tata McGraw Hill Publishing
Company Ltd., 2001

*************

Assam Science and Technology University Page 9 of 9