Curriculum/ Scheme of Studies

of

Bachelor of Science in Mathematics

(Post Associate Degree Program)

(BS Mathematics (Post ADP))

2022
(Revised in 2024)

University of Education,
Lahore

Page No: 1 of 59
 Table of Contents
Sr. No. Content Page No.
1 Introduction 3
2 Program Objective 3
3 Vision 3
4 Mission Statement 3
5 Pathways 3
6 Admission Requirement 3
7 Medium of Instruction and Examination 3
8 Award of degree 4
9 Deficiency Courses 4
10 Program Design 4
11 Program Layout 4
12 Semester Breakup 5
13 List of Elective Courses 6
14 Course Outline 7
Introduction:
BS Mathematics (Post ADP) is 2-year program which has been planned particularly for the individuals who
wish to enter this profoundly energizing and challenging field to meet the developing need of Mathematics
in the quickly advancing 21st century job market. The program gives a solid base that will empower the
graduates to capitalize on the increasing career opportunities in this sector. This specialization gives a much
requested expertise, extraordinary mobility, adaptability, flexibility and an amazing range of possible career
choices in this area.
Program Objectives:
The objectives of the program are:
1. To establish the base for life long education by creating essential concepts and equipping the students
with necessary techniques needed to start careers in teaching, research, and/or in any walk of life involving
Mathematics.
2. To prepare students to learn concrete ideas of Mathematics, to analyze problems, and to develop problem-
solving skills.
3. To encourage students to become effective independent learners.
4. To encourage students to work in groups to get quick, true results.
Vision:
The program of BS Mathematics (Post ADP) is to train students at the undergraduate level in Mathematics
for industry, teaching or research.
Mission Statement:
Trained experts in Mathematics are important for the country. Our mission is to encourage students from
diverse backgrounds to excel in the field Mathematics. Our courses are taught both day and evening in order
to accommodate a variety of students.
Pathway for Associate Degrees Holders:
a) Students having completed Associate Degrees shall be allowed admission in the fifth semester of the
undergraduate/equivalent degree program offered in the same discipline without any deficiency course.
b) Where the disciplines of the Associate Degree and the undergraduate/equivalent degree program are
different, students shall be required to complete deficiency courses through a bridging semester before the
fifth semester as determined by the admitting university.
c) The minimum eligibility for admission in the fifth semester in above cases is 2.00/4.00 CGPA in the
prior qualification i.e., Associate Degree. The admitting university may, however, set higher eligibility
criteria for admission in the fifth semester of the four-year undergraduate/equivalent degree program.
Pathway for Conventional Two-Year BA/BSc/Equivalent Degree Holders:

a) Students having completed conventional two-year BA/BSc/equivalent degree programs shall be allowed
admission in the fifth semester of the undergraduate/equivalent degree program, in which case students
shall be required to complete deficiency courses through a bridging semester before commencement of
the fifth semester as determined by the admitting university.

b) The minimum eligibility for admission in the fifth semester in this case is 45% cumulative score in the
prior qualification i.e., conventional two-year BA/BSc/equivalent degree programs. The admitting
university may however set higher eligibility criteria for admission in the fifth semester of the
undergraduate/equivalent degree program.
Admission Requirement:
Two-year Bachelor Degree with Math-A & Math-B course or Associate Degree in Science with Major
Mathematics (at least 18 Credit Hours) and Minor (Physics/Statistics etc.at least 06 credit hours) or
equivalent as per UE rules
Medium of Instruction and Examination:
The medium of instruction and examination shall be ENGLISH except Quran Course which is in Urdu. For
languages (e.g. Arabic), the medium of instruction and examination shall be that language.

Page No: 3 of 59
Award of Degree:

The Post Associate Degree will be awarded to the students if they successfully complete minimum 62
Credit Hours.
Deficiency Courses:
Following will be the deficiency courses which will be offered to students with classes of semester 1-4
Morning/Evening whichever is available.
To comply with HEC regulations, BS Post ADP programs are required to have a minimum of 74 credit
hours. Therefore, students coming from the annual system (BSc or ADP) who find the offered courses in
Post ADP mentioned in the semester breakdown to be less than 74 will be in need to take additional courses
from the following list to meet their degree requirements. It is pertinent to mention here that these courses
will be considered as non-graded for this program.

Credit
Sr. No: Course Code Course Name
Hours
1 MATH2113 Discrete Mathematics 3(3+0)
2 MATH2117 Ordinary Differential Equations 3(3+0)
3 STAT2115 Introduction to Statistics 3(3+0)
4 MATH1119 Computing Tools for Mathematics 2(0+2)
5 COMP2114 Database Systems 4(3+1)
6 PHYS1118 Mechanics 4(3+1)
7 COMP1114 Introduction to IT and Programming 4(3+1)
8 STAT2111 Introduction to Statistics and Probability 3(3+0)
9 MATH1118 Calculus 3(3+0)
10 MATH3122 Multivariable Calculus 3(3+0)
11 MATH3114 Linear Algebra 3(3+0)

Program Design
Categories No. of Courses Credit Hours
Foundation Courses 2 6
Major Courses/ Core Courses 13 41
Elective-I, II, III, IV, V Course 5 15 +
Total 20 62 +

Program Layout
Foundation Courses
Sr. No. Course Title Credit Hours
1 Real Analysis 3(3+0)
2 Group Theory 3(3+0)
Total 6
Major Courses
Sr. No. Course Title Credit Hours
1 Introduction to Graph Theory 3(3+0)
2 Partial Differential Equations 3(3+0)
3 An Introduction to Optimization Theory 3(2+1)
4 Mathematical Methods 3(3+0)
5 Introduction to Commutative Algebra 3(3+0)
6 Introduction to Algebraic Number Theory 3(3+0)
Page No: 4 of 59
 7 Mathematical Statistics 3(3+0)
8 Functional Analysis 3(3+0)
9 Rings and Modules 3(3+0)
10 Numerical Analysis 4(3+1)
11 Numerical Solutions of Differential Equations 4(3+1)
12 Topology 3(3+0)
13 Differential Geometry 3(3+0)
Total 41

Elective Courses
Sr. No. Course Title Credit Hours
1 Elective-I
2 Elective-II
3 Elective-III
4 Elective-IV
5 Elective-V
Total 15 +

Semester Breakup
Semester-I
Sr. No. Course Code Course Title Credit Hours
1 MATH4133 Introduction to Graph Theory 3(3+0)
2 MATH3125 Real Analysis 3(3+0)
3 MATH4117 Differential Geometry 3(3+0)
4 MATH3126 Topology 3(3+0)
5 MATH3128 Group Theory 3(3+0)
Total 15
Semester-II
Sr. No. Course Code Course Title Credit Hours
1 MATH4134 Partial Differential Equations 3(3+0)
2 MATH4113 Rings and Modules 3(3+0)
3 MATH3120 Mathematical Statistics 3(3+0)
4 MATH4141 An Introduction to Optimization Theory 3(2+1)
5 MATHXXXX Elective-I (From List of Elective Courses)
Total 12 +
Semester-III
Credit
Sr. No. Course Code Course Title
Hours
1 MATH4137 Numerical Analysis 4(3+1)
2 MATH4155 Mathematical Methods 3(3+0)
3 MATH4111 Functional Analysis 3(3+0)
4 MATHXXXX Elective-II (From List of Elective Courses)
Elective-III (From List of Elective
5 MATHXXXX
Courses)
Total 10 +

Page No: 5 of 59
 Semester-IV
Credit
Sr. No. Course Code Course Title
Hours
1 MATH4138 Introduction to Commutative Algebra 3(3+0)
2 MATH4131 Introduction to Algebraic Number Theory 3(3+0)
Numerical Solutions of Differential 4(3+1)
3 MATH 4139
Equations
Elective-IV (From List of Elective
4 MATHXXXX
Courses)
5 MATHXXXX Elective-V (From List of Elective Courses)
Total 10 +

List of Elective Courses

Sr. No. Course Code Course Title Credit Hours
1 MATH4116 Measure Theory 3(3+0)
2 MATH4140 Introduction to Mathematical Modeling 3(2+1)
3 MATH3124 Introduction to Cryptography 3(2+1)
4 MATH4142 Analytical Dynamics 3(3+0)
5 MATH4143 Theory of Spline functions 3(2+1)
6 MATH4144 Integral Equations 3(3+0)
7 MATH4129 Introduction to Riemannian Geometry 3(3+0)
8 MATH4145 Fuzzy Set Theory 3(3+0)
9 MATH4146 Algebraic Topology 3(3+0)
10 PHYS4136 Fluid Mechanics-I 3(3+0)
11 PHYS4137 Fluid Mechanics-II 3(3+0)
12 MATH4147 Introduction to Computational Fluid Dynamics 3(3+0)
Introduction to Regression and Analysis of
13 MATH4149 3(3+0)
Variance
14 MATH4150 Multivariate Analysis 3(3+0)
15 MATH4151 Statistical Decision Theory 3(3+0)
16 MATH4154 Introduction to Bio Mathematics 3(3+0)
17 PHYS4115 Relativity and Cosmology 3(3+0)
18 COMP3116 Data Mining 3(3+0)
19 COMP3140 Theory of Automata and Formal Languages 3(3+0)

Page No: 6 of 59
Course Outlines

Page No: 7 of 59
 Course Title: Introduction to IT and Programming

Course Code: COMP1114

Credit Hours: 4(3+1)

Course Objectives:

• To introduce students with Computer, its components and its applications in daily life,
studies and industries.
• Latest trends and Applications in the field of Computing

• The student will be able to understand basic designing techniques of programming

Course Content:

Introduction to Computers, History of Computers (four stages of history), Types of

