BS/M.Sc.

Elective Courses

S.# Course Code Title Pre-requisite Discipline Cr.

Hrs.
1 MATH434 Numerical Solution of PDEs MATH331 BS/M.Sc (3 3 4)

2 MATH461 Analytical Dynamics None BS/M.Sc (3 0 3)

3 MATH462 Introduction to Special Relativity None BS/M.Sc (3 0 3)

4 MATH435 Cryptography MATH202 BS (3 0 3)

5 MATH474 Discrete Dynamical Systems MATH271 BS/M.Sc (3 0 3)

6 MATH332 Operations Research MATH131 BS/M.Sc (3 3 4)

7 MATH361 Fluid Mechanics MATH371 BS/M.Sc (3 0 3)

8 MATH423 Measure Theory & Integration MATH321 BS/M.Sc (3 0 3)

9 MATH475 Introduction to Mathematical MATH271 BS/M.Sc (3 0 3)

Biology
10 MATH413 Theory of Modules MATH313 BS/M.Sc (3 0 3)

11 MATH441 Stochastic Processes MATH242 BS (3 0 3)

12 MATH471 Mathematical Modeling MATH271 BS/M.Sc (3 0 3)

13 MATH312 Advanced Group Theory MATH211 BS/M.Sc (3 0 3)

14 MATH432 Optimization Theory-I MATH131 BS/M.Sc (3 3 4)

15 MATH433 Optimization Theory-II MATH432 BS/M.Sc (3 3 4)

16 MATH412 Galois Theory MATH313 BS/M.Sc (3 0 3)

17 MATH302 Set Theory & Mathematical Logic None BS (3 0 3)

1
Course Code: MATH434
Course Title: Numerical Solution of PDEs
Credit Hours: (3 3 4)
Pre-requisite(s): MATH331

Course Objectives:

The main objective of this course are:

a) To learn the fundamentals of finite difference and its various forms.
b) To learn explicit and implicit schemes to solve PDES.
c) To analyze error and stability of finite difference schemes.

Reading list:

1. C. F. Gerald, P. O. Wheatley, “Applied Numerical Analysis”, 7th edition,

Pearson Education, 2004.
2. R. L. Burden, J. D. Faires, “Numerical Analysis”, 8th edition, PWS Publishing
Company, 2010.
3. S. C. Chapra, R. P. Canale, “Numerical Methods for Engineers”, 6th edition,
McGraw-Hill, 2017.

Lecture-wise distribution of the Contents

Lecture # Topic
L1-L2 Introduction, Review of basic topics
L3-L4 Mathematical models, Classification of Partial differential equations
(PDEs),
L5-L7 Approximation of derivatives of functions, finite differences, Taylor
series for multivariate functions , different difference operators,
L8-L10 Big-Oh and little-Oh i.e. limiting behaviour of functions, errors in
different norms for vectors and for functions
L11-L13 Finite different methods for elliptic PDEs, Gauss-elimination, Gauss-
Jordan and SOR methods to solve the related linear system, stability
of the method
L14-L16 Parabolic PDEs, FTCS scheme for one dimensional heat equation,
Local truncation error (LTE), Von Neumann stability and convergence
of the scheme
L17-L19 The theta method, Crank-Nicholson scheme, Backward Euler scheme
for heat equation, their LTE and stability
L20 MID EXAM
L21-L23 Problems with Derivative boundary condition
L24-L25 Multilevel schemes
L26-L28 Higher dimensional parabolic PDEs
L29-L31 Alternating direction method schemes for heat equation
L32-L34 Hyperbolic PDEs, upwind schemes for advection equation, LTE and
stability of these schemes
L35-L37 Leapfrog scheme, Lax-Wendroff, Crank-Nicholson scheme for
advection
L38-L40 LTE and Von Neumann stability of these schemes
2
 L41-L43 Finite difference schemes for Second order hyperbolic PDEs
L44-L46 Finite difference schemes for uncoupled system of PDEs
L48 Finite difference schemes for coupled system of PDEs

Course Code: MATH461

Course Title: Analytical Dynamics
Credit Hours: (3 0 3)
Pre-requisite(s): None

Course Objectives:

The main objective of this course are:

a) To learn constrained particle dynamics.

b) To understand orbital motion and underlying physical laws.
c) To learn rigid body dynamics.

Reading list:

1. F. Chorlton, “Text book of Dynamics”, CBS Publishers & Distributors, 2004.

2. L. A. Pars, “Introduction to Dynamics”, 1st edition, Cambridge University
Press, 2008.
3. M.D. Ardema,” Analytical Dynamics: Theory and Applications”, Springer,
2004.
4. J. L. Synge, “Principle of Mechanics”, Milward Press, 2007.

Lecture-wise distribution of the Contents

Lecture # Topic
L1-L3 Introduction, Particle Dynamics: Projectile motion under gravity.
L4-L6 Constrained particle motion, angular momentum of a particle.
L7-L9 Orbital Motion: Motion of a particle under a central force.
L10-L12 Use of reciprocal polar coordinates, use of pedal coordinates and
equations.
L13-L15 Kepler’s laws of planetary motion.
L16-L18 Motion of system of Particles: Linear momentum of a system of
particles.
L19-L21 Angular momentum and rate of change of angular momentum of a
system.
L22 MID EXAM
L23-L24 Use of Centroid, moving origins, impulsive forces, elastic impact.
L25-L27 Introduction to Rigid Body Dynamics: Moments and products of inertia.
L28-L30 the theorems of parallel and perpendicular axes,
L31-L33 Angular momentum of a rigid body about a fixed point and about fixed
axes, principal axes.
L34-L36 Action and the Principle of Variation.
L37-L39 Noether Symmetries and Conservation Laws.
L40-L42 Derivation of the Variational principle in general coordinate system
and the general expression for the conservation laws
L43-L45 Kinetic energy of a rigid body rotating about a fixed point, general

3
 motion of a rigid body.
L46-L48 Momental ellipsoid, equimomental system, coplanar distribution.

Course Code: MATH462

Course Title: Introduction to Special Relativity
Credit Hours: (3 0 3)
Pre-requisite(s): None

Course Objectives:

The main objective of this course are :

a) To give students an understanding of the theory of special relativity and the ablity to
use the theory to solve problems related to the motion of bodies.
b) To provide practice in altering one’s opinions and intuitive picture of a structure in
light of new evidence. In this case, the structure is none other than the ‘well-known’
framework of space and time.

Reading List:

1. R. Resnick, “Introduction to Special Relativity”, 1st edition, John Wiley & Sons

Inc., New York, 1968. 
2. J.H. Smith,”Introduction to Special Relativity”,Dover, 2015.
3. A. Einstein, “Relativity: The Special and the General Theory”, New York:
Three Rivers Press/Random House, 1995.
4. A.P. French,”Special Relativity”, 1st edition, W.W. Norton & Company,1968.

Lecture-wise distribution of the course contents

Lecture # Topic
L1-L3 Summary of organization, Intuition and familiarity in physical law
L4-L6 Relativity before Einstein.
L7-L9 Electromagnetism, light and absolute motion, Search for the aether.
L10-L12 Precursors of Einstein, Principles of relativity.
L13-L15 Ineterial systems, clock and meter sticks, reconsidered, Lorentz
transformation, Immediate consequences.
L16-L18 Algebra of Lorentz transformations, Length contraction,
Time dilation.
L19-L21 Intervals, causality, etc. Differential form of the Lorentz transformation
L22 MID EXAM
L22-L24 The Doppler Effect and the effect of relativistic speed.
L25-L27 Addition of velocities, Transformation of angles
L28-L30 Visual appearance of objects at relativistic velocities, The pole vaulter
and the failure of rigidity
L31-L33 The log and the hole in the ice, Acceleration in special relativity
L34-L36 The ice boat paradox, The twin paradox
L37-L39 Constructing relativistic momentum and energy.
4
 L40-L42 Properties of objects under Lorentz transformation, Another four-
vector: the four velocity
L43-L45 The Lorentz transformation of energy and momentum, The invariant
scalar product
L46-L47 Using invariants to simplify kinematic calculations, Incompleteness of
special relativity, The Equivalence Principle
L48 The Equivalence Principle, Consequences of the Equivalence
Principle, Mach’s Principle and looking forward to General Relativity

Course Code: MATH435

Course Title: Cryptography
Credit Hours: (3 0 3)
Pre-requisite(s): MATH202

Course Objectives:

The main objective of this course are:

a) To enable the students to learn fundamental concepts of computer security and
cryptography and utilize these techniques in computing systems.
b) To become familiar with basic techniques to protect data in computer and
communication environments against several kinds of scams.

Reading list:

1. H. C. A. van Tilborg, “Fundamentals of Cryptology”, Springer, 2000.

2. J. Katz, Y. Lindell, “Introduction to Modern Cryptography”, Chapman and Hall/CRC,
2007.
3. A. J. Menezes, P. C. van Oorschot, S. A. Vanstone, “Handbook of Applied
Cryptography”, 1st edition, CRC Press, 1996.

Lecture-wise distribution of the Contents

Lecture # Topic
L1-L4 Introduction & Terminology, Shanon's description of a conventional
cryptosystem, Statistical description of a Plaintext source
L5-L8 Caesar, Simple Substitution, Vigenère Caesar Cipher, Cryptoanalysis
of Ceaser ciphers
L9-L11 Vernam, Playfair, Transpositions, Hagelin, Enigma, One Time Pad
L12-L14 Shanon's Information Theory (Shanon's Theorem, Entropy,
Redundancy, and Unicity Distance)
L15-L17 Mutual Information and Unconditionally Secure Systems
L18-L21 Problems on Entropy, Redundancy, Unicity Distance , Mutual
Information and Unconditionally Secure Systems
L22-L25 Public-Key Cryptography (The Theoretical Model)
L26-L28 Motivation and Set-up, Confidentiality
L29-L32 Digital Signature, Confidentiality and Digital Signature
L32-L35 Problems on Public-Key Cryptography
L36-L38 The Discrete Logarithm Problem, ElGamal's Public-Key

5
 Cryptosystems
L39-L41 How to Take Discrete Logarithms
L42-L44 The RSA System, RSA for Privacy, RSA for Signatures
L45-L46 Coding Theory Based Systems
L47-L48 Setting Up the System, Encryption and Decryption

6
Course Code: MATH474
Course Title: Discrete Dynamical Systems
Credit Hours: (3 0 3)
Pre-requisite(s): MATH271

Course Objectives:

The objectives of this course are:

a) To introduce the ideas on discrete dynamical systems.

b) To elaborate the elements of discrete dynamical systems and to consider particular
systems with complex behavior.
c) To analyze how chaos arises in dynamical systems.
d) To explore discrete dynamical models via computational packages.

Reading List:

1. R. L. Devaney, “A First Course in Chaotic Dynamical Systems”, Westview,