Computers. Computer basics: Hardware, Software, Processor, Memory, Data, Information,
Data Storage and Data Manipulation. Number systems (Binary, Decimal and Hexadecimal
conversions), ASCII Codes. Input devices, Output devices, Communication and
Networking devices. Introduction to Computer Networks and Internet. Network types,
LAN, MAN and WAN, Introduction to Media Technologies (Wire Pair, Coaxial Cable,
Fiber Optics, Microwave, Radio Frequency, Infra-Red), Network Topologies and Protocols
Network Devices (Hub, Router, Switch, Bridge, Gateway), World-Wide Web, Digital
Media on the Web (Audio, Video, Animation. Introduction to Computer Security and Risks,
Mobile Computers and Desktops, Mobile Devices, Cloud Computing, Embedded
Computers, IoT Concept.

System software; uses and limitation, Types, BIOS (basic input/output system), Introduction
to Operating system, Drivers Utility software’s.

Programming Language Concepts: Introduction to Programming Languages, Introduction to

Algorithms, Flowcharts, Pseudocodes, Introduction to Computer Programming languages. What
is C/C++/Python Language, Getting Started with C/C++/Python Language, Computer Program
Engineering, Decision Control structure (if statement, Multiple Statements within if, if-else
statement, nested if-else, switch statement), logical operators’ hierarchy and conditional
operators.

Loops, Statements, Functions: Loop’s structure (for loop, while, do while), break
statement, continue statement, go to statement, case control structure, Function (Prototype,
Function Body, Declaration, Calling), User & system defined functions, Parameters,
arguments, Scope

Page No: 8 of 59
rule of functions, Advanced features of functions, Recursion, Fibonacci series, Recursion vs
iteration.

Arrays: Array initialization, Bounds checking, Passing array elements to functions, Passing an
entire array to a function, one dimension, initializing 2-Dimensional array and its application.

Recommended Books:
• Introduction to Computers, Peter Norton, latest edition.
• C++ how to program, DEITEL AND DEITEL 18
• Exploring Computers Complete latest edition by Floyd Fuller, Brian Larson.
• Microsoft® Office Access (TM) Step by Step Microsoft by Steve Lambert and M
Dow Lambert, 2007.
• Computer Fundamentals by P.K. Sinha 6th Edition
• Computer Science: An Overview (11th Edition) By J. Glenn Brookshear
• Let us C by Yashwant Kanetkar

Page No: 9 of 59
Course Title: Mechanics

Course Code: PHYS1118

Credit Hours: 4 (3+1)

Course Objectives:

The main objectives of this course are:

• To understand the different motions of objects on a macroscopic scale

• To develop simple mathematical formalisms to analyze such motions.

Course Content:

Vectors: Vectors and scalars, components of vectors, addition of vectors, vector multiplication.

Particle dynamics: Effect of frictional and drag forces on motion, Frame of Reference (inertial
and non- inertial), non-inertial frames and pseudo-forces.

Kinetic Energy and Work: Work-energy theorem, conservative and non-conservative forces.

Center of Mass and Linear Momentum: center of mass, Newton’s second law for a system of
particles, linear momentum, two particle and many-particle systems, center of mass of solid
objects, momentum changes in a system of variable mass. Collisions in the center-of-mass
reference frame.

Gravitation: Newton’s law of gravitation, gravitational effect of a spherical mass distribution,

Kepler’s laws of planetary motion.

List of Experiments:

• The Harmonic Oscillation of Helical springs-parallel and series connection of spring

• Measuring moments of inertia of different bodies; disc, hollow and solid cylinders.

• Radius of gyration.

• Value of g using compound pendulum

• Determine the Surface tension of water by capillary rise method.

Recommended Books:
• M. W. Zemansky, Richard H. Dittman, (2011), Heat and Thermodynamics,
8thEdition, McGraw-Hill

Page No: 10 of 59
• Resnick, Halliday & Walker (2008), Fundamental of Physics, 8th Edition New York:
John Wiley and Sons.
• Resnick, Halliday & Krane (2002). Physics Vol. I & II, 5th Edition. New York: John Wiley
and Sons.
• Halliday, Resnick & Krane (2010). Fundamental of Physics, 9th Edition. New York:
John Wiley and Sons.
• Sears, Zemansky & Young (2000), University Physics, 8th Edition. USA: Addison-
Wesley, Reading (MA).
• Alonso & Finn. (1999) Physics. USA: Addison-Wesley, Reading (MA).
• Raymond A. Serway, John W. Jewett Physics for Scientists and Engineers, 9thEdition.

Page No: 11 of 59
Course Title: Discrete Mathematics
Course Code: MATH2113

Credit Hours: 3(3+0)

Course Objectives:

This course will help the students to translate verbal statements into symbolic ones by using
the elements of mathematical logics. Further, this course will also help to develop better
reasoning power, problem-solving skills and logical thinking.

Course Content:

Mathematical Reasoning: Sets, Subsets, Algebra of Sets, Propositions and Compound

Statements, Basic Logical Operations, Propositional Logic and its Applications with Statement
Problems (Including Propositions and Truth Tables, Tautologies and Contradictions,
Conditional and Bi- Conditional Statements, Arguments, Propositional Functions, Quantifiers,
Negation of Quantified Statements Etc.), Relations, Equivalence Relations, Partial Ordering
Relations, Functions, Recursively Defined Functions,

Combinatorics: Basics of Counting Methods, Combinations, Permutations, Pigeonhole

Principal, Graphs and its Types, Graphs Isomorphism, Trees, Connectivity, Eulerian and
Hamiltonian Paths, Spanning Trees and Shortest Path Problem, Revisiting the Graphs of Power
Function, Floor Function, Increasing Function and Decreasing Function, Big O, Little O and
Omega Notations, Orders of the Polynomial Functions

Recommended Books:
 Rosen, K.H., 1999. Discrete Mathematics & Applications. McGraw-Hill.
 Susanna, S.E., 2018. Discrete Mathematics with Applications.
 Lipschutz, S., 2016. Schaum's Outlines of Theory and Problems of Discrete Mathematics

Page No: 12 of 59
 Course Title: Computing Tools for Mathematics

Course Code: MATH1119

Credit Hours: 2(0+2)

Course Objectives:

Upon successful completion of this course students will be able to

• Demonstrate an understanding of fundamental Mathematics by using math

software (Mathematica/MATLAB)
• Solve numerical and symbolic problems with use of advance math software
(Mathematica/ MATLAB)
• Convert problem solving strategies to procedural algorithms.
Course Content:

Formatting Tools:

Office: Introduction to MS Word and MS Power Point

Latex: Different Types of Documents, Page Styling and Formatting, Different Packages, Tables
and Images, Introduction to creating slides and different styles, Adding Frames, Reading
Different Error Messages.

Computing Tools:

MATLAB: Basic Computer Programming, Variables and Constants, Operators and Simple
Calculations, Formulas and Functions, Vectors and Matrices in MATLAB Matrix Operations
and Functions in MATLAB, MATLAB Scripts and Functions (M-Files), Simple Sequential
Algorithms, Control Structures (If…Then, For, While Loops), Personalized Functions,
MATLAB Plotting Functions.

Mathematica: An Interactive Front End with Notebook Interface, Basic Programming Tools
and Techniques. Includes Implicit and Explicit Functions, Two-Dimensional Expression Input,
Recursive Techniques, Scoping and Loop Commands, Conditionals, Etc. Manipulation of the
Basic Data Structure, Basic Visualization Tools and Embellishment, Manipulation and
Simplification of Algebraic Expressions, Solutions to Equations, Symbolic Manipulation.

Recommended Books:

Page No: 13 of 59
• Higham, D. J., & Higham, N. J. (2016). MATLAB guide. Society for Industrial and
Applied Mathematics.
• Knight, A. (2000). Basics of MATLAB® and beyond. CRC press.
• Cooper, J. (2001). A MATLAB Companion for Multivariable Calculus. Academic Press.
• Torrence, B. F., & Torrence, E. A. (2009). The Student's Introduction to
MATHEMATICA®: A Handbook for Precalculus, Calculus and Linear Algebra Cambridge
University Press.
• Mureşan, M. (2017). First Steps to Mathematica. In Introduction to Mathematica®
with Applications (pp. 5-12). Springer, Cham.
• Goossens, M., Mittelbach, F., & Samarin, A. (1994). The LATEX companion (Vol. 1).
Reading: Addison-Wesley.
• Grätzer, G. (2013). Math into LATEX. Springer Science & Business Media.
• Turban, E., Rainer, R. K., & Potter, R. E. (2001). Introduction to information tech.

Page No: 14 of 59
 Course Title: Ordinary Differential Equation
Course Code: MATH2117
Credit Hours: 3(3+0)

Course Objectives:

This course provides the foundation of all advanced subjects in Mathematics. Strong foundation
and applications of Ordinary Differential Equations is the goal of the course.

Course Content:

Introduction to Ordinary Differential Equations:

Basic Concepts of Ordinary Differential Equations, Classification of Ordinary Differential

Equations, Introduction to Initial-Value and Boundary-Value Problems, Existence and
Uniqueness of Solution.

Solutions of ODEs: Solutions of Separable, Homogeneous, Exact, and Linear ODEs; Solutions
of Bernoulli’s, Riccati’s, and Clairaut’s ODEs.

Higher Order Linear ODEs: Higher Order ODEs: Superposition Principle, Linear
Dependence, Linear Independence, Wronskian, Fundamental Set of Solutions, General Solution,
Homogeneous Linear Higher Order ODEs with Constant Coefficients, Reduction of Order,
Solution of Non- Homogeneous Higher Order Linear ODEs: Method of Undetermined
Coefficients, Annihilator Approach, Variation of Parameters; Applications of Second-Order
ODEs.

Series Solutions: Cauchy-Euler Equation, Power Series Solutions, Solutions about Ordinary
and Singular Points, Solutions of Bessel and Legendre Equations.

Laplace Transform: Solving ODEs by Using Laplace Transform and its Applications.

Recommended Books:

• William E. B and Richard C. D. (1992) Elementary Differential Equations and Boundary

Value Problems, John Wiley and Sons,
• Differential Equations with Boundary-Value Problems, 8th Edition by Zill, Dennis G.,
Wright, Warren S, published by Cengage Learning (2012)
• Morris M. and Brown O. E. (1964) Differential Equations, Prentice Hall
• Spiegel M.R. (1967) Applied Differential Equations, Prentice Hall.

Page No: 15 of 59
 Course Title: Database Systems
Course Code: COMP2114
Credit Hours: 4(3+1)

Course Objectives:

The course would cover the theoretical and practical aspects of database designing and
implementation and hands on practical lab session on a database server.

 To provide students a good understanding of the principles of database Analysis, Design

and Modeling techniques especially for creation of relational databases
 To have a fairly good practice in conceptual modeling using entity-relationship diagrams
 To learn how queries in SQL can be written correctly and efficiently
 Applying the concepts learned in the course to develop a real world application

Course Content:
The Context of Database Management: Characteristics of the Database Approach, A Brief
History of Database Applications, Types of Databases and Database Applications, Basic
Definitions, Typical DBMS Functionality, Main Roles in Database environment, Advantages of
Using the Database Approach, When Not to Use Databases, Database System Concepts and
Architecture: Database Environments, Three Schema Architecture and Data Independence,
Types of Databases ; Centralized Database, Personal Computer Database, Client/Server
database, Distributed Database, Homogeneous Distributed Database, Heterogeneous Distributed
Database

Database Design:
Modeling Data in the organization: Data Models, Schemas, and Instances, Entity–Relationship
Modeling: An Overview, Modeling the Rules of the Organization, Modeling Entities and
Attributes, Entity Types, ER Diagrams, Naming Conventions, and Design Issues, Example of
Other Notation: UML Class Diagrams, Modeling Relationship, Relationship types, Cardinality
and Participation Constraints, degree of relationship types( unary, binary, ternary ), Recursive
Relationship, Modeling Multiple Relationships Between entity types, Naming and Defining
relationships, E-R Modeling Example: Case Study

Specialization/Generalization for EERD: Super Classes & Sub Classes, Super Class / Sub
Class Relationships, Attributes Inheritance, Specialization Process, Generalization Process,
Constraints

Page No: 16 of 59
 on Specialization/Generalization, Aggregation, Composition, Relational Database Design by
ER and EER-to-Relational Mapping. Relational Database Design Using ER-to-Relational
Mapping, Mapping EER Model Constructs to Relations

Database Design Theory and Normalization: Purpose of Normalization, Data Redundancy &
Update Anomalies (Insertion, Update and Deletion Anomalies), Process of Normalization, First
Normal Form, Second Normal Form, Full Functional Dependency, Third Normal Form,
Transitive Dependency, Boyce-Coded Normal Form, Forth Normal Form, Multi-valued
Dependency, Fifth Normal Form (5 NF), Lossless-Join Dependency, Normalization Example:
Case Study

Overview of SQL: Objective of SQL, History of SQL, Importance & Environment of SQL,
Categories of SQL Commands (DML, DDL, DCL), Data Integrity, Types of Data integrity,
Entity Integrity, Domain Integrity, Referential Integrity, User-defined Integrity, Constraints,
Types of Data integrity (Entity Integrity, Domain Integrity, Referential Integrity, User-defined
Integrity), Constraints (PRIMARY KEY Constraint, UNIQUE Constraint, IDENTITY Property,
DEFAULT Definition, FOREIGN Key Constraint, CHECK Constraint. Queries, operators, Use
of Aggregate functions, subqueries, joins, Views, Triggers

Transaction Management, Deadlocks, XML and modern Databases: File organization and
storage structure, Unordered File, Ordered File, Hash Files, Hash Functions, Types of Indexes,
Indexed sequential Files, Secondary indexes, Multilevel indexes, B+ trees, Clustered, Non
Clustered Indexes, Threats, Counter Measures: Authorization, Views, Backup and Recovery,
Integrity, Encryption, RAID, Transaction and Scheduling, Concurrent Execution of
Transactions, Serials ability, Lock, Based Concurrency Control, Deadlocks, Concurrency
Control, Deadlock detection, Deadlock prevention, Time stamping, Database Application
Development, Structured, Semi structured, and Unstructured Data, XML Hierarchical (Tree)
Data Model, XML Documents, DTD, and XML Schema, Storing and Extracting XML
Documents from Databases, Extracting XML Documents from Relational Databases, Big Data
and Analytics
Recommended Books:
 Database Systems: A Practical Approach to Design, Implementation and Management
by Thomas Connally and Carolyn Begg, 6th Edition
 Modern Database Management by Jeffrey A. Hoffer, Ramesh Venkataraman and
HeikkiTopi , 12th Edition
 Fundamentals of Database Systems by RamezElmasri and Shamkant B. Navathe, 7th edition

Page No: 17 of 59
 Course Title: Introduction to Graph Theory

Course Code: MATH4133

Credit Hours: 3(3+0)

Course Objectives:

The main objectives of this course are to

• Explain different graphs with examples

• Tell applications of graph theory in diverse areas as Computer Science, Chemistry, and Biology.

Course Content:

Introduction to Graphs: Graphs and Digraphs, Operations, Graph walks, Distances, Diameter,
Incidence and Degree, Vertex and Edge Attributes, Eccentricity.

Structure and Representation: Graph Isomorphism, Subgraphs, Tests for Non-

Isomorphism, Matrix Representation, Connected, and Disconnected Graphs, Components

Trees: Characterizations and Properties of Trees, Distance and Centers in a Tree, Spanning
Trees.

Cut-Sets and Cut-Vertices: Cut-Sets, Some Properties of Cut-Sets, Fundamental Circuits and
Cut- Sets, Minimum Spanning Trees and Shortest Paths.

Planar and Dual Graphs: Planar Graphs, Subdivision &Homomorphism, Different

Representations of a Planar Graph, Detection of Planarity, Geometric Dual, Combinatorial

Dual, Optimal Graph Traversals: Euler Graphs, Hamiltonian Paths and Cycles, Traveling
Salesman Problem.

Coloring, Covering and Partitioning: Chromatic Number, Chromatic Partition and

Chromatic Polynomial, Matching, Coverings, The Four-Color Theorem

Recommended Books:

• Diestel, R. (2000). Graph Theory. USA, Springer-Verlag.

• West, D. B. (2000). Introduction to Graph Theory. Prentice-Hall of India.
• Dong, F. M. and Koh, K. M. (2005). Chromatic polynomials & Chromaticity of Graphs.
World Scientific.
• Coxeter, H. S. M & Moser, W. O. (2007). Generators and Relations for Discrete
Groups. Springer-Verlag

Page No: 18 of 59
Course Title: Differential Geometry
Course Code: MATH4117
Credit Hours: 3(3+0)

Course Objectives:

After having completed this course, the students would be expected to

 Understand classical concepts of differential geometry.

 Its connection and significance to the other area of Mathematics.
 Also extend many basic concepts and tools in the local theory of curves and
surfaces including normal, principal, mean, curvature, and geodesics.

Course Content:

Curves With Torsion: Curvature, Tangent, Principal, Normal, Binormal, Torsion, The
Osculating, Normal and The Rectifying Planes, Parameterization and Re-parameterization of
Space Curves, The Serret-Frenet Formulae, Serret-Frenet Form for Plane Curves, Arc Length
Parameterization of Curve and Related Curves, Spherical Curvature, Helices, Fundamental
Theorem of Plane and Space Curves, Involutes and Evolutes.

Theory Of Surfaces: Definition and Examples of Surfaces, Examples of Quadratic Surfaces,

Generalized Cylinders, Surface of Revolutions, Generalized Cones, Geometry and Metric of
Surfaces, First and Second Fundamental Forms, Gauss Map, Tangent and Normal Plan, One and

Two Parameter Family of Surfaces, Developable Surface Associated with the Curve, Shape
Operator, Weingarten Equation, Minimal Surfaces and Mean Curvature, Gauss Theorem

Classification Of Surfaces: First and Second Curvature, Euler’s Theorem, Euler Characteristic,
Meissner Theorem.

Recommended Books:

• Millman, R. S. and Parker, G. D. Elements of Differential Geometry. New Jersey, Prentice-

Hall Inc.
• Weatherburn, C. E. Differential Geometry. New Jersey, Prentice-Hall Inc.
• Neil, B. O. Elements of Differential Geometry. Academic Press.
• Goetz, A. Introduction to Differential Geometry. Massachusetts, Addison-Wesley

Page No: 19 of 59
Course Title: Topology

Course Code: MATH3126

Credit Hours: 3(3+0)

Course Objectives:

Upon successful completion of this course students will be able to

• Relate the previous knowledge with the terms, definitions and theorems related to the
topology
• Explain and classify the terms such as open and close sets, interior and boundary points
and closure
• Investigate the new topological spaces by using the subspace, product and quotient
topologies
• Examine the topological spaces by using the continuous functions and homeomorphisms.
• Construct the connections between the topology and other field of science.

Course Contents:

Metric Spaces: Open Sets, Closed Sets, Limit Points, Derived Set, Closure, Interior, Exterior,
and Convergence in Metric Spaces, Cantor’s Intersection Theorems, and Baire’s Theorem.

Topological Spaces: Topological Spaces and Elementary Concepts, Subspaces and

Relevant Topology, Open Base and Sub-Base, First and Second Countable Spaces. Separable
Spaces.

Continuity: Continuous Functions and Related Theorems, Homeomorphism.

Compact Spaces: Open Cover and Compact Space. Finite Intersection Property,
Compactness Theorems.

Connected Spaces: Connected Spaces, Examples and Related Theorems, Components.

Separation Axioms: To, T1, Hausdorff (T2) Spaces and Related Theorems, Regular Spaces,
Normal Spaces.

Recommended Books:
• George F. Simmons, (1963). Introduction to Topology and Modern Analysis. Robert E.
Krieger publisher Company Malabar, Florida.
• Armstrong, M. A. (2013). Basic topology. Springer Science & Business Media.
• Lipschutz, S. (1965). General Topology. New York, Tata McGraw-Hill
• James R. Munkres, (2000) Topology Second edition, Prentice Hall

Page No: 20 of 59
Course Title: Group Theory
Course Code: MATH3128
Credit Hours: 3(3+0)

Course Objectives:

In abstract algebra, group theory studies the algebraic structures, known as groups. The
main objectives of this course are:
 To introduce the basic concepts of groups and their properties.
 To understand and use the properties of subgroups and cossets.
 To describe and use the terms homeomorphism and isomorphism.
 To prepare students for courses which require a good back ground in group theory like
Rings and Modules, Linear Algebra, Group Representation, Galois Theory etc.
Course Content:
Groups: Types of Groups, Order of a Group, Order of An Element, Abelian and Non-Abelian
Groups, Subgroups, Cyclic Groups, Normal Subgroup and Related Theorems, Fundamental
Theorem of a Cyclic Group. Cayley’s Theorem.

Complexes In Groups: Complexes and its Permutability, Coset Decomposition of Groups,

Index of a Subgroup in a Group, Lagrange's Theorem and Applications, Centre of a Group,
Normalizer in a Group, Centralizer in a Group, Related Theorems, Conjugacy in Groups, Normal
Subgroups and Quotient Groups.

Group Homomorphism: Types of Homomorphism, Fundamental Theorems of

Homomorphism, Automorphism and Inner and Outer Auto morphism, Group of Automorphisms
Related Theorems, Characteristics Subgroups and Fully Invariant Subgroups.

Nilpotent and Solvable Groups, Direct Product of Groups: Nilpotent and Solvable Groups,
Internal and External Direct Product of Groups and Related Theorems.

Recommended Books:

• Dummit, D. and Foote, R. (2004). Abstract Algebra, John Wiley & Sons.
• Fraleigh, J. B. (1967). A First Course in Abstract Algebra. Pearson Education.
• Rose. J. S., A course on Group Theory, Cambridge University Press.

Page No: 21 of 59
Course Title: Partial Differential Equations
Course Code: MATH4134

Credit Hours: 3(3+0)

Course Objectives:

Upon successful completion of this course students will be able to

 Classify partial differential equations and transform into canonical forms

 Solve linear first and second order partial differential equations with different exact methods
such as method of characteristics, method of separation of variables and Eigen function
expansion method
 Apply partial derivative equation techniques to predict the behavior of certain phenomena
 Explain the modelling assumptions and derivations that lead to PDEs

Course Contents:

First Order PDEs: Classification of First Order PDEs, Method of Characteristics for PDEs
with Two or More Variables.

Second Order PDEs: Initial and Boundary Value Problems. Classification of Linear Second

Order PDEs, Canonical Forms, Reduction to Canonical Forms, Equations with Constant
Coefficients, General Solutions for Equations with Variable Coefficients.

Modelling: Mathematical Modelling and Derivation of Wave, Heat, Laplace Poisson

Equations in One-Dimension.

Wave Equation: General Solution of Wave Equation. Traveling Waves, D’Alembert’s

Solution, Non-Homogeneous Wave Equations, Method of Reflections (On Half Line, On A
Finite

Interval).

Heat Equation: Thermal Energy, Maximum Principle, Uniqueness of Solution, Non-

Homogeneous Heat Equation.

Laplace and Poisson Equations: Occurrence of the Laplace and Poisson Equations, Boundary
Value Problems, Dirichlet Problem for a Rectangle,

Page No: 22 of 59
 Separation of Variables: Methods of Separation of Variables for Wave, Heat, Lablace and
Poisson Equations, Orthogonality of Eigen Functions.

Recommended Books:
• Boundary Value Problems and Partial Differential Equations, by Mayer Humi and William
B. Miller published by PWS-KENT Publishing Company Boston, 1991.
• Myint, U. T. and Debnath, L. (2007). Partial Differential Equations for Scientists and
Engineers. Amsterdam, North Holland, Birkhauser.
• Elements of Partial Differential Equations by I. N. Sneddon, published by Mc-Graw Hill,
1987.
• Introduction to Partial Differential Equations and Boundary Value Problems by R.
Dennemyer, published by McGraw Hill, 1968.
• Elementary Applied Partial Differential Equations by R. Haberman, published by Prentice
Hall 1983.

Page No: 23 of 59
 Course Title: Rings and Modules

Course Code: MATH4113

Credit Hours: 3(3+0)

Course Objectives:

The main objectives are

• To investigate the properties of a Rings or Modules.
• To relate the concept of an ideal to homomorphisms and Factor Rings.
• To distinguish between the concepts of being prime and irreducible.
• To know the interrelationships between Euclidean Domains, Principal Ideal Domains and
Unique Factorization Domains
Course Content:

Rings: Rings and its types of Rings, Unit of Ring, Zero Divisors, Integral Domains, Fields,
Skew Fields. Characteristic of Ring, Idempotent Element, Boolean Rings.

Subring and Ideals: Subring, Centre of a Ring, Ideals and Its Types, Quotient Ring, Ring
of Polynomials, Ring of Fractions.

Integral Domains: Euclidean Domain, Unique Factorization Domains.

Homomorphism of Rings: Ring Homomorphism and Its Types, Kernel of Homomorphism,

Fundamental Theorems of Ring Homomorphism, the Chinese Remainder Theorem,

Modules: Vector Space and Related Concepts, Modules, Sub-Modules, Module

Homomorphism, Quotient Modules, Direct Sums and Related Theorems.

Recommended Books:

• Dummit, D. and Foote. R. (2004). Abstract Algebra. John Wiley & Sons.
• Fraleigh, B. (1967). A First Course in Abstract Algebra, Pearson Education.
• C. M. Polcino, S. K. Seghal, An Introduction to Group Rings, Kluwer Academic
Publisher, Netherlan, 2002.
• L. T. Gregory, Group Identities on Units and Symmetric Units of Group Rings, Springer-
Verlag, London., 2010.

Page No: 24 of 59
Course Title: An Introduction to Optimization Theory
Course Code: MATH4141

Credit Hours: 3(2+1)

Course Objective:

The main objective is to teach the basic notions and results of mathematical programming and
optimization. The focus will be to understand the concept of optimality conditions and the
construction of solutions. Students should have a good background in analysis, linear algebra
and differential equations.

Course Content:

Introduction to optimization, variables and objective function, stationary values and absolute
extrema, equivalence of minimum and maximum, convex, concave and uni-model functions,
constraints, mathematical programming problems, optimization of one-dimensional function,
optimization of two dimensional function and derivatives of sufficient conditions for existence
of optima, optimization of function of several variables, necessary and sufficient conditions for
its existence, optimization by equality constraints: direct substitution and Lagrange multiplier
methods, behavior of the Lagrangian functions, necessary and sufficient conditions for an
equality constrained optimum with bounded independent variables, inequality constraints and
Lagrange multipliers, optimization by direct search and gradient method, linear programming,
simplex algorithm, non- linear programming, linearization, The Kuhn-Tucker Theorem.

Lab Work: In MATLAB/Mathematica:

Matrix Operations, Minimum Cost Path, Finding Maximum Number in An Array, Array Sorting,
Linear Programming Problem, Queuing Problem, Sequencing Problem, Game Theory,
Assignment Problem, Dynamic Programming Problem, Inventory Problem

Recommended Books:
• Numerical Optimization by Jorge Nocedal and Stephen Wright, Springer Verlag; second
edition.
• Convex Optimization by Stephen Boyd and Lieven Vandenberghe, Cambridge University
Press.
• Nonlinear Programming by Dimitri P. Bertsekas, Athena Scientific; 2nd edition

Page No: 25 of 59
Course Title: Real Analysis
Course Code: MATH3125
Credit Hours: 3(3+0)

Course Objectives:

This is the first course in analysis. It develops the fundamental ideas of analysis and is aimed at
developing the students’ ability in reading and writing mathematical proofs. Another objective is
to provide sound understanding of the axiomatic foundations of the real number system. On
successful completion of this course, students will be able to describe the fundamental properties
of the real numbers that underpin the formal development of real analysis. Demonstrate an
understanding of the theory of sequences and series, continuity, differentiation and integration.
Demonstrate skills in constructing rigorous mathematical arguments. Apply the theory in the
course to solve a variety of problems at an appropriate level of difficulty.

Demonstrate skills in communicating Mathematics.

Course Content:

Order Fields and the Real Number System: Ordered Fields; Finite and Infinite Fields, Order
Relations and Ordered Fields, The Archimedean Property, The Extended Real Number System,
Completeness of Real Number, Euclidean Space, The Algebraic Completeness of the Complex
Field.

Riemann Integrals: Riemann Integral and Conditions for Existence. Properties of the Riemann
Integrals, Improper Integrals, Fundamental Theorem of Calculus, Improper Integrals of the First

Kind and Second Kind and Mixed Type, Cauchy Criteria for Infinite Integrals, Uniform
Convergence of Improper Integrals.

Functions of Several Variables: Continuity and Differentiability of Multivariable Functions,

Extreme Value of a Function of Several Variables, The Inverse Function Theorem, The Implicit
Function Theorem, The Rank Theorem. Function of Bounded Variations.

Sequence and Series of Functions: Point-Wise Convergence, Uniform Convergence, Uniform

Convergence and Continuity, Uniform Convergence and Differentiation, Uniform Convergence
and Integration, Absolute Convergence, Cauchy Criterion, Weierestress M-Test. Able’s Test,
Dirichlet's Test.

Page No: 26 of 59
 Recommended Books:

• Bartle. R. (2008). Introduction to Real Analysis. John Wiley & Sons.

• Ruddin, W. (1976). Principles of Mathematical Analysis. McGraw-Hill Book Company.
• Widder, D.V. (1982) Advanced Calculus, Prentice-Hall.
• H. L. Royden H.L. (1988) Real Analysis, third edition, published by Prentice Hall.

Page No: 27 of 59
 Course Title: Numerical Analysis

Course Code: MATH4137

Credit Hours: 4(3+1)

Course Objectives:

Upon successful completion of this course students will be able to

• Derive and explain the numerical methods for various mathematical operations and tasks, such
as interpolation, differentiation, integration, the solution of linear equations
• Analyze and evaluate the accuracy of such numerical methods
• Implement a variety of numerical algorithms using a suitable programming language
• Understand the numerical techniques to solve the system of equations and non-
homogeneous system of equations
• Investigate the limitations, advantages, and disadvantages of numerical methods.

Course Contents:

Error Analysis: Errors and Its Types, Convergence of Numerical Solutions, Order of
Accuracy.
Solution of Non-Linear Equations: Bisection Method, Fixed Point Iterative Method, Newton’s

Methods, Secant Method, Regula Falsi Method, Muller’s Methods. Order of Convergence of
Newton, Secant and Fixed-Point Iterative Method.

Solution of System of Linear Equations: Iterative Methods for Solving Systems of Linear
Equations: Jacobi, Gauss-Seidel, Relaxation Method.

Interpolations: Difference Operators, Types and their Relationships, Interpolation with Equal
Intervals: Gregory Newton Forward/Backward Interpolation Formula.

Central Difference Interpolation Formulae: Gauss Forward/Backward Interpolation

Formula, Stirling’s Formula, Laplace Everett’s Formula, Bessel’s Formula, Interpolation with
Unequal Intervals: Newton’s Divided Difference Formula, Lagrange’s Interpolation Formula.

Numerical Differentiation: Numerical Differentiation Using Newton’s Forward Interpolation

Formula and Lagrange’s Formula.

Page No: 28 of 59
 Numerical Integration: General Quadrature Formula, Trapezoidal, Simpson Formulae,
Weddle’s Rule by Using Newton Cotes Formula, Errors in Trapezoidal and Simpson’ Formulae,
Two- and Three-Point Gaussian Quadrature Formulae

Lab Work: In MATLAB/Mathematica:

Basic Matrix Operations, Solve Linear Equation, Finding Roots, Numerical Differentiation and
Integration by the above Listed Methods.

Recommended Books:
• Gerald. C. and Wheatley, P. (2003). Applied Numerical Analysis. Addison-Wesley.
• Burden. L. and Douglas. J. (2015). Numerical Analysis. Brooks/Cole Publishing Company
• Moler, C. B. (2004). Numerical computing with MATLAB. Society for Industrial and
Applied Mathematics.
• Karris, S. T. (2007). Numerical analysis using MATLAB and Excel. Orchard Publications.
• Moler, C. B. (2004). Numerical computing with MATLAB. Society for Industrial and
Applied Mathematics.

Page No: 29 of 59
 Course Title: Functional Analysis
Course Code: MATH4111
Credit Hours: 3(3+0)

Course Objectives:

Upon successful completion of this course students will be able to

• Explain the Normed Spaces, Inner Product Spaces, Hilbert Spaces and Banach Spaces.
• Use properly the specific techniques for Bounded Operators over Normed and Hilbert Spaces.
• Apply the knowledge of functional analysis to solve the mathematical problems in other fields
of science and engineering. Pursue further studies in this and related areas.
Course Content:

Normed Spaces: Definition and Examples, Banach Spaces, Convergence in Normed Spaces,
Basis of a Normed Space, Quotient Spaces, Equivalent Norms, Finite Dimensional Normed
Spaces and their Completeness.

Linear Operators: Linear Operators, Inverse of a Linear Operator, Continuous and Bounded
Linear Operators, the Space of Bounded Linear Operators.

Linear Functional: Linear Functional and its Continuity, Dual or Conjugate Space of a Normed
Space, Isometric Isomorphism.

Hilbert Spaces: Preliminaries of Inner Product Spaces and its Consequences, Cauchy Schwartz
Inequality, Parallelogram Law of Identity, Inner Product Spaces on Metric Spaces, Continuity
and Cauchy Sequences in Inner Product Spaces, Hilbert Spaces, Orthogonal Systems,
Pythagorean Theorem and Generalized Pythagorean Theorem, Orthonormal System,
Orthogonalization Theorem, Bessel’s Inequality, Annihilators, Orthogonal Complements-Direct
Decomposition, Closed Subspaces of Hilbert Space, Riesz Representation Theorem.

Recommended Books:
• Taylor, A. E. and Lay, D. C. Introduction to Functional Analysis. John Wiley
• Dover, K. E. Introductory Functional Analysis with Applications. John Wiley
• Kreyszig E, Introductory Functional Analysis and Applications, John Wiley and Sons
• Maddox L, Elements of Functional Analysis, Cambridge University Press

Page No: 30 of 59
Course Title: Mathematical Methods
Course Code: MATH4155
Credit Hours: 3(3+0)

Course Objectives:

Upon successful completion of this course students will be able to

• Apply Fourier Transform, Laplace Transform and Hankel Transform to physical problems
• Understand Green's Functions, Sturm-Liouville Eigenvalue Problem and their
physical applications
• Apply mathematical tools and techniques that are required in advanced courses offered in
the applied physics and engineering programs.
• Understand the working knowledge of mathematical methods used in real life problems.

Course Content:

Series Solutions: about an Ordinary Point and Regular Singular Point, Sturm-Liouville Theory,
Self-Adjoint ODEs, Orthogonal Functions, Hermitian Operators, Eigenvalue Problems,

Functions: Completeness of Eigen Functions, Green’s Functions, Green’s Function for One-
Dimensional Problem, Eigen Function Expansion of Green’s Function, Special Functions,
Gamma Function, Digamma and Polygamma Functions, Stirling’s Series, Beta Function, Bessel
Functions of First Kind, , Orthogonality, Neumann Functions, Bessel Functions of The Second
Kind, Hankel Functions, Modified Bessel Functions, Asymptotic Expansions, Spherical Bessel
Functions, Legendre Functions, Legendre Polynomials, Orthogonality, Generating Function,
Recurrence Relation, Associated Legendre Equation, Spherical Harmonics, Orbital Angular
Momentum Operator, Addition Theorem For Spherical Harmonics, Legendre Functions of The
Second Kind, Hermite Functions, Hermite Equation as Schrödinger Equation of Quantum
Harmonic Oscillator, Laguerre Functions and Associated Laguerre Functions, Fourier series,
Properties of Fourier Series, Fourier Transform, Properties of Fourier Transforms, Fourier
Convolution Theorem, Fourier Transform Discrete Fourier Transform, Laplace Transforms,
Properties of Laplace Transforms, Laplace Transform of Derivatives, Laplace Convolution
Theorem, Inverse Laplace Transform.

Recommended Books:

• Mathematical Methods for Physicists (7th Edition) by G. B. Arfken, H. J. Weber and F.E.
Harris, Academic Press (2012)

Page No: 31 of 59
• A Guide to Mathematical Methods for Physicists by M. Petrini, G. Pradisi and A.
Zaffaroni, World Scientific Press (2017)
• Mathematical physics: A modern introduction to its foundations by S. Hassani, Sadri,
Springer (2013)
• Dennery, Philippe, and André Krzywicki, Mathematics for physicists, Dover
Publications (2012)
• Mathematical methods for physics and engineering by K. F. Riley, M. P. Hobson, and
S. J. Bence (3rd Edition), Cambridge (1999)
• Mathematical Methods for Physicists: A Concise Introduction by T. L. Chow, Cambridge
(2000)

Page No: 32 of 59
 Course Title: Introduction to Commutative Algebra
Course Code: MATH4138
Credit Hours: 3(3+0)

Course Objectives:

Upon successful completion of this course students will be able to

• Gain familiarity with the polynomial ring and be able to perform basic operations with
both elements and ideals.
• Explain computational tools, especially Gröbner basis and the Buchberger algorithm, to
solve problems in polynomial rings; finding solutions to polynomial equations
• State accurately and be able to explain the proofs of the main results of this subject
• Apply theory of commutative algebra in other fields of science and engineering such
as kinematics, robotics and physics.
Course Content:

Commutative Rings and Subrings: Definitions of Commutative Rings and Subrings,

Properties of Commutative Rings and Subrings, Subring Criterion, Ring Homomorphism, R-
Algebra, Group Algebra.

Ideals: Ideals, Prime and Maximal Ideals, Hilbert’s Nullstellensatz, Modules, Operations on
Modules, Localizations with respect to Multiplicatively Closed Sets and With Respect to
Prime Ideals, Local Rings and Local Properties, Localization of Modules, Chain Conditions,
Prime Ideals and Maximal.

Gröbner Basis: Basics of Gröbner Basis, Buchberger's Algorithm and its Applications.

Recommended Books:
• Sharp, R. Y. (2000). Steps in commutative algebra (No. 51). Cambridge university press.
• Eisenbud, D. (2013). Commutative Algebra: with a view toward algebraic geometry (Vol.
150). Springer Science & Business Media.
• Greuel, G. M., & Pfister, G. (2012). A Singular introduction to commutative algebra.
Springer Science & Business Media.

Page No: 33 of 59
 Course Title: Introduction to Algebraic Number Theory

Course Code: MATH4131

Credit Hours: 3(3+0)

Course Objectives:

Upon successful completion of this course students will be able to

• Understand the concepts of different types of domains

• Understand the details about algebraic numbers and their properties

• Grip the idea of integral closure

• Understand about the Algebraic Number Fields

Course Content:

Domains: Definitions and Examples of Integral Domains, Euclidean Domains. Examples of

Domains which are not Euclidean, Representation of Primes by Quadratic Forms, Noetherian
Domains, Unique Factorization Domains

Integral Closure: Definition of Integral Elements, Elements Integral over Domain, Integral
Closure and its Examples

Algebraic Numbers and Algebraic Integers: Rings of Integers, Norms and Traces, p-
adic Integers and p-adic Numbers, The p-adic Valuation

Algebraic Number Fields: Algebraic Extensions, Minimal Polynomial of Algebraic Elements

over a Field, Conjugates of Algebraic Integers, Definition and Examples of Algebraic Number
Fields, Conjugate Fields of Algebraic Number Fields, Minimal Polynomial of Algebraic
Number Fields, Prime Ideals in Ring of Integers

Recommended Books:
• Dummit. D. and Foote. R. (2004). Abstract Algebra. John Wiley & Sons.
• Fraleigh. B. (1967). A First Course in Abstract Algebra. Alaca, Pearson Education
• Williams, K. Introductory Algebraic Number Theory. Cambridge University Press.
• Joseph H. Silverman (2006) A Friendly Introduction to Number Theory, third edition,
Prentice Hall.

Page No: 34 of 59
Course Title: Numerical Solutions of Differential Equations

Course Code: MATH4139

Credit Hours: 4(3+1)

Course Objectives:

Upon successful completion of this course students will be able to

• Derive and explain the numerical methods for approximating the Eigen-values, nonlinear
systems of equations, initial and boundary value problems
• Analyze and evaluate the accuracy of such numerical methods
• Implement the numerical algorithms using a suitable programming language
• Solve the initial and boundary value problems numerically
• Investigate the limitations, advantages, and disadvantages of numerical methods.

Course Content:

Eigen-Values Approximation: Approximating the Eigen-Values by Using Power Method, and

Raleigh Quotient Method.

Numerical Solutions for Nonlinear System of Equations: Numerical Solutions by

Newton’s Methods, Quasi-Newton’s Method, Steepest Descent Method.

Initial Value Problems

Single Step Methods: Taylor Method, Euler, Improved Euler and Modified Euler Methods,
Runge- Kutta Methods, Runge-Kutta- Fehlberg Method.

Multistep Methods: Milne’s Method, Adams-Bashforth Method.

Boundary Value Problems: Shooting Methods for Linear and Non-Linear BVPs, Finite
Difference Methods for Linear and Nonlinear BVPs.

Lab Work: Implementation of the above listed methods Using MATLAB/Mathematica.

Recommended Books:
• Dormand, J. R. (1996). Numerical methods for differential equations: a
computational approach (Vol. 3). CRC press.
• Butcher, J. C., & Goodwin, N. (2008). Numerical methods for ordinary differential
equations (Vol. 2). New York: Wiley.

Page No: 35 of 59
• Liu, F., Zhuang, P., & Liu, Q. (2015). Numerical methods of fractional partial differential
equations and applications.
• Burden. L. and Douglas. J. (2015). Numerical Analysis. Brooks/Cole Publishing Company
• Chapra, S. C., & Canale, R. P. (2011). Numerical methods for engineers (Vol. 2). New
York: Mcgraw-hill.
• Moler, C. B. (2004). Numerical computing with MATLAB. Society for Industrial and
Applied Mathematics.

Page No: 36 of 59
Course Title: Measure Theory

Course Code: MATH4116

Credit Hours: 3(3+0)

Course Objectives:

The main objectives of this course are to:

• Understand Riemann and Riemann-Stieltjes Integralable Functions.

• Understand Lebesgue Measurable Sets, Non-Measurable Sets, Cantor Set.

• Understand Lebesgue Integral.

• Understand Lebesgue Spaces.

Course Content:

Measurable Sets: Algebra of Sets, Sigma Algebra with Examples, Outer Measure, Lebesgue
Measure, Lebesgue Measurable Sets, Borel Sets, Non-measurable Sets.

Measurable Functions: Lebesgue Measurable Functions, Simple Functions, Characteristic

Functions, Borel Measurable Functions, Littlewood Three Principles.

The Lebesgue Integration: Review of the Riemann Integral, Lebesgue integral, Integral of a Non-
negative Function, Integral of Measurable Functions, Convergence in Measure.

Recommended Books:
• Douglas, S. A (2011). Transition to Advanced Mathematics. Cengage Learning, Inc.
• Royden, H. L. and Fitzpatick, P.M. (2009). Real Analysis, 4th Edition, China Machine
Press.
• Cohn. D. L. (1980) Measure Theory,Birkhauser
• Halmos P.R. (1950) Measure Theory, D. VanNostrand

Page No: 37 of 59
Course Title: Introduction to Mathematical Modeling

Course Code: MATH4140

Credit Hours: 3(2+1)

Course Objectives:

The main objective of this course is to:

 Provide the students with a range of mathematical methods that are essential to the
solution of advanced problems encountered in the fields of medical science and
engineering.
 Provide the students with mathematical tools and techniques that are required in
advanced courses offered in the MS and PhD programs in this field.

Course Content:

Fundamental Concepts of Modelling: Basics, Types of Models, Classification of Models as

Qualitative Models and Quantitative Models

Mathematical Modelling: Basics, Goals of Modelling Process, Guidelines for Modelling

Process, Modelling Cycle, Domain of Validity of a Model, Important Factors in Mathematical
Modelling, The Role of Mathematician

Models Deduced from Variation Principles: Equation of Motion, Conservation Laws in

Mechanics, Model of Some Mechanical Systems

Mathematical Modelling Applications: Dimension Analysis, Buckingham’s Π-Theorem, The

Bromsulphalein Test, Enzyme Kinetics, Population Models: Geometric Growth and Predator-
Prey Interaction

Lab Work: Simulation of Epidemiological Models (SIR and it's variants) in MATLAB.

Recommended Books:

• Principle of Mathematical Modelling by A.A samarkaii and A. Mikhailov (2002)

• An Introduction to Mathematical Modelling by Michael D Alder (2001)
• Exploration of Mathematical Models in Biology with MATLAB by Maen Shahin (2014).
• Methods of Mathematical Modeling, Continuous Systems and Differential Equations by
Thomas Witelski and Mark Bowen (2015).

Page No: 38 of 59
Course Title: Introduction to Cryptography

Course Code: MATH3124

Credit Hours: 3(2+1)

Course Objectives:

Upon successful completion of this course students will be able to:

• Understand Mathematics and Algorithms of Cryptography

• Apply a simple Shift Cipher to Encode messages

• Represent a Shift Cipher as a function and a graph

• Identify the Symmetric and Asymmetric Ciphers

• Describe and analyses the Diffie-Hellman Key Exchange, ElGamal Public Key Cryptosystem
and Collision Algorithm for the DLP

• Effectively communicate across the disciplines.

Course Contents:

Introduction to Cryptography: Simple Substitution Ciphers, Divisibility and Greatest

Common Divisors, Modular Arithmetic, Prime Numbers, Unique Factorization, and Finite
Fields, Powers and Primitive Roots in Finite Fields, Simple Substitution Ciphers,
Cryptography before the Computer Age, Symmetric and Asymmetric Ciphers.

Discrete Logarithms and Diffie-Hellman: The Birth of Public Key Cryptography, The
Discrete Logarithm Problem, Diffie-Hellman Key Exchange, ElGamal Public Key
Cryptosystem, Collision Algorithm For the DLP.

Integer Factorization and RSA: Euler’s Formula and Roots Modulo 𝑝𝑞, The RSA Public Key
Cryptosystem, Implementation and Security Issues, Primality Testing, Pollard’s P-1
Factorization Algorithm.

Elliptic Curve Cryptography: Elliptic Curves, Elliptic Curves over Finite Fields, the Elliptic
Curve Discrete Logarithm Problem, Elliptic Curve Cryptography.

Recommended Books:

Page No: 39 of 59
 Hoffstein, J., Pipher, J., Silverman, J. H., & Silverman, J. H. (2008). An
introduction to mathematical cryptography (Vol. 1). New York: Springer. Howal, S.
S.
 Yan, S. Y. (2013). Computational Number Theory and Modern Cryptography. John
Wiley & Sons.
 Alfred Menezes, Paul van Oorschot and Scott Vanstone (2001). Handbook of
Applied Cryptography. CRC Press.

Page No: 40 of 59
 Course Title: Analytical Dynamics

Course Code: MATH4142

Credit Hours: 3(3+0)

Course Objectives:

The aim of this course is

• To understand the Lagrangian and Hamiltonian formalisms of the laws of motion, which
are generalizations of Newton’s equations of motion
• To learn the related mathematical methods such as coordinate transformations and
variational methods, and
• To apply the formalisms of analytical dynamics to actual problems.

Course Content:

Dynamical Systems:

Constraints: Holonomics and Non-Holonomics Constraints, Conservative and Non-

Conservative System, Generalized Coordinates, Degrees of Freedom, Generalized Forces and
Velocities, Kinetic Energy, Principle of Virtual Work, D’Alembert Principle, Derivation of
Lagrange’s Equation of Motion Using D’Alembet Principle.

Generalization of Lagrange Equations: Equations of Motion Involving Derivatives of the

Kinetic Energy and the Quasi Coordinates. First Integrals of the Equations of Motion; Energy
Integral, Ignorable Coordinates and Routhian Function.

Lagrange Theory of Holonomic and Non-Holonomic Systems: Lagrange’s Equations for

Holonomic and Non-Holonomic System; Equations of Motion with or without Lagrange
Multiplier. Hamiltonian Theory of Holonomic System: Hamilton’s Principle, Hamilton’s
Equation, Canonical Transformations, Generating Functions, Lagrange & Poisson Brackets; The
Bilinear Covariant, Infinitesimal Contact Transformations, Hamilton’s Principal Function;
Hamilton Jacobi Equation.

Recommended Books:
• David Morin (2008). Introduction to Classical Mechanics: With Problems and
Solutions. Cambridge University Press.
• John R. Taylor (2005). Classical Mechanics. University Science Books.
• H. Goldstein. (1950). Classical Mechanics. Addison-Wesley.
• Tai L. Chow. (2013). Classical Mechanics 2nd Edition, John Wiley & Sons Inc.70

Page No: 41 of 59
• V. D. Barger & M. G. Olsson. (1995). Classical Mechanics. New York: McGraw-Hill.
• L. N. Hand & J. D. Finch. (1998). Analytical Mechanics. Cambridge University Press,
Cambridge

Page No: 42 of 59
Course Title: Theory of Spline Functions

Course Code: MATH4143

Credit Hours: 3(2+1)

Course Objectives:

Upon successful completion of this course students will be able to

• Have strong background on numerical approximation strategies
• Learn interactive graphics techniques for defining and manipulating geometrical shapes used
in computer animation, car body design, aircraft design, and architectural design
• Implement various curve interpolation and approximation techniques that allow the
interactive specification of three-dimensional curves (e.g. Bezier, B-spline, rational curves).
• Integrate the curve and surface modules into a system that allows the user to interactively
design and store simple & 3D Geometries
Course Contents:

Transformations of the Plane: Basic Concepts of Euclidean Geometry, Scalar and Vector
Functions, Translations, Rotation about the Origin, Scaling About the Origin, Reflection, Shear,
Concatenation of Transformations.

Homogeneous Coordinates and Transformations of the Plane: Homogeneous Coordinates,

Points at Infinity, Transformations in Homogeneous Coordinates, Translations, Rotation about
the Origin, Scaling About the Origin, Reflection, Concatenation of Transformations, Inverse
Transformation, Rotation about an Arbitrary Point, Reflection in an Arbitrary Line.

Parametric Curves: Parametric Curves (Scalar and Vector Case), Algebraic Form, Hermite
Form, Control Point Form, Bernstein Bezier Form, Matrix Forms of Parametric Curves,
Algorithms to Compute B.B. Form, Convex Hull Property, Affine Invariance Property,
Variation Diminishing Property, Rational Quadratic Bazier Form, Rational Cubic Bezier Form,
Tensor Product Surface,
B.B. Cubic Patch, Quadratic by Cubic B.B. Patch, B.B. Quartic Patch.

Lab Work: In MATLAB/Mathematica:

Implement Transformations on different 2D and 3D curves, Draw the Graphical Behavior of

Bezier Basis, Hermite Basis Function, Draw Parametric Curves in 2D and 3D Forms, Draw
Rational Curves in 2D and 3D Forms, Draw Different Properties of Parametric Curves Like
(Convex Hull Property,

Page No: 43 of 59
Affine Invariance Property, Variation Diminishing Property), Check the Effect of Shape
Parameter used in Rational Curves, Apply Parametric and Rational Curves to Design Different
Models like Car Model, Logo, Vase, Font designing etc.

Recommended Books:
 David, S. (2006). Curves and surfaces for computer graphics. New York: Springer
Science + Business Media Inc.

Page No: 44 of 59
Course Title: Integral Equations

Course Code: MATH4144

Credit Hours: 3(3+0)

Course Objectives:

Upon successful completion of this course students will be able to:

• Identify the types of integral equations
• Solve the Integral equations by different methods and rules
• Solve the Integral equations by Initial-Boundary Value problems
• Solve the Fredholm, Volterra, Integro-Differential equations
• Differentiate and solve the linear and Non-linear Integral equations.

Course Content:

Basics of Linear Integral Equations: Basic Concepts of Integral Equation, Classification of

Linear Integral Equations, Variational Iterative Methods, Direct Computation Methods.

Fredholm Linear Integral Equations: Homogenous Fredholm Integral Equations, Fredholm

Integral Equation of First Kind, Converting Boundary Value Problem into Fredholm Equation.

Volterra Linear Integral Equations: Volterra Linear Integral Equation, Converting Initial
Value Problem into Volterra Equation and Vice Versa, the Variational Iteration Method,
Volterra Integral Equations of the First Kind.

Integro-Differential Equations: Fredholm Integro-Differential Equations, Variational Iterative

Method, Direct Computation Method, Converting Fredholm Integro-Differential Equations to
Fredholm Integral Equations, Volterra Integro-Differential Equations, Singular Integral
Equations, The Generalized Abel’s Integral Equation.

Nonlinear Integral Equations: Nonlinear Equations of First and Second Kind with Variable
Limits of Integration.

Recommended Books:
• Kress, R., Maz'ya, V., &Kozlov, V. (1989). Linear integral equations (Vol. 82, p. 1).
Berlin: Springer.
• Polyanin, A. D., & Manzhirov, A. V. (2008). Handbook of integral equations. CRC press.
• Jerri, A. (1999). Introduction to integral equations with applications. John Wiley & Sons.

Page No: 45 of 59
Course Title: Data Mining

Course Code: COMP3116

Credit Hours: 3(3+0)

Course Objectives:
Data mining or the discovery of knowledge in large datasets has created a lot of interest in the
database and data engineering communities in recent years. The tremendous increase in the
generation and collection of data has highlighted the urgent need for systems that can extract useful
and actionable knowledge from large datasets.

 Provide a comprehensive introduction to the data mining process; built theoretical and

conceptual foundations of key data mining tasks such as association rules mining, classification
and clustering;
 Discuss analysis and implementation of algorithms; and introduce major research sub-areas

such as text mining and web mining.

 Provide hands on experience through the implementation of algorithms in programming
exercises.
 Provide a discussion on state of the art researches in data mining and its applications

Course Content:

Overview and Pre-processing: Need and motivation; data mining process; data mining tasks and
functionalities, interestingness measures. Types of Data, Data cleaning, data integration and
transformation, data reduction, discretization, concept hierarchies. Types of Data, Data cleaning,
data integration and transformation, data reduction, disc recitation, concept hierarchies, data
integration and transformation, data reduction, disc recitation, concept hierarchies.

Mining Association Rules: Basic definitions, market basket analysis, types of association rules,
interestingness measures, frequent Item-set generation, Apriority algorithm, TID Apriority
algorithm, Hybrid Apriority algorithm, FP- growth algorithm, mining multilevel, multidimensional
and quantitative association rules.

Classification: Concept of classification, Decision tree approach, Naïve Bays Approach, Accuracy of
the system? Bayesian classification, Rule-based classification, Classification by back propagation.

Clustering: Basic terminology, Partitioning methods: K-Means, K-Medoids, CALARANS

Hierarchical methods: BIRCH, CURE etc Density based methods: DBSCAN, OPTICS Grid based
methods: STING, Wave Cluster, CLIQUE

Page No: 46 of 59
Evaluation of Classifiers: Classification with Train, Test, and Validation sets Evaluation
Criteria, Metrics for Performance, Accuracy, Cost Matrix, Cost Sensitive Measures, Methods for
Performance Evaluation (Holdout, Random Sampling, Cross Validation, Stratified sampling,
Bootstrap) ROC Curve
Mining Complex Data Types and Applications: Mining text databases, mining the Web,
mining time-series and sequence datasets. Targeted Marketing and Customer Modeling, Data
Mining and Society; Future Directions
Recommended Books:
 Data Mining: Concepts and Techniques, Jiawei Han and MichelineKamber, Morgan
Kaufmann, Publishers, 2001.
 Data Mining: Concepts, Models, Methods, and Algorithms, Mehmed Kantardzic, Wiley, 2003.
 Principles of Data Mining, D. Hand, H. Mannila and P Smyth, MIT, 2001.
 Selected research papers

Page No: 47 of 59
Course Title: Theory of Automata and Formal Languages

Course Code: COMP3140

Credit Hours: 3(3+0)

Course Objectives:

The course introduces some fundamental concepts in automata theory and formal languages
including Grammar, Finite automaton, Regular Expressions, Pushdown automaton, and Turing
machine. Theory of Automata and Formal Languages not only the basic models of computation but
also the foundation of many branches of computer science, e.g. compilers, software engineering
etc.
The goal of this course is to make the students familiar with fundamental principles of computability.

 To give them an insight into the theory and design of problem solving in conventional and
modem computing machines.
 To bring a practical approach in the students, so that they can initiate design and
implement solution of a problem.
 To give them the understanding of mathematical models of the computing machines.
To understand the decidability and computability of the computational problems.
 To make students able to practically implement the ideas gained in the subject of
Modem programming languages.
 To prepare students for the study of compiler construction.
Course Content:

Basic concepts of Finite Automata and Languages: Introduction to Finite Automata, word, null
string, length of a string, reverse of a string, Palindrome, Kleene‘s closure, Formal definition of
Regular Expressions, defining languages with regular expressions, Languages associated with
regular expressions. Equivalent non Equivalent Regular Expressions. Deterministic finite
automaton, Non Deterministic

Transition Graphs, Kleene’s Theorem: Differences between FA and NFA. More examples
related to NFA. Transition Graphs with examples, Generalized Transition Graphs, Non-
determinism in case of Transition Graphs., Equivalence between DFA and NFA Kleene‘s
Theorem: Converting Regular Expressions into FA‘s. Converting NFA into Regular Expression,
converting NFA into DFA, Properties of Regular Languages by using NFA and DFA (i.e. Union,
Concatenation, Kleene closure,

Page No: 48 of 59
Complements and Intersections), Decidability, decision procedure, Decision to prove whether two
given RE‘s or FA‘s are equivalent. Checking whether languages are finite or infinite.

Non Regular Languages, Moore and Mealy Machines, Parsing: Non-Regular Languages, The
pumping Lemma, Finite Automata with output. Moore and Mealy Machines, Context-Fee
Grammars and Languages, Derivations, Grammar conversion into language, Languages
conversion into Grammars, Parsing (or derivation) Leftmost and Rightmost derivations, Parse
Trees, Total language tree.

Grammar and Languages, CFG’s: Ambiguity of grammar and Languages, Unambiguous

CFG‘s. Simplification of CFG‘s. Killing Null productions, killing unit productions, Killing of
Useless Productions, Chomsky Normal Forms and Greenbush normal forms.

Pushdown automaton (PDA): Pushdown-automata, Various forms of PDA, Pushdown stack.

DPDA, Nondeterministic PDA, Equivalence between CFG and PDA, CFG Conversion to PDA,
Context Free Languages, their Closure Properties, Union, Concatenation and Kleene‘s Closures
using CFG‘s, Turing machines, Turing Recognizable Languages, Halting Problem, and Defining
Computers by TM‘s. Computable Functions

Recommended Books:
 Introduction to Computer Theory‖, Daniel I. A. Cohen
 Introduction to Formal Languages and Automata by P. Linz.
 Introduction to the Theory of Computation by Michael Sipser,

Page No: 49 of 59
Course Title: Introduction to Riemannian Geometry

Course Code: MATH4129

Credit Hours: 3(3+0)

Course Objectives:

Upon successful completion of this course students will be able to

• Describe the fundamental notions of connection and curvature
• Explain of the geometry of sub-manifolds, metric properties of geodesics, and Jacobi theory
• Construct the basic concepts on Riemannian geometry
• Investigate the maximum principle and a brief introduction to convergence theory of
Riemannian manifolds
• Analyze the various geometrical and algebraic concepts.

Course Content:

Geometry: Riemannian Geometry, Theory of Curves, Theory of Surfaces, Uniqueness of

Parameterization, Serret-Frenet Equations, Arc Length, Unit Tangent Vector, Unit Bi Normal,
Unit Principal Normal, Involute, Evolutes, Singular Points, Singularities. Curvature, Principal
Curvatures, Normal and Gaussian Curvature, Mean Curvature.

Tensors: Basic Algebra, Tensor Components, Contraction, Covariant Tensors, Tensor

Derivations, First and Second Fundamental Forms, Gauss Equation, Gauss-Weingarten
Equation, the Gauss Codazzi Equations, Christoffel Symbol of 1st and 2nd Kinds.

Manifolds: Riemannian and Semi Riemannian Manifolds, Metrices, Flat Spaces, Affine
Connection, Covariant Differentiation of Tensor Fields, Curvature and Torsion Tensors,
Connection Symbols, Covariant Differentiation, the Levi-Civita Connection, Geodesics and
Geodesic Equation, Ricci Scalar Curvature.

Recommended Books:
• Do Carmo, M. P. (1992). Riemannian Geometry, Birkhauser.
• Gallot. S. and Lafontaine, J. (1990). Riemannian Geometry, Springer-Verlag.
• D. Langwitz (1970) Differential and Riemannian Geometry, Academic Press
• Gallot S. and Lafontaine J. (1990) Riemannian Geometry, Springer-Verlag, 1990
• Relativity Demystified by David McMahon, 2006, The McGraw-Hill Companies.

Page No: 50 of 59
Course Title: Fuzzy Set Theory

Course Code: MATH4145

Credit Hours: 3(3+0)

Course Objectives:

Upon successful completion of this course students will be able to:

• Describe the concepts of fuzzy set theory and fuzzy logic

• Make the difference between Crips Set and fuzzy set theory
• Recognize fuzzy logic membership function
• Express the interpolation property of fuzzy inference systems.

Course Content:

Fuzzy Sets: Introduction to Fuzzy Sets, Crispness, Vagueness, Fuzziness, Fuzzy Set
Theory, Constructing Fuzzy Sets, Crisp vs Fuzzy Types of Fuzzy Sets

Extensions: Set-Theoretic Extensions, Set-Theoretic Operations, The Extension Principal,

Fuzzy Numbers, Fuzzy Arithmetic and Interval Arithmetic, Extension Principle Fuzzy
Arithmetic Using Extension Principle Fuzzy Equations.

Fuzzy Relations and Graphs: Fuzzy Rules, Possibility Theory, Relations, Introduction to
Fuzzy Relations Projections, Equivalence Fuzzy Relation, Composition of Fuzzy Relations,
Fuzzy Graphs,

Fuzzy Logics: Fuzzy Logic, Linguistic Hedges, Fuzzy Propositions (Conditional and
Unconditional), Applications in Operations Research and Data Mining.

Recommended Books:
• Zimmermann, H. J. (2011). Fuzzy set theory—and its applications. Springer Science &
Business Media.
• Maiers, J., &Sherif, Y. S. (1985). Applications of fuzzy set theory. IEEE Transactions
on Systems, Man, and Cybernetics, (1), 175-189.
• Klir, G., & Yuan, B. (1995). Fuzzy sets and fuzzy logic (Vol. 4). New Jersey: Prentice Hall

Page No: 51 of 59
 Course Title: Algebraic Topology

Course Code: MATH4146

Credit Hours: 3(3+0)

Course Objectives:

Upon successful completion of this course students will be able to

• Explain algebraic and geometric ideas that underpin homology and Cohmology theory
• Understand the Cell Complexes, Homotopical Complexes and Cellular Maps
• Use abstract methods to solve problems
• Apply the ideas of homology and cosmology to problems from other branches of
Mathematics.

Course Content:

Introduction: Basics of Algebraic Topology, Fundamental Group, Function Spaces,

Quotient Spaces, Relative Homotopy, Fabrication

Cell Complexes: Basics of Polytopes, Convex Polytopes, Cell Complexes, Product of Cell
Complexes, Homotopical Complexes, Cellular Maps

Covering Spaces and Fundamental Groups: Basics of Covering Spaces, Lifting Properties,
Relations with the Fundamental Groups, Classification of Group Projections

Homology Groups: Basic Homological Algebra, Singular Homology Groups, Constructions of

Some Homology Groups, Applications of Homology.

Cohomology: Basics of Cohomology, Cochain Complexes, Universal Coefficient Theorem

of Cohomology

Recommended Books:
• Spanier, E. H. (1989). Algebraic topology. Springer Science & Business Media.
• Eilenberg, S., & Steenrod, N. (2015). Foundations of algebraic topology. Princeton
University Press.
• Rotman, J. J. (2013). An introduction to algebraic topology (Vol. 119). Springer Science &
Business Media.
• Hilton, P. J., & Wylie, S. (1967). Homology theory: An introduction to algebraic topology.
CUP Archive.

Page No: 52 of 59
 Course Title: Relativity and Cosmology
Course Code: PHYS4115
Credit Hours: 3(3+0)
Course Objectives: The students will be able to understand:
 Basic features of special relativity and geometric structure of space time and the relativistic kinematics; and
 Einstein’s general theory of relativity, the structure of Riemannian geometry, applications of general relativity
in cosmology and basic theories of origin and evolution of the universe.
Course Outline:
Relativity: Special Relativity, Galilean relativity, concept of ether, Michelson-Morley experiment, Einstein’s
postulates of special relativity, Lorentz transformations, structure of space-time, Minkowski space-time tensors,
the light-cone, line element, four-vectors, relativity of simultaneity, time dilation, proper time, length
contraction, twin paradox, velocity transformation and velocity addition. Relativistic Mechanics, Force equation
in relativity, rest mass, kinetic and total energy, conservation of energy and momentum.
Elements of Tensor Calculus: Manifolds and coordinates curves and surfaces, tensor fields, geodesics,
Riemann tensor, metric tensor, Einstein’s tensor, relativistic electrodynamics.
General Relativity: Principles of general relativity, equation of geodesics deviation, Einstein’s field equations.
Cosmology: Newtonian cosmology, cosmological red shift, Hubble’s law, microwave background, the Big
Bang, FRW metric, density parameter.
Recommended Books:
 Macomb,W. D. (1999). Dynamics and Relativity, Oxford University Press.
 Narlikar,J. V. (1989). Introduction to Cosmology, Cambridge University Press.
 Inverno, R. D. (1992). Introducing Einstein’s Relativity, Oxford University Press.
 4. Instructor of respective course may add two books.

Page No: 53 of 59
Course Title: Introduction to Bio Mathematics

Course Code: MATH4154

Credit Hours: 3(3+0)

Course Objectives:

Upon successful completion of this course students will be able to

• Understand the discrete and differential equation models that represent a range of
biological problems, including identifying assumptions that are appropriate for the
problem to be solved

• Apply computational tools to perform parameter estimation and to solve discrete and
differential equation models

• Interpret model and data output in terms of the original biological problem, and use results
to direct a follow-up experiment

• Perform appropriate data manipulations, and graphically display model output and data
clearly and accurately

• Effectively communicate across the disciplines.

Course Contents:

Population Dynamics: The Malthusian Growth Model, the Logistic Equation, a Model of
Species Competition, the Lotka-Volterra Predator-Prey Model.

Age-Structured Populations: Fibonacci’s Rabbits, The Golden Ratio F, and the Fibonacci
Numbers in a Sunflower, Rabbits are an Age-Structured Population, Discrete Age-Structured
Populations, and Continuous Age- Structured Populations.

Infectious Disease Modelling: The Si, SIS, SIR, SEIR Epidemic Disease Models.

Mathematical Models of Physiological Systems: Hemodialysis Model, Glucose Insulin Models.

Recommended Books:
• Murray, J. D. (2007). Mathematical biology: I. An introduction (Vol. 17). Springer Science
& Business Media
• Jones, D. S., Plank, M., & Sleeman, B. D. (2009). Differential equations and
mathematical biology. CRC press.
• Britton, N. (2005). Essential mathematical biology. Springer Science & Business Media.

Page No: 54 of 59
• Martcheva, M. (2015). An introduction to mathematical epidemiology (Vol. 61). New
York: Springer.
• Edelstein-Keshet, L. (2005). Mathematical models in biology. Society for Industrial and
Applied Mathematics.

Page No: 55 of 59
Course Title: Introduction to Statistics

Course Code: STAT2115

Credit Hours: 3(3+0)

Course Objectives:

• To Develop Understanding for the Basic Concepts of Statistics.

• To Prepare the Students for the Advanced Courses in the Field of Statistics Like Statistical
Inference, Sampling, Hypothesis Testing etc.

• At the End of Course, Students Should Have Capability of Critical Thinking about the Data and
which Techniques Could be used for Analysis.

Course Content:

Scope of Statistics, Introduction to Basic Concepts of Statistics Like Descriptive and Inferential
Statistics, Population, Sample, Parameter, Statistic, Types of Data and the Scales of Measurement,
Frequency Distribution and Graphical Representation of Data (Bar Chart, Pie Chart, Histogram,
Frequency Polygon and Frequency Curve, Cumulative Frequency Polygon), Measures of Central
Tendency, Quantiles, Absolute and Relative Measures of Dispersion, Moments, Skewness and Kurtosis,
Basic Concepts of Probability, Counting Rules (Multiplication Principle, Permutation and
Combination), Probability Spaces, Laws of Probability, Conditional Probability, Bayes’ Theorem,
Discrete and Continuous Random Variables, Probability Distributions of Random Variables (Binomial
Distribution, Poisson Distribution, Hypergeometric Distribution, Uniform Distribution, Exponential
Distribution, Normal Distribution Etc.), Overview of Sampling Like Sample Design, Sampling Frame,
Sampling and Non-Sampling Errors, Sampling Distributions for Mean, Proportion, Difference of Means
and Difference of Proportions, Overview of Hypothesis Testing and Regression Analysis.

Recommended Books
• Bluman, A. G. Elementary Statistics: A Step-by-Step Approach, McGraw-Hill, 2012.
• Mood, A. M., Graybill, F. A. & Boes, D.C. Introduction to The Theory of Statistics, McGraw-
Hill, New York (1997).

Page No: 56 of 59
Course Title: Mathematical Statistics

Course Code: MATH3120

Credit Hours: 3(3+0)

Course Objectives:

The Students Will be Able to Understand and Implement the Statistical Techniques by Using
Mathematical Approach.
Course Content:

Basic Combinatorics: Binomial Expansion, Multinomial Expansion, Introduction to Probability

Theory, Random Experiment and Its Properties, Counting Rules, Addition and Multiplication Rules of
Probability, Conditional Probability, Bayes’ Theorem, Probability Distributions of Discrete and
Continuous Random Variables, Mathematical Expectation of Discrete and Continuous Random
Variables, Moment Generating Function, Cumulant Generating Function, Characteristic Function,
Uniform Distribution, Bernoulli Distribution, Binomial Distribution, Hypergeometric Distribution,
Geometric Distribution, Negative Binomial Distribution, Poisson Distribution, Exponential
Distribution, Gamma and Beta Distributions, Normal Distribution, Log-Normal Distribution,
Estimation and Hypothesis Testing, Introduction to Regression Analysis and Correlation.

Recommended Books:
• Hogg, R. V. & Craig, A. T. (1995). Introduction to Mathematical Statistics, 5th Edition,
Englewood Hills, New Jersey.
• Mood, Graybill and Boes, Introduction to The Theory of Statistics, McGraw-Hill.
• Walpole, R. E. (1982) Introduction of Statistics. 3rd Edition, Macmillan Publishing Company, Inc.,
New York, 247-304.
• M. R. Spiegel and L. J. Stephens, Statistics, 4th Edition, McGraw-Hill Book, 1984.

Page No: 57 of 59
Course Title: Introduction to Regression and Analysis of Variance

Course Code: MATH4149

Credit Hours: 3(3+0)

Course Objectives:

• To Develop Understanding about How to Predict the Relationship Between Variables.

• How to Choose Right Statistical Model for the Data.

• To Provide Basic Knowledge of Experimental Designs which can be Applied in Different

Fields of Study.

Course Content:

Introduction to Regression Analysis, Simple Linear Regression, Multiple Linear Regression, Estimation
of the Parameters By Least Squares Method and Corresponding Variance Estimates, Testing and
Confidence Intervals for Least Squares Estimators, Correlation: Simple, Partial and Multiple Correlation
Up to Three Variables, Inference Regarding Correlation Coefficients, Coefficient of Determination,
Basic Concepts of Experimental Designs and Its Principles, Analysis of Variance (ANOVA) for One-
Way Classification and for Two-Way Classification, Completely Randomized Design (CR Design),
Randomized Complete Block Design (RCB Design), Latin Square Design (LS Design), Multiple
Comparison Tests: Least Significant Difference Test; Duncan’s Multiple Range Test and Tukey’s Range
Test, Analysis of Factorial Experiments.

Recommended Books:
• Clarke, G. M. Kempson, R. E. Introduction to the Design & Analysis of Experiments, Edward
Annold (1997).
• Montgomery, D. C. Design and Analysis of Experiments, John Wiley, New York (1997).
• Chaudhry, S. M., and Kamal, S., (2009), Introduction to Statistical Theory Part I, II 8th Edition,
Ilmi Kitab Khana, Lahore, Pakistan.
• Montgomery, D. C., Peck, E. A., & Vinning, G. G., Introduction to Linear Regression Analysis,
5th Edition, Wiley, 2012.

Page No: 58 of 59
Course Title: Multivariate Analysis

Course Code: MATH4150

Credit Hours: 3(3+0)

Course Objectives:

• To Understand Underlying Theory for the Analysis of Multivariate Data.

• At the End of Course, Students Will be Able to Choose Appropriate Techniques for the
Multivariate Analysis and How to Interpret the Findings.

Course Content:

Overview of the Course, Review of Basics of Vector and Matrix Algebra, Eigenvector and Eigenvalue,
Decomposition of Square Matrices, Linear Combination of Random Variables, Descriptive Statistics
for Multivariate Data, Multivariate Normal Distribution and Its Properties, Methods for Testing
Multivariate Normality, Inference about Mean Vector, Inference about Variance-Covariance Matrices,
Multivariate Analysis of Variance (MANOVA), Profile Analysis, Principal Component Analysis (PCA)
and Derivation of Principal Components, Discriminant Analysis, Exploratory Factor Analysis, Cluster
Analysis and Canonical Correlations.

Recommended Books:
• Anderson, T. W. (2003). An Introduction to Multivariate Statistical Analysis, John Wiley &
Sons, New York, USA.
• Johnson, R. A. and Wichern, D. W. (2007). Applied Multivariate Statistical Analysis, Prentice
Hall, New York, USA.
• Manly, B. F. J. (2004). Multivariate Statistical Methods: A Primer, Chapman and Hall/CRC,
New York, USA.
• Mardia, K. V., Kent, J. T. and Bibby, J. M. (1976). Multivariate Analysis, Academic Press, New
York, USA.
• Rencher, A. C. and Christensen, W.F. (2012). Methods of Multivariate Analysis, John Wiley &
Sons, New York, USA.

Page No: 59 of 59
Course Title: Statistical Decision Theory

Course Code: MATH4151

Credit Hours: 3(3+0)

Course Objectives:

• To Provide an Elementary but Comprehensive Introduction to Statistical Decision-

Making Processes.
• Use the Ideas of Statistics That can Lead Towards the Better Decisions.

Course Content:

Basic Elements of Decision Problems, Probability Measures, the Loss Function, Regret, Minimax
Principle, Bayes Solutions, Dominance and Admissibility, Bayes Vs Minimax Principle, Decision
Functions, Selecting A Decision Function, Utility Theory-Concepts and Methods, Preference Axioms,
Utility for Money, Ordinal Utility, Marginal Utility, Expected Utility, Indifference Curves, Subjective
Probability, Comparative Axioms of Subjective Probability and Expected Utility Theory, Model
Building for Decision Analysis, Graphical Representation of Decision Problems: Constructing Influence
Diagrams, Constructing Decision Trees and Comparison of Problem Structuring, Computational
Methods for Decision Problems: Bayesian Framework, Monte-Carlo Simulation Methods and
Optimization Methods, Sensitivity Analysis, Decision Making With Experimentation.

Recommended Books:
• Bather, J. (2000). Decision Theory. Chichester: John Wiley & Sons, Inc.
• Berger, J. (2013). Statistical Decision Theory: Foundations, Concepts, and Methods.
Springer Science & Business Media.
• Clemen, R. T. (1996). Making Hard Decisions: An Introduction to Decision Analysis. 2nd
Edition. Pacific Grove, CA: Brooks/Cole Publishing Company.
• Pratt, J. W., Raiffa, H., & Schlaifer, R. (1995). Introduction to Statistical Decision Theory.
MIT Press.
---------------------------------------The End----------------------------------------

Page No: 60 of 59