1992.
2. R. A. Holmgren, “ A First Course in Discrete Dynamical Systems”, 2nd edition,
Springer, 2000.
3. M. R. S. Kulenovic, O. Merino, “Discrete Dynamical Systems and Difference
Equations with Mathematica” 1st edition, Chapman & Hall, 2002.
4. R. C. Robinson, “An Introduction to Dynamical Systems: Continuous and
Discrete”, American Mathematical Society, 2012.

Lecture-wise distribution of the Contents

Lecture Topic
#
L1 Introduction to the course
L2-L3 Examples of Dynamical Systems from Finance, Ecology, Finding Roots
and Solving Equations (Review)
L4-L5 Iteration, Orbits.
L6-L7 Types of Orbits, The Doubling Function.
L8-L9 Graphical Analysis, Orbit Analysis.
L10-L12 The Phase Portrait, Fixed and Periodic Points, A Fixed Point Theorem,
Attraction and Repulsion.
L13-L15 Calculus of Fixed Points, Periodic Points, Rate of convergence
L16-L18 Bifurcations, Dynamics of the Quadratic Map, The Saddle-Node
Bifurcation
L19-L20 The Period-Doubling Bifurcation.
L21 MID EXAM
L22-23 The Quadratic Family, The Cantor Middle-Thirds Set.
L24-L26 The Orbit Diagram, The Period-Doubling Route to Chaos
L27-L29 Three Properties of a Chaotic System, Other Chaotic Systems,
Manifestations of Chaos
L30-L32 The Schwarzian Derivative, The Critical Point and Basins of Attraction
L33-L35 Newton's Method, Basic Properties , Convergence1 and
7
 Nonconvergence, Fractals.
L36-L38 Chaos Game
L39-L41 The Cantor Set Revisited. The Sierpinski Triangle
L42-L44 The Koch Snowflake, Topological Dimension.
L45 Fractal Dimension.
L46-L48 Iterated Function Systems

Code: MATH332
Course Title: Operations Research
Credit Hours: (3 0 3)
Pre-requisite(s): MATH131

Course Objectives:

1. To provide a fundamental account of the basic results and techniques of linear

programming (LP) in operations research.
2. To introduce the quantitative methods and techniques for effective decisions–making
in solving business decision problems.

Reading List:

3. A. T. Hamdy, “Operations Research - An Introduction”, 9th edition, Prentice Hall,

2010.
4. P. A. Jensen, J. F. Bard, “Operations Research Models and Methods”, 1st edition,
Wiley, 2002.
5. G. H. Hurlbert, “Linear Optimization”, Springer, 2010.

Lecture-wise distribution of the Contents

Lecture # Topic
L1 Introduction to Operations Research and techniques
L2-L3 Operation Research Models, Solving the OR Models
L4-L6 Two-Variable LP Model
L7-L9 Graphical LP Solutions and Selected LP Applications
L10-L12 LP Models in equation form, Transition from Graphical to Algebraic
Solution
L13-L15 The Simplex Method, Artificial Starting Solution
L16-L18 Special Cases in Simplex Method
L19-L21 Sensitivity Analysis
L22 Mid-Exam
L23-L25 Definition of Dual Problem, Primal-Dual Relationship
L26-L28 Dual Simplex Algorithm
L29-L31 Post-Optimal Analysis
L32-L34 Definition of the Transportation Model, Nontraditional Transportation
Models
L35-L37 The Transportation Algorithm, The Assignment Model
L38-L40 Minimal Spanning Tree Algorithm, Shortest-Route Problem
L41-L43 Maximal Flow Models

8
L44-L46 Example Containing Mixed Constraints, Minimization Example for
Similar Limitations.
L47-L48 Heuristics Such As The Greedy Method: Important Applications

9
Course Code: MATH361
Course Title: Fluid Mechanics
Credit Hours: (3 0 3)
Pre-requisite(s): MATH371

Course Objectives:
The objectives of this course are:
a) To learn basic fluid properties (density, viscosity, bulk modulus), flow forces
(pressure, shear stress, surface tension), and flow regimes (laminar/turbulent,
compressible/incompressible, steady/unsteady)
b) To Learn to use control volume analysis to develop basic equations and to solve
problems
c) To Understand and use differential equations to determine pressure and velocity
variations in internal and external flows
d) To learn the use and limitations of steady and unsteady Bernoulli equation along and
normal to a streamline

Reading List:

1) J. B. Franzini, E. J. Finnermore , “Fluid Mechanics with Engineering

Applications”, McGraw -Hill, 10th  edition, 2011.
2) D. F. Young, B. R. Munson, T. H. Okiishi, W. W. Huebsch, “A Brief
Introduction to Fluid Mechanics, 5th edition, John Wiley & Sons Inc., 2010.
3) D. F. Young, T. H. Okiishi, B.R. Munson, “Fundamentals of Fluid Mechanics,
4th edition, Wiley, 2002.
4) R. W. Fox, A. T. McDonald, P. J. Pritchard, “Introduction to Fluid Mechanics”,
6th edition, John Wiley & Sons Inc., 2006.
5) Y. A. Cengel, J. M. Cimbala, “Fluid Mechanics: Fundamentals and
Applications”, 3rd edition, McGraw-Hill Science/Engineering/Math, 2013.

Lecture-wise distribution of the Contents

Lecture # Topic
L1-L2 Introduction to the course ,Definition of a fluid ,Real fluids and ideal
fluids, Density , viscosity, specific weight ,specific volume , specific
gravity of fluids ,Newtown law of viscosity
L3-L4 Newtonian and non- Newtonian fluids, Types of non- Newtonian fluids,
velocity of a fluid at a point, streamlines ,path lines, strike lines and
time lines
L5-L6 Steady-unsteady, laminar-turbulent, uniform-non uniform fluid flows,
One ,two and three dimensional fluid flows ,Method of description of
fluid flows
L7-L8 Conversion between Lagrange’s and Euler’s velocity displacement
components , Material time derivative
L9-L11 Derivation of Basic hydrostatic equation derivation, Special cases for
compressible and non-compressible fluids ,
L12-L14 Applications of hydrostatic equation ,Equation of stream lines in
10
 Cartesian and cylindrical coordinates
L15-L16 Stream function ,Velocity potential ,Verticity vector
L17-L19 Equation of continuity in different coordinates system , Special cases
L20-L22 Conditions at a rigid boundary, Euler’s equations of motion
L23-L24 Special cases of Euler’s equation of motion, Applications
L25 Mid Exam
L26-L28 Bernoulli’s equation, steady motion under conservative body forces,
Applications and special cases
L29-L31 Navier-Stoke’s equations ,special cases
L32-L34 Steady unidirectional flow, Poiseuille flow, Couette flow
L35-L37 Unsteady unidirectional flow, Sudden motion of a plane boundary in a
fluid at rest
L38-L39 Flow due to an oscillatory boundary
L40-L42 Flow between circular pipes
L43-L45 Some Potential theorems
L46-L48 Impulsive motion, Sources and Sinks

11
Course Code: MATH423
Course Title: Measure Theory and Integration
Credit Hours: (3 0 3)
Pre-requisite(s): MATH321

Course Objectives:

The objectives of this course are:

a) To learn basics of measurable sets and measurable functions.
b) To understand Lebesgue Integration for Functions of a Single Real Variable.
c) To understand Lp spaces and related properties.

Reading List:

1) H. L. Royden, P. M. Fitzpatrick, “ Real Analysis”, 4 th edition, Pearson

Education, 2010.
2) W. Rudin, “Real and Complex Analysis”, 3rd edition, McGraw-Hill, 1986.
3) J. Frank, “Lebesgue Integration on Euclidean Spaces”, Boston: Jones &
Bartlett Publishers, 2001.
4) L. C. Evans, R. F. Gariepy, “Measure Theory and Fine Properties of
Functions”, 1st edition, CRC Press, 1991.
5) G. B. Folland, “Real Analysis: Modern Techniques and Their Applications”, 2 nd
edition, John Wiley & Sons Inc., 1999.
6) R. G. Bartle, “The elements of integration and Lebesgue Measure”, 1 st edition,
Wiley-Interscience,1995.

Lecture-wise distribution of the course contents

Lecture # Topic
L1 Introduction to the course,Preliminaries on Sets
L2-L3 Mappings and Relations ,The Field, Positivity, and Completeness
Axiom
L4 The Natural and Rational Numbers
L5-L8 Countable and Uncountable Sets, Open Sets, Closed Sets, and Borel
Sets of Real Number, Sequences of Real Numbers, Continuous Real-
Valued Functions of a Real Variable
L9-L12 Lebesgue Measurable Sets: Lebesgue Outer Measure, The sigma-
Algebra of Lebesgue Measurable Sets, Outer and Inner Approximation
of Lebesgue Measurable Sets,
L13-L15 Countable Additivity, Nonmeasurable Sets
L16 The Cantor Set
L17-L19 Lebesgue Measurable Functions: Sums, Products, and Compositions
L20-L22 Sequential Pointwise Limits and Simple Approximation
L23-L25 Littlewood's Three Principles, Egoroff's Theorem, and Lusin's
Theorem
L26 MID EXAM
L27-L29 Lebesgue Integration: The Riemann Integral, The Lebesgue Integral of
a Bounded Measurable Function over a Set of Finite Measure
12
L30-L32 The Lebesgue Integral of a Measurable Nonnegative Function
L33-L35 The General Lebesgue Integral
L36-L38 Countable Additivity and Continuity of Integration, Uniform
Integrability: The Vitali Convergence Theorem
L39-L41 Convergence in Measure, Characterizations of Riemann and
Lebesgue Integrability
L42-L44 The Lp spaces: completeness and approximations: Normed linear
spaces, The Inequalities of Young, Holder and Minkowski
L45-L48 Completeness of Lp space, Miscellaneous topics

13
Course Code: MATH475
Course Title: Introduction to Mathematical Biology
Credit Hours: (3 0 3)
Pre-requisite(s): MATH271

Course Objectives:

The objectives of this course are:

a) To understand, solve and interpret discrete/ continuous models of biological
phenomena.
b) To understand biological models published in the scientific literature.
c) To understand dynamics of the molecular events.

.
Reading List:

1. L. E. Keshet, “Mathematical Models in Biology”, 1st edition, SIAM, 2005.

2. S. H. Strogatz,”Non-linear Dynamics and Chaos-With Applications to Physics,
Biology, Chemistry and Engineering”, 1st edition, Westview, 2001.
3. C. H. Taubes, “Modeling Differential Equations in Biology”, 2nd edition, Cambridge
University Press, 2008.

Lecture-wise distribution of the Contents

Lecture # Topic
L1 Overview of the course
L2-L4 Discrete Biological Models / Difference Equations
L5-L7 Systems of Difference Equations / The Golden Mean / Complex
Eigenvalues
L8-L10 Applications / Nonlinear Difference Equations / Steady States and
Stability / The Logistic Equation
L11-L13 Analysis of the Logistic Equation / Cobwebbing / Systems of Nonlinear
Difference Equations
L14-L16 Steady States and Stability, examples
L17-L19 Continuous Models
L20-L22 Bacterial Growth / Tumors / Dimensional Analysis
L23 MID EXAM
L24-L26 Steady States and Stability / Stability in the Chemostat / Applications
L27-L28 Geometry of First Order ODEs
L29-L31 Systems of 2 First Order ODEs / Geometric Analysis
L32-L35 Nullclines / Phase Plane Diagrams / Geometric Analysis of Stability
L36-L38 Geometric Analysis of the Chemostat / The Predator-Prey System /
Michaelis-Menten Kinetics
L39-L41 Sigmoidal Kinetics / Singular Perturbations
L42-L44 Threshold-Governed Cellular Development / A Bimolecular Switch /
Limit Cycles / Poincare-Bendixson Theory / Cubic Nullclines
L45-L46 Hopf Bifurcation / Oscillations in Population Models
14
 L47-L48 Oscillations in Chemical Models

Course Code: MATH413

Course Title: Theory of Modules
Credit Hours: (3 0 3)
Pre-requisite(s): MATH313

Course Objectives:
a) To study module structure as an action of a ring on an abelian group
b) To learn technique of extracting structural information through homomorphism
c) To study some well-known modules

Reading List:
1. P.B. Bhattacharya, S.K. Jain and S.R. Nagpaul, “Basic Abstract Algebra”, 2 nd
ed., Cambridge University Press, 1995.
2. D.S. Dummit and R.M. Foote, “Abstract Algebra”, 3 rd ed., Addison-Wesely,
2004.
3. S. Lang, “Algebra”, 3rd ed., Springer, 2005
4. C. Musili, “Introduction to rings and Modules”, 2 nd ed., Narosa Publishing
House, 2009.
5. F. W. Anderson and K. R. Fuller, “Rings and Categories of Modules”, 2 nd ed.,
Springer-Verlag, 1992.

Lecture-wise distribution of the course contents

Lecture # Topics
L1 Introduction to the course
L2-L3 Module structure with examples
L4-L6 Submodule, sum of submodules
L7-L9 Direct sum of modules
L10-L12 Free modules, finitely generated modules
L13-L15 Annihilators
L16-L18 Quotient modules
L19-L21 Homomorphism of modules with some structural properties
L22-L23 The Isomorphism theorems for modules
L24 Mid-Exam
L25-L27 Exact and short exact sequences
L28-L30 Some important results (e.g. Five lemma) about commutative diagram
via diagram chasing technique
L31-L33 Modules over PID
L34-L36 Simple modules, Schur Lemma
L37-L39 Artinian modules and rings
L40-L42 Noetherian modules and rings
L43-L45 Modules of finite length
L46-L48 Radicals: nil radical, Jacobson radical

15
Course Code: MATH441
Course Title: Stochastic Processes
Credit Hours: (3 0 3)
Pre-requisite(s): MATH242

Course Objectives:

The objectives of this course are:

a) To introduce the students to a broad range of stochastic processes that underlay
models in fields such as engineering, computer science, management science, the
physical and social sciences, and operations research.
b) To develop and analyze probability models that capture the salient features of the
system under study to predict the short and long term effects that this randomness
will have on the systems under consideration.
c) To understand discrete and continuous time Markov chains
d) To understand Renewals and Diffusion processes.

Reading List:

1. G. Grimmett, D. Stirzaker, “Probability and Random Process”, Oxford University

Press, 2001.
2. Sheldon M. Ross, “Introduction to Probability Models” 9th edition, Elsevier, 2007.
3. M. Pinsky, S. Karlin, “An Introduction to Stochastic Modeling”, Elsevier, 2007.
4. E. Cinlar, “Introduction to Stochastic Processes”, Dover, 2013.
5. D. P. Heyman, M. J. Sobel, “Stochastic Models in Operations Research”, (Vol. 1),
Dover, 2003.
6. R. Wolff, “Stochastic Modeling and the Theory of Queues”, 1st edition, Pearson, 1989.

Lecture-wise distribution of the Contents

Lecture # Topic
L1-L4 Introduction to the
L2-L4 courseClassification of states, Classification of chains, Stationary
distributions and the limit theorem.
L5-L7 Reversibility, Chains with finitely many states, Branching processes revisited,
L8-L10 Birth processes and the Poisson process, Continuous-time Markov chains,
Uniform semigroups.
L11-L13 Birth-death processes and Imbedding,
L14-L16 Special processes, Spatial Poisson processes, Markov chain Monte Carlo
L17-L19 Introduction to random processes, Stationary processes, Renewal
processes.
L20-L22 Queues, The Wiener process, Existence of processes.
L23 MID EXAM
L24-L26 Introduction to Stationary processes, Linear prediction, Autoco variances and
spectra.
L27-L29 Stochastic integration and the spectral representation, The ergodic theorem,
Gaussian processes.

16
L30-L32 The renewal equation, Limit theorems, Excess life.
L33-L35 Applications, Renewal-reward processes.
L36-L38 Introduction to diffusion processes, Brownian motion, Diffusion processes,
L39-L41 First passage times, Barriers, Excursions and the Brownian bridge,.
L42-L44 Stochastic calculus, The Ito integral, Ito's formula.
L45-L48 Option pricing, Passage probabilities and potentials.

17
Course Code: MATH471
Course Title: Mathematical Modeling
Credit Hours: (3 0 3)
Pre-requisite(s): MATH271

Course Objectives:

The objectives of this course are:

a) To learn the basics of deterministic modeling.
b) To learn how to apply balance laws, conservative laws and constitutive laws to
construct a
mathematical model.
c) To analyze the derived model with dynamical system point of view.
d) To interpret the qualitative behavior of the model.

Reading list:

1. F. R. Adler, “Modeling The Dynamics of Life: Calculus and Probability for Life
Scientists”, 3rd
Brooks/Cole, 2013.
2. S.H. Strogatz, “Nonlinear dynamics and chaos: With applications in Physics, Biology,
Chemistry and Engineering”, 1st edition, Westview Press, 2001.
3. L. Edelstein-Keshet, “Mathematical Models in Biology”,1st edition, Leah SIAM, 2005.
4. C. H. Taubes, “Modeling Differential Equations in Biology”, 2nd edition, Cambridge
University Press, 2008.

Lecture-wise distribution of the Contents

Lecture # Topic
L1 Introduction to the course
L2-L3 Introduction: Deterministic Vs Stochastic modeling, Modeling
Components, Modeling laws.
L4 Review of some physical and biochemical laws.
L5-L6 Units and Dimensions, Dimensional analysis and Scaling.
L7-L8 Buckingham Pi theorem and its Importance, examples.
L9-L11 One-dimensional flows: geometric approach, fixed points and stability,
Potentials.
L12-L13 Linear stability analysis for 1D systems.
L14-L16 1D Bifurcations: Saddle Node Bifurcation, Trans critical Bifurcation,
Pitchfork Bifurcation, examples.
L17-L19 Linear systems: definitions and examples, Classifications.
L20-L22 Phase Plane: Phase portrait, Existence, Uniqueness and Topological
consequences.
L23 MID EXAM
L24-L25 Nullclines, Fixed points and linearization.
L26-L27 Conservative systems, Reversible systems, Nonlinear Pendulum.
L28-L29 Biological Models Using Difference equations: Cell division, An insect
population.
L30-L32 Propagation of Annual plants: problem statement, assumptions,
18
 equations, condensing the equations, validation.
L33-L34 System of linear difference equations.
L35-L37 Nonlinear difference equations: steady states, stability and critical
parameters, system of non-linear difference equations.
L38-L39 Applications of non-linear difference equations to population Biology.
L40-L41 Continuous time models: Formulating a model, dimensional analysis,
steady states, stability and linearization, examples.
L42-L44 Applications of continuous Models to Population dynamics: Malthus
model, logistic model, Allee effect, Gomoertz growth in
tumors,predator-prey systems and Lotka-Volterra equations,
populations in competition.
L45-L48 Models for molecular events: Chemical reactions and law of mass
action, Michaelis-Menten kinetics, The Quasi-Steady state
assumptions, Sigmoidal kinetics.

19
Course Code: MATH312
Course Title: Advanced Group Theory
Credit Hours: (3 0 3)
Pre-requisite(s): MATH211

Course Objectives:
a) To learn more structural properties of groups
b) To study groups through their actions on sets with applications
c) To classify all finitely generated abelian groups
Reading list:

6. P.B. Bhattacharya, S.K. Jain and S.R. Nagpaul, “Basic Abstract Algebra”, 2 nd
ed., Cambridge University Press, 1995.
7. D.S. Dummit and R.M. Foote, “Abstract Algebra”, 3 rd ed., Addison-Wesely,
2004.
8. J.B. Fraleigh, “A First Course in Abstract Algebra”, 7 th ed., Pearson, 2002.
9. J.A. Gallian, “Contemporary Abstract Algebra”, 7 th ed., Brooks/Cole, 2010.
10. J.F. Humphreys, “A course in Group Theory”, Oxford University Press, 1996.
11. A. Majeed, “Theory of Groups”, Ilmi Kitab Khana, 2012.

Lecture-wise distribution of the course contents

Lecture # Topics
L1 Introduction to the course
L2-L3 Commutator, commutator identities
L4-L6 Derived groups and their properties
L7-L9 Conjugacy relation, conjugacy classes, class equation
L10-L12 Automorphisms, automorphism group, inner automorphism
L13-L15 Invariant and fully invariant subgroups
L16-L18 Linear Groups: general linear groups, special linear groups,
orthogonal groups, unitary groups, projective linear group, projective
special linear group
L19-L21 Group actions: action and G-set with concrete examples, group action
and homomorphism
L22-L23 Orbit, stabilizer, and their computations, isotropy subgroups
L24 Mid-Exam
L25-L27 Orbit-Stabilizer Theorem, Applications of group actions to classical
group theory
L28-L30 Applications of G-sets to counting: Burnside’s Formula and
applications
L31-L33 Equivalent actions, Transitive actions
L34-L36 p-groups, actions of p- groups
L37-L39 Cauchy’s Theorem for Abelian and Non-Abelian groups, Sylow
Theorems
L40-L42 Subnormal and normal series, Zassenhaus Lemma
L43-L45 Schreier Theorem, Jordan-Hoelder Theorem

20
L46-L48 Free Abelian groups, fundamental theorem of finitely generated
Abelian groups

21
Course Code: MATH432
Course Title: Optimization Theory-I
Credit Hours: (3 3 4)
Pre-requisite(s): MATH131

Course Objectives:

a) Learn the basic notions and results of mathematical programming and optimization
b) Learn the basic theory of optimization.
c) Learn and implement in MATLAB the methods for optimization problems.

Reading List:

1) R. Fletcher, “Practical Methods of Optimization, 2 nd edition, John Wiley and

Sons Inc., 2000.
2) M. A. Bhatti, “Practical Optimization Methods: with Mathematica
Applications”, Springer, 2000.
3) K. P. Chong Edwin, H. Z. Stanislaw, “An Introduction to Optimization”, 2 nd
edition, John Willey and Sons Inc., 2001.
4) P. Venkataraman, “Applied Optimization with MATLAB Programming”, John
Willey and Sons Inc., 2002.
5) J. A. Snyman, “Practical Mathematical Optimization: An Introduction to Basic
Optimization”, Springer, 2005.
6) D. G. Luenberger, Y. Ye, “Linear and Nonlinear Programming, 4 th edition,
Springer, 2015

Lecture-wise distribution of the Contents

Lecture # Topic
L1 Introduction to Optimization Theory-I
L2-L3 A Mathematical Review: Linear Equations, Neighborhoods, Eigen
Values, Eigen Vectors, Matrix forms, Rank of Matrix, Quadratics forms,
Gradient, Hessian
L4-L6 Optimization: Introduction, History and Applications, Optimization
Problem Formulation, The Standard Form of an Optimization Problem
L7-L8 Procedure for Graphical Optimization, Graphical Optimization Examples
L9-L11 Conditions for local minimizer\ maximizer, Feasible Directions
L12-L14 Approximation Using the Taylor Series for Two Variables, Surfaces and
Tangent Planes
L15-L17 First-order Necessary Condition for Optimality of Optimization Problems,
Second-order Sufficient Condition for Optimality of Optimization
Problems
L18-L20 Convex Analysis: Convex and Concave Functions, Minimization and
Maximization of Convex Functions
L21-23 Basic Iteration of an Iterative Method, Descent Direction: A Simple Test,
Step Length Calculation by Analytical Line Search
L24 Mid-Exam

22
L25-L27 Line Search Methods: Equal Interval Search, Section Search, The
Fibonacci Search Method
L28-L30 The Golden Section Search, The Quadratic Interpolation Method,
Algorithm for Choosing Three Initial Points and Establishing Bounds
L31-L33 Gradient Methods: The method of Steepest Decent, Analysis of
Gradient methods, Convergence and Convergence Rate
L34-L35 Inaccurate Line Search: Armijo’s Rule, The Method of Steepest Descent
L36-L37 Newton’s Method, Global Convergence of Curve Fitting
L38-L40 Conjugate Directions, Descent Properties of the Conjugate Direction
Method, The Conjugate Gradient Method
L41-L43 The Fletcher-Reeves formula, The Polak-Ribiere formula, The C–G
Method as an Optimal Process
L44-L46 The Partial Conjugate Gradient Method, Newton’s Method, The Modified
Newton’s Method
L47-L48 Quasi-Newton Methods: Approximating the Inverse Hessian, Davidon-
Fletcher-Powell Method, The Broyden Family

23
Course Code: MATH433
Course Title: Optimization Theory-II
Credit Hours: (3 3 4)
Pre-requisite(s): MATH432

Course Objectives:
On completion of the course, students should be able to:
a) Learn the basic theory of optimization.
b) Learn to deal with various real world optimization problems, with or without
Constraints.
c) Learn and implement in MATLAB the methods for Optimization Problems.

Reading list:

1) R. Fletcher, “Practical Methods of Optimization”, 2 nd edition, John Willey &

Sons Inc., 2000.
2) M. A. Bhatti, “Practical Optimization Methods: with Mathematica Applications”,
Springer, 2000.
3) K. P. C. Edwin and H. Z. Stanislaw, “An Introduction to Optimization”, John
Willey & Sons Inc., 4th edition, 2013.
4) P. Venkataraman, “Applied Optimization with MATLAB Programming”, 2 nd
edition, John Willey & Sons Inc., 2009.
5) J. F. Bonnans, “Numerical Optimization: Theoretical and Practical Aspects”,
Springer, 2003.
6) J. A. Snyman, “Practical Mathematical Optimization: An Introduction to Basic
Optimization”, Springer, 2005.
7) D. G. Luenberger, Y. Ye, “Linear and Nonlinear Programming”, 4 th edition,
Springer, 2015.

Lecture-wise distribution of the Contents

Lecture # Topic
L1 Introduction to Optimization Theory-II, (Constrained optimization)

L2-L3 Constrained Optimization and its Applications, Constraints, Equality and

Inequality Constraints, Active and Inactive Constraints.
L4-L6 Theory of Constrained Optimization: Standard Problem Definition,
Additive Property of Constraints, Aggregate Constraints

L7-L9 First-Order Necessary Conditions and Second-order Sufficient

Conditions for Equality Type Constraints
L10-L12 Inequality Constraints: First-order Necessary Conditions: Karush-Kuhn-
Tucker Conditions, Second-order Necessary Conditions, Sensitivity
L13-L15 Optimality Conditions for Convex and non-Convex Problems
L16-L18 Lagrange Duality, Lagrange Conditions for Equality Type Constraints of
Constrained Optimization.
L19-21 Primal Methods: Advantage of Primal Methods, Feasible Direction
Methods
24
L22-L23 Two Dimensional Linear Programming, Simplex Method, Basic Solution,
Dual Linear Programs, Properties of Duality
L24 Mid-Exam
L25-L27 Constrained Non-linear forms, Normalization of Non-linear forms
L28-L30 Penalty Methods, Barrier Methods and their Convergence
L31-L33 Penalty Functions: Interior Penalty Function, Exterior Penalty Function,
Augmented Lagrangian Penalty Function
L34-L36 Properties of Penalty and Barrier Functions, Penalty Functions,
Lagrange Multipliers, the Hessian Matrix
L37-L39 Barrier Functions, The Central Path, Geometric Interpretation—The
Primal Function
L40-L42 Global Duality, Local Duality, Partial Duality, Canonical Convergence
Rate of Dual, Separable Problems and their Duals
L43-L45 Newton’s Method and Penalty Functions, Conjugate Gradients and
Penalty Methods, Normalization of Penalty Functions
L46-L48 Penalty Functions and Gradient Projection: Underlying Concept,
Implementing the First Step, Exact Penalty Functions

25
Course Code: MATH412
Course Title: Galois Theory
Credit Hours: (3 0 3)
Pre-requisite(s): MATH313

Course Objectives:

An advanced abstract algebra course which focuses on the solution of of polynomial

equations over a field, including relationship between roots, method of solutions and location
of roots. It also describes the structure of finite and algebraic extensions of fields and their
automorphisms.

Reading list:

1. D. J. H. Garling, “A course in Galois Theory”, 1st edition, Cambridge University

Press,1987.
2. J. S. Milne, “Fields and Galois Theory”, Sabre Peak, 2015.
3. S. C. Newman, “A Classical Introduction to Galois Theory” John Wiley & Sons Inc.,
2012.
4. J. M. Howie, “Fields and Galois Theory”, 1st edition, Springer, 2006.

Lecture-wise distribution of the Contents

Lecture # Topic
L1-L3 Field Extensions, Algebraic and transcendental elements
L4-L5 Algebraic extensions, Monomorphisms of algebraic extensions
L6-L8 Tests for Irreducibility: Introduction, Eisenstein’s criterion
L8-L10 Ruler and compass constructions: Constructible points, The angle pi/3
cannot be trisected
L11-L13 Splitting Fields, The extension of monomorphisms, some examples
L12-L15 The algebraic closure of a field
L16-L18 Normal extensions
L19-L21 Separability: Basic ideas, Galois extensions, Differentiation, The Frobenius
monomorphism, Inseparable polynomials
L22-L24 Automorphisms and fixed fields: Fixed fields and Galois groups, The galois
group of a polynomial
L25-L27 The Fundamental theorem of Galois Theory, The theorem on natural
irrationalities
L28-L29 Finite fields
L30-L31 The Theorem of the primitive element
L32-L34 Cubics and Quartics: Extension by radicals, The descriminant,Cubic
polynomials,Quartic polynomials
L35-L37 Roots of unity: Cyclotomic polynomials, Irreducibility, The Galois group of a
cyclotomic polynomial
L38-L40 Cyclic extensions
L41-L45 Solution by radicals, Transcendental elements and algebraic independence
L46-L48 The calculation of Galois Groups

26
Course Code: MATH302
Course Title: Set Theory & Mathematical Logic
Credit Hours: (3 0 3)
Pre-requisite(s): None

Course Objectives:
The objectives of this course are:
a) To learn about basic set operations and their properties.
b) To learn how to formally construct and model mathematical objects
on set-theoretical grounds.
c) To learn how to correctly express thoughts and to correctly reason using logical tools

Reading list:

1. C.C. Pinter, “Set theory”, Dover Publication Inc Inc. N.Y, 2014.
2. J. Nolt, D.Rohatyn, A.Varzi,”Logic”, 2nd edition, Mc Graw Hill, 2011
3. P.R. Halmos, “Native Set Theory”, Martino fine Books, 2011.
4. S. Lipschutz, “Theory and problems of set theory and related topics”, 2 nd Edition, Mc
Graw Hill, 1998.

Lecture-wise distribution of the Contents

Lecture # Topic
L1-L2 Introduction to the course, Set and basic operations on sets , Intervals
,Bounded sets, completion properties
L3-L5 Relations, Pictorial representation of relations, composition of relations,
Types of relations, Partitions, Equivalence relations.
L6-L8 Partial ordering relations, Functions ,composition of functions ,invertible
functions ,Recursively defined functions
L9-L11 Operations on collection of sets, indexed collection of sets, Fundamental
products, Associated set functions, Choice functions.
L12-L13 Algorithms and functions, complexity of algorithms
L14-L16 Equipotent sets, Denumerable and countable sets, Real numbers and the
power of continuum.
L17-L18 Cardinal numbers , Ordering of cardinal numbers ,Cardinal arithmetic
L19-L21 Ordered sets, Partially ordered set and hasse diagrams, minimal and
maximal elements.
L22-L24 First and last elements ,Supremum and infimum , Isomorphic ordered sets
L25 Mid Exam
L26-L28 Order types of linearly ordered sets, Lattices ,Bounded ,distributive and
complemented lattices
L29-L31 Well ordered sets, similarity between well ordered set and its subset, ordinal
numbers, Structure of ordinal numbers.
L32-L33 Auxiliary construction of ordinal numbers, Axiom of choice
L34-L36 Well ordering theorem ,Zorn’s lemma
L37-L39 Propositions and compound Propositions, Basics logical operations
,tautologies and contradictions, logical equivalence
L40-L42 Conditional and bi-conditional statements ,Arguments, logical implications
L43-L45 Quantifiers , Boolean Algebra ,Isomorphic Boolean Algebra
L46-L48 Duality, Boolean Algebra as lattices

27
28