Harmonized Modular Curriculum for B.

Sc
Degree Program in Mathematics

February, 2013,
Addis Ababa, Ethiopia
Table of Contents
1. Introduction .......................................................................................................................................... 1
2. Rationale .............................................................................................................................................. 2
3. Objectives ............................................................................................................................................ 2
3.1 General objectives...........................................................................................................................2
3.2 Specific objectives ..........................................................................................................................2
4. Professional and Graduate profiles ...................................................................................................... 3
4.1 Professional Profile .........................................................................................................................3
4.2 Graduate Profile ..............................................................................................................................3
5. Admission Requirements ..................................................................................................................... 4
6. Duration of Study ................................................................................................................................. 4
7. Mode of delivery .................................................................................................................................. 4
8. Mode of assessment ............................................................................................................................. 4
9. Grading System.................................................................................................................................... 4
10. Graduation Requirements .................................................................................................................. 4
11. Degree Nomenclature ........................................................................................................................ 5
12. Module and Course Coding ............................................................................................................... 5
13. Clustering of Courses in to modules ................................................................................................ 6
13.1 Core Modules ................................................................................................................................6
13.2 Elective Modules ..........................................................................................................................7
13.3 Supportive .....................................................................................................................................7
13.4. General Modules ..........................................................................................................................8
14. Service Courses .................................................................................................................................. 8
14.1 For Chemistry Department ...........................................................................................................8
14.2 For Earth Science Department ......................................................................................................8
14.3 For Physics Department ................................................................................................................8
14.4 For Statistics Department ..............................................................................................................8
14.5 For Engineering ............................................................................................................................9
15. Course Breakdown ........................................................................................................................... 10
16. Module Handbook ........................................................................................................................... 13
16.1. Core Modules .............................................................................................................................13
16.2. Elective Modules .......................................................................................................................21
16.3. Supportive.............................................................................................................................26
16.4. General Modules...................................................................................................................28
17. Course Guide Books ........................................................................................................................ 29
19. Quality Assurance .......................................................................................................................... 128
Harmonized Modular Curriculum Developing Team Members
1. Abere Tegegn (MSc)- Jimma University
2. Angesom Abrha (MSc) - Adigrat University
3. Ataklti Zerue(MSc) Mekelle University
4. Beza lamesgin(MSc) - Debre Markos University
5. Bude Wako(MSc) – Wachamo University
6. Dereje Alemu(MSc) – Jigjiga University
7. Endalew Getnet(MSc) – Bahir Dar University
8. Gedefa Negassa(MSc) – Madawelabu University
9. Gediyon Yemane(MSc) – Wollega University
10. Getinet Seifu(MEd) – Mettu University
11. Getnet Alemu(MSc) – Gondar University
12. Guesh Yfter (MSc) - Samara University
13. Kewani Welay(MSc) - Arbaminch University
14. Tadele Tesfa(MSc) –Hawasa University
15. Tadesse Walelign(MSc) - Dire Dawa University
16. Teklemichael Worku(MSc) - Haramaya University
17. Temesgen Desta(MSc) – Dilla University
18. Tesfaye Tefera(MSc) – Debre Berhan University
19. Yidnekachew Zewdie (MSc)- Wolayta Sodo University
20. Yirga Abebe (MSc)- Aksum University
21. Zelalem Teshome(PhD) - Addis Ababa University
1. Introduction
There has been huge expansion of higher education in the country since 2004 bringing both the
total number of higher education institutions and their annual intakes to a record high. Thus it is
not difficult to imagine the impact of the expansion on the quality, standard and relevance of the
various programs in higher education institutions. As a result the MOE formed six clusters from
all public universities and designed a relatively common and standardized curriculum in six areas
of science in 2012. These curricula have been implemented since 2012/13 academic year.
Currently, the Ministry of Education felt the need to further strengthen and harmonize these
curricula so as to properly address the prevailing issues of quality, standard and relevance of
higher education. Consequently, for each program of the science faculties, a task force of experts
was commissioned by the Higher education Strategy Center (HESC) to prepare a modularized
curriculum seasoned with relevant contents and quality improvement strategies.
Accordingly, the Mathematics modularization team studied the curricula of the various national
universities and found some of the following irregularities and studied what to be the newly
developed modular curriculum:
 Mismatch in flow of students from home country to worldwide
 Course description and competency of the students is not well developed.
 Courses are not listed in sequential and level of difficulty.
 Not containing students study time, learning outcomes, teaching-learning and assessment
methods ,
 Professional profile is not described.
More over the team has also studied the curricula of a number of European universities in
particular of those participated in the Bologna process and incorporated the good practices such
as:
 The format of course specifications,
 Develop competency based courses and their outline
 Develop the professional and graduate profiles and matching them with course contents,
 Cluster courses in their competency to develop module.
 Deciding on the course offering mechanism (Block or parallel)
 Deciding the time when the modules/courses are offered

1
The good practices are incorporated in the following modularized curriculum of B. Sc degree
program in Mathematics. The team also studied the Ethiopian Preparatory schools curricula and
found that there is no gap between the curricula and the universities’ Mathematics curriculum.

2. Rationale
Mathematics is a fundamental field of study that plays a pivotal role in the development of
science, technology, business, and computer science. It profoundly influences the socio-
economic development of a society and civilization. Thus, it is imperative that students be
equipped with strong Mathematical knowledge and skills which enable them to be productive in
areas where rigorous thought and precision of results are emphasized.
Curriculum development is also a dynamic process which requires continuous assessment. Thus
updating and harmonizing national curriculum is vital to ensure the quality, standard and
relevance in line with the objective conditions of the country. In light with this, the Ministry of
Education, higher education strategy center, has taken the task of harmonization of various
national universities science curricula that are underway to accomplish the above objectives. The
task demands not only to harmonize the curricula designed by cluster of national universities but
also to enrich it by incorporating good practices from exemplary European universities.
Thus, the need to design a viable harmonized B. Sc degree curriculum that meets the current
global trend is the order of the day.

3. Objectives
3.1 General objectives
 To train qualified, adaptable, motivated, and responsible Mathematicians who will
contribute to the scientific and technological development of Ethiopia.
 To impact knowledge by teaching
 To advance knowledge by research

3.2 Specific objectives

 To provide an in-depth understanding of the fundamental principles and techniques of
Mathematics.
 To develop Mathematical thinking, reasoning and an appreciation of Mathematics as a
primary language of science.
 To develop the Mathematical skills needed in modeling and solving practical problems.
2
  To prepare students for graduate studies in Mathematics and related fields.
 Participate in professional activities
 Assist in teaching material preparation
 To produce graduates in Mathematics that are adaptable to teach in secondary schools,
colleges, universities and work in industries, research institutes etc.

4. Professional and Graduate profiles

4.1 Professional Profile
A BSc graduate in mathematics can
 Contribute for the development of science and technology,
 model physical problems,
 apply the acquired knowledge and skills to solve real life problem,
 assist and conduct research.
 teach in secondary schools, colleges and assists in Universities (through short/ long term
pedagogical training).
 participate in mathematics curriculum development and teaching material preparation.
 develop effective communication skills and ethical responsibility with the appreciation of
cultural diversity,
 create job opportunities by applying the acquired knowledge and skills.
 Involve in different activities and responsibilities where rigorous thoughts, logical
reasoning, simplification, precision and decision making skills are required.

4.2 Graduate Profile

A BSc graduate of this program is expected to:
 acquire adequate Mathematical knowledge to teach in secondary schools, colleges and
assist in universities.
 pursue graduate studies in Mathematics and related fields of study.
 set up Mathematical models, formulate algorithm and implement them using numerical
methods.
 assist and participate in conducting research.
 reason logically and think critically.
 demonstrate environmental, social, cultural and political awareness.
3
  act in an ethical manner, recognize and be guided by social, professional and ethical
issues involved in his/her career in particular and in the community in general exercise
the power of self expression

5. Admission Requirements
Besides the successfully completion of the preparatory program, a student should meet university
admission policy. Diploma holders can apply for admission as per the regulation of the
University for advanced standing.

6. Duration of Study
The duration of the study takes 6 semester or three years.

7. Mode of delivery
The main teaching-learning methods employed in the curriculum include: Conducting lecture
based on active participation of students; Tutorial classes where students will discuss and solve
problems; Discussion and presentation in group; Reading assignment; Practical work (computer
Lab.); Project work; Modeling of practical problems; Class activities.

8. Mode of assessment
Some of the assessment methods are Assignments; Quizzes; Project; presentation; Tests and final
examinations; Class activities.

9. Grading System
The grading system grading point of the program will be taken as per the legislation of the
University.

10. Graduation Requirements

The graduation requirement of the program will be taken as per the legislation of the University
and the total EtCTS required for graduation with the Degree of Bachelor of Science in
Mathematics is indicated below.

No Category Cr. hrs EtCTS

1 Compulsory Modules 66 112
4
 2 Elective Modules 9 15
3 General/ Supportive Modules 34 55
Total 109 182
11. Degree Nomenclature
After successful completion of all the requirements a student graduating from the Mathematics
Program will be entitled to earn a degree in:
English: Bachelor of Science Degree in Mathematics

Amharic: የሳይንስ ባችለር ዲግሪ በሒሳብ

12. Module and Course Coding

The national harmonization team forms the following clustering of courses to develop modules
based on sequence, level of difficulty and their competency. Naming and coding of courses and
modules is given as follows:
Module code consists of
 Home base (Math)
 Level of student (first year (1), second year (2) and third year(3))
 Module number (sequence of the module (01, 02, 03, …))
 Category of the module (1-core, 2-elective, 3-supportive/general module)
Course code consists of
 Home base (Math)
 Level of student (first year (1), second year (2) and third year(3))
 Module number (sequence of the module (01, 02, 03, …))
 Sequence of the course in the module (1-first given, 2-second given)

5
13. Clustering of Courses in to modules
13.1 Core Modules

Module Code Module Name Course Course Title Cr. EtCTS

Code Hr.
Math-M1011 Basic Mathematics Math1011 Fundamentals college of 4 7
Mathematics
Math1012 Fundamental concept of algebra 3 5
Math-M1021 Basic Calculus of Math1021 Calculus I 4 7
one variable Math1022 Calculus II 4 7
Math-M2031 Combinatory and Math2031 Introductory Combinatory and 3 5
Graph theory Graph theory
Math-M2041 Linear Algebra Math2041 Linear Algebra I 3 5
Math2042 Linear algebra II 3 5
Math-M2051 Modern Geometry Math2051 Fundamental concept of 3 5
geometry
Math2052 Transformation Geometry 3 5
Math-M2061 Computational Math2061 Numerical analysis I 3 5
Mathematics Math2062 Linear optimization 3 5
Math-M2071 Calculus of Math2071 Calculus of functions of several 4 7
functions of several variable
and complex Math2072 Functions of complex variable 4 7
variables
Math-M3081 Differential Math3081 Ordinary differential equation 3 5
Equations Math3082 Partial Differential equation 3 5
Math-M3091 A first course in Math3091 Modern Algebra I 3 5
Modern Algebra Math3092 Introduction to Number Theory 3 5
and Number Theory
Math-M3101 Advanced Calculus Math3101 Advanced Calculus of one 4 7
of one variables variables
Math-M3111 Mathematical Math3111 Mathematical modeling 3 5
modeling and Math3112 Project I 1 1.5
project Math3113 Project II 2 3.5
Sub-Total 66 112

6
13.2 Elective Modules

Module Module Name Course Course Title Cr EtCTS

Code Code Hr
Math-M3124 Advanced Math3121 Logic and set theory 3 5
Courses in Math3122 Modern algebra II 3 5
Algebra Math3123 Introduction to Algebraic 3 5
Geometry
Math-M3134 Analysis Math3131 Introduction to topology 3 5
Math3132 Introduction to real analysis 3 5
Math3133 Advanced calculus of several 3 5
variable
Math-M3144 Advanced Math3141 Introduction to cryptography 3 5
Discreet Math3142 Computational Number Theory 3 5
Mathematics Math3143 Graph theory 3 5
Math-M3154 Advanced Math3151 Operational research 3 5
Computational Math3152 Numerical analysis II 3 5
Mathematics I Math3153 Nonlinear optimization 3 5
Math-M3164 Advanced Math3161 Fluid mechanics 3 5
Computational Math3162 Numerical analysis II 3 5
Mathematics II Math3163 Nonlinear optimization 3 5
Math-M3174 Advanced Math3171 Projective geometry 3 5
Geometry and Math3172 Introduction to differential 3 5
Philosophy of geometry
Mathematics Math3173 History and Philosophy of 3 5
Mathematics
Sub-Total 9 15
Note: Students will select only one module from the elective modules

13.3 Supportive
Module Code Module Name Course Course Title Cr EtCT
Code Hr S
Comp-M1043 Basic Computer Comp1041 Intro. to computer sciences 4 6
Skills Comp1042 Fundamentals of programming 4 6
Phys-M2053 Fundamentals of Mechanics and Heat 4 7
Mechanics and Phys2051
Heat
Comp-M2063 Data base system Comp2061 Fundamentals Data base system 4 6
Stat-M3073 Basic Statistics Stat3071 Introduction to Statistics 3 5
Stat3072 Introductory Probability 3 5
Sub-Total 22 35

7
13.4. General Modules

Module Code Module Name Course Course Title Cr EtCTS

Code Hr
Enla-M1013 Basic English Enla1011 Communicative English Skills I 3 5
Skills Enla1012 Basic Writing Skills 3 5
CESt-M1023 Civic and Ethical 3 5
CESt1021 Civic and Ethical education
Education
Geol-M1033 Environmental Environmental Science 3 5
Geol1031
Science
Sub - Total 12 20

14. Service Courses

14.1 For Chemistry Department
Module Code Module Name Course Course Title Cr EtCTS
Code Hr
Math-M1023 Basic Calculus of one Math1021 Calculus I for chemists 3 5
variable Math1022 Calculus II for chemists 3 5
Math-M1043 Linear Algebra Math1041 Linear Algebra I 3 5
Sub-Total 9 15

14.2 For Earth Science Department

Module Code Module Name Course Course Title Cr EtCTS
Code Hr
Math-M1023 Applied Mathematics Math1021 Applied Mathematics IA
Math1022 Applied Mathematics IIA 4 7
Sub-Total 8 14

14.3 For Physics Department

Module Code Module Name Course Course Title Cr EtCTS
Code Hr
Math-M1023 Basic Calculus of one Math1021 Calculus I 4 7
variable Math1022 Calculus II 4 7
Math-M1043 Linear Algebra Math1041 Linear Algebra I 3 5
Sub-Total 11 19

14.4 For Statistics Department

Module Code Module Name Course Course Title Cr EtCTS
Code Hr
Math-M1023 Basic Calculus of one Math1021 Calculus I 4 7
variable Math1022 Calculus II for statistics 4 7
Math-M2043 Linear Algebra Math2041 Linear Algebra I 3 5
Math2042 Linear algebra II 3 5
Math-M2063 Computational Math2061 Numerical analysis for 3 5
Mathematics Statistics
Sub-Total 23 29

8
14.5 For Engineering
Module Code Module Name Course Course Title CP ECTS
Code
Math-M1023 Applied Mathematics Math1021 Applied Mathematics IB 4 7
Math1022 Applied Mathematics IIB 4 7
Math2023 Applied Mathematics IIIB 4 7
Sub-Total 16 28

9
15. Course Breakdown
Year I Semester I
Module Code Module Name Course Course Title Cr EtCTS Week Delivery
Code Hr
Math-M1011 Basic Math1011 Fun. college of Mathematics 4 7 1-9 Block
Mathematics Math1012 Fun. concepts of Algebra 3 5 10-16 Block
EnLa-M1013 Basic English Communicative English 3 5 1-16 Parallel
Enla1011
Skills Skills
CEst-M1023 Civics and 3 5 1-16 Parallel
CEst1021 Civic and Ethical education
Ethical studies
Comp-M1043 Basic Introduction to computer 4 6 1-16 Parallel
Computer Comp1041 sciences
Skills
Sub-Total 17 28

Year I Semester II
Module Code Module Name Course Course Title Cr EtCTS Week Delivery
Code Hr
Math-M1021 Basic Calculus Math1021 Calculus I 4 7 1-8 Block
of one Math1022 Calculus II 4 7 9-16 Block
variable
EnLa-M1013 Basic English Basic Writing skills II 3 5 1-16 Parallel
Enla1012
Skills
Ensc-M1033 Environmental 3 4 1-16 Parallel
Ensc1031 Environmental Science
Science
Comp-M1043 Basic Fundamentals of 4 6 1-16 Parallel
Computer Comp1012 programming
Skills
Sub-Total 18 29

10
 Year II Semester I
Module Code Module Name Course Course Title Cr EtCTS Week Delivery
Code Hr
Math-M2041 Linear Math2041
Linear Algebra I
Algebra 3 5 1-16 Parallel
Comp-M2063 Data base Fundamentals Data base
Comp2061
system system 4 6 1-16 Parallel
Math-M2051 Modern Fundamental concept of
Math2051
Geometry geometry 3 5 1-16 Parallel
Math-M2071 Calculus of Math2071
Functions of
Calculus of functions of
Several and 4 7 1-16 Parallel
several variable
Complex
Variable
Phy-M2053 Fundamental Phy2051
of Mechanics Mechanics and Heat 4 6 1-16 Parallel
and Heat
Sub-Total 18 29

Year II Semester II
Module Code Module Name Course Course Title Cr EtCTS Week Delivery
Code Hr
Math-M2041 Linear
Algebra Math2042 Linear Algebra II 3 5 1-16 Parallel
Math-M2061 Computational Math2061 Numerical analysis I 3 5 1-16 Parallel
Mathematics Math2062 Linear optimization 3 5 1-16 Parallel
Math-M2031 Combinatoric Introduction to
and Graph Math2031 Combinatorics and Graph 3 5 1-16 Parallel
theory Theory
Math-M2051 Modern
Math2052
Geometry Transformation Geometry 3 5 1-16 Parallel
Math-M2071 Calculus of Math2072 Functions of complex
Functions of variable
Several and 4 7 1-16 Parallel
Complex
Variable
Sub-Total 18 32

11
 Year III Semester I
Module Code Module Name Course Course Title Cr EtCTS Week Delivery
Code Hr
Stat-M3073 Basic
Stat3071
Statistics Introduction to Statistics 3 5 1-16 Parallel
Math-M3081 Differential Ordinary Differential
Math3081
Equations Equation 3 5 1-16 Parallel
Math-M3101 Advanced Math3101 Advanced calculus of one
Calculus of variable 4 7 1-16 Parallel
one variables
Math-M3091 A First Course Math3091 Modern algebra I 3 5 1-16 Parallel
in Modern Math3092 Introduction to Number 3 5 1-16 Parallel
Algebra and Theory
Number
Theory
Math-Mxxxx Elective Mathxxxx Elective I 3 5 1-16 Parallel
Module
Sub-Total 19 32

Year III Semester II

Module Code Module Name Course Course Title Cr EtCTS Week Delivery
Code Hr
Math-M3111 Mathematical Math3111 Mathematical modeling 3 5 1-16 Parallel
modeling and Math3112 Project I 1 1.5 1-4 Block
project Math3113 Project II 2 3.5 5-16 Block
Math-M3081 Differential
Equations Math3082 Partial Differential Equation 3 5 1-16 Parallel
Stat-M3073 Basic
Statistics Stat3072 Introduction to Probability 3 5 1-16 Parallel
Math-Mxxxx Elective Mathxxxx Elective II 3 5 1-16 Parallel
Module Mathxxxx Elective III 3 5 1-16 Parallel
Sub-Total 18 30

12
16. Module Handbook
16.1. Core Modules
Module Name Basic Mathematics
Module Number 01
Module Category Core
Module code Math-M1011
Total ECTS of the module 12
Module Description: This module rigorously discusses the basic concepts of logic, validity of statements
arguments and mathematical proofs, the real and complex number systems, mathematical induction, least upper
bound and greatest lower bound, relations, functions and types of functions, polynomial and rational functions,
logarithmic and exponential functions, trigonometric functions, hyperbolic functions and their graphs, analytic
geometry, set theory, classification of sets, cardinal numbers, groups, rings, and the system of integers.
Module Competency
The module
 Intends to prepare mathematics students in the basic concepts and materials necessary for the study of
higher mathematics courses,
 treats fundamental concepts rigorously in order to lay a strong foundation for the study of all mathematics
courses,
 Intends to introduce the students to the basic notions of formal logics from the perspectives of truth,
proof, and arguments,
 Presents the notion of sets and algebraic structures which lay foundations for subsequent mathematics
courses.
Module Objective
On completion of the module, successful students will be able to:
1. understand mathematical logic,
2. understand concepts of sets and set operations,
3. understand the fundamental properties of real and complex numbers,
4. understand different types and properties of functions, their inverses and graphs,
5. identify various forms of conic sections and derive their equations,
6. understand the notion of relations, equivalence of sets and cardinal numbers,
7. understand the properties of binary operations, algebraic structures, groups and rings,
8. apply the principle of mathematical induction to prove statements involving integers.
Mode of Delivery: One Semester (16 weeks)
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment:
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination.
Courses in the Module
Course Code Course Name ECTS
Math1011 Fundamentals of College Mathematics 7
Math1012 Fundamental Concepts of Algebra 5

13
 MODULE NAME Basic Calculus of One Variable
Module Number 02
Module Category Core
Module CODE Math-M1021
Total ECTS of the module 14
Module Competency: Up on completion of this module students will have a firm foundation in the basic
concepts and techniques of differential and integral calculus that are needed for the advanced studies in pure and
applied mathematics.
Module Description: This module introduces the basic concepts of limit, continuity, differentiation and their
applications, integration and their applications, inverse functions and their derivatives, techniques of integration,
improper integrals, sequences, series and power series.
Module Objective:
On completion of the module students will be able to:
- understand the concept of limit and continuity,
- understand differential and integral calculus of one variable,
- apply differential and integral calculus of one variable,
- understand the concept of sequences and series
Mode of Delivery Parallel
Module Duration One Semester (16 weeks)
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment:
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination.
Courses in the Module
Course Code Course Name ECTS
Math1021 Calculus I 7
Math1022 Calculus II 7

Module Name Combinatorics and Graph theory

Module Number 03
Module Category Core
Module Code Math-M2031
ECTS of the module 5
Module Competency:
Up on completion of the Module students will have the necessary background to understand the subsequent
application areas such as probability, network oriented problems.
Module Description: This module deals with review of sets and functions; fundamental principles of counting;
generating functions and recurrence relations, graph theory and its application.
Module Objectives: On completion of the Module students will be able to:
- know basic concepts of discrete mathematics,
- understand the principles of counting, recurrence relations and generating functions,
- understand the basic concepts of graph and their types,
- use the methods and principles of combinatorics,
- apply combinatorics in counting problems,
- solve simple counting problems,
- construct graphs with given degree patterns,

14
 - apply graph theory to solve network oriented problems.
Mode of Delivery One Semester (16 weeks)
Mode of Delivery Parallel
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment:
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination.
Courses in the Module
Course Number Course Name ECTS
Math2031 Introductory Combinatory and Graph theory 5

Module Name Linear Algebra

Module Number 04
Module Category Core
Module Code Math-M2041
ECTS of the module 10
Module Competency: up on completion of the module students will develop further concepts in advanced linear
algebra providing a foundation for studies in a number of other areas of Mathematics and related fields.
Module Description: This module covers vectors, lines and planes, vector spaces, matrices, system of linear
equations, determinants, eigenvalues and eigenvectors, and linear transformations. This module also covers the
characteristic equation of a matrix, orthogonality, matrix factorizations, canonical forms, direct sum
decomposition of vector spaces, bilinear, quadratic and positive definite forms.
Module Objectives: On completion of the Module students will be able to:
 understand basic concepts of vector algebra.
 comprehend the different concepts and properties of matrices.
 understand the notion of linear transformations.
 find eigen values and eigen vectors of matrices and linear operators.
 understand the basic concepts of inner-product space.
 Understand canonical forms of matrices
 Know bilinear forms
Module Duration Two Semester (32 weeks)
Mode of Delivery Parallel
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment:
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination.
Courses in the Module
Course Code Course Title ECTS
Math2041 Linear Algebra I 5
Math2042 Linear algebra II 5

15
 Module Name Modern Geometry
Module Number 05
Module Category Core
Module code MATH-M2051
ECTS of the module 10
Module Competency: Up on completion of the module students can
 relate various types of elementary geometry concepts from an advanced standpoint.
 perform advanced mathematical proofs in subsequent courses.
 interplay between transformation and geometry.
 treats various transformation in Affine spaces.
 have basic foundation in differential, projective and other advanced geometries.
Module Description: This module covers absolute geometry, Euclidean geometry and its consistency, Hyperbolic
geometry and its consistency; group of transformations, Affine Geometry, orthogonal transformations, orientation
preserving transformations, representation of orthogonal transformations, similarity transformations, Affine
transformations, and projective transformations.
Module Objectives: On completion of the module, successful students will be able to:
- understand the basic notions in different types of geometry,
- apply concepts of algebraic geometry in Euclidian and hyperbolic geometry,
- develop skills in mathematical proofs,
- understand the basic properties of similarity, orthogonal and affine transformations,
- understand the relationship between affine transformations and linear mappings
Module Duration Two Semester (32 weeks)
Mode of Delivery Parallel
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment:
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination.
Courses in the Module
Course Code Course Title ECTS
Math2051 Fundamental Concept of Geometry 5
Math2052 Transformation Geometry 5

Module Name Computational Mathematics

Module Number 06
Module Category Core
Module Code Math-M2061
Total E Total ECTS of the module 10
Module Competency: up on completion of this module students will
o have basic background in computational mathematics
o perform theoretical and algorithmic aspects of linear optimization
o find numerical solutions to problems for which analytical solutions either do not exist or are not readily or
cheaply obtainable.
MODULE DESCRIPTION: This module covers basic concepts in error estimation, solutions of non-linear
equations, solutions of system of linear equations and non-linear equations, finite differences, numerical

16
 interpolations, numerical differentiation and numerical integration; linear programming, geometric and simplex
methods, duality theory and further variations of the simplex method, sensitivity analysis, interior point methods,
transportation problems, and theory of games.
Module of Objectives: This module aims at equipping students with essential knowledge, skills and attitudes:
 analyze sources of errors,
 apply numerical methods to problems for which analytical solutions either do not exist or are not readily
or cheaply obtainable.
 translate mathematical algorithms into computer programming,
 understand decision process with respect to an optimization problem
 formulate optimization problems,
 solve linear programming problems by different method,
 understand duality theorems
 apply theorems and algorithms in duality theory,
 do sensitivity analysis,
 comprehend the transportation problem,
Module Duration One Semester (16 weeks)
Mode Delivery Parallel
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method; Computer Lab.
Mode of Assessment:
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination; Project (Practical Work).
Courses in the Module
Course Number Course Name ECTS
Math2061 Numerical analysis I 5
Math2062 Linear optimization 5

Module Name Calculus of functions of several and complex variables

Module Number 07
Module Category Core
Module Code Math-M2071
Total E Total ECTS of the module 14
Module Competency: Up on completion of the module students can
 extend the notion of differential and integral of functions of one variable to functions of several variables
to develop more advanced ideas that are essential in pure and applied mathematics.
 apply concepts of complex analysis to solve problems which are not revealed in the theory of functions of
one variable and equips them with profound and elegant mathematical proofs.
MODULE DESCRIPTION: This module covers review of vector algebra, vector valued functions, functions of
several variables, their derivatives and integrals with applications, and calculus of vector fields: Green's theorem,
17
 line and surface integrals, Stoke's theorem, and Divergence theorem; the complex number system, complex
differentiability, analytic functions, conformal mappings, complex integration Cauchy's theorem, Cauchy integral
formula, power series representations of analytic functions, Laurent series, residue theorem; Mobius
transformation.
Module Objectives: On completion of the this module, successful students will be able
 understand concepts of vector valued function
 understand deferential and integral calculus of function of several variables,
 apply deferential and integral calculus of function of several variables
 understand concepts of vector calculus.
 distinguish between differentiable functions and analytic functions,
 understand deferential and integral calculus of function of complex variables,
 apply deferential and integral calculus of function of complex variables
 understand calculus of Residue.
 understand the properties of Mobius transformation and its action on circles.
Module Duration Two Semester (32 weeks)
Mode Delivery Parallel
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment:
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination; Project.
Courses in the Module
Course Code Course Title ECTS
Math2071 Calculus of functions of several variable 7
Math2072 Function of complex variables 7

Module Name Differential Equations

Module Number 08
Module Category Core
Module Code Math-M3081
Total E Total ECTS of the module 10
Module Competency: up on completion of the module students will
 have basic concepts of Differential Equations
 formulate and solve Differential Equations using different analytical methods
 express physical problems interms of Differential Equations
 develop more advanced ideas in differential and integral calculus.
MODULE DESCRIPTION: This module covers basic definitions and terminology, preliminary theory of first
and higher order linear ordinary differential equations (ODEs), method of solutions and their applications, series
solution, Laplace transform, and systems of first order linear differential equations; basic concepts of partial
differential equations (PDE), some techniques of solutions of first order PDE, Fourier series, second order PDE
and analytical methods of solutions;
Module Objectives
On the completion of this module students are expected to be able to:
 distinguish various classes and types of differential equations,

18
  understand the underlying theory of DEs, various techniques of solving DEs, generalized functions
 apply generalized functions
 derive the properties of Laplace transform, and solve Laplace equations
 Express physical problems in terms of differential equations.
 understand Fourier series
 apply Fourier and Laplace transforms for solving PDEs,
 solve one dimensional heat flow and wave equations,
Module Duration Two Semester (32 weeks)
Mode Delivery Parallel
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment:
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination; Project.
Courses in the Module
Course Number Course Name ECTS
Math3081 Ordinary differential equation 5
Math3082 Partial Differential equation 5

Module Name A First Course in Modern Algebra and Number Theory

Module Number 09
Module Category Core
Module Code Math-M3091
Total E Total ECTS of the module 10
Module competency: up on completion of the module students will
 have basic concepts in number theory to lay basic foundation for higher courses in applied mathematics
such as cryptography and computational number theory.
 have a solid introduction to modern group theory, ring theory and fields and its extension in higher
algebra.
MODULE DESCRIPTION: This module covers algebraic structure of integers, basic notions of divisibility
theory, Diophantine equations, theory of congruence and equations over finite rings, decimal representations of
rational numbers, continued fractions, and quadratic extension of rational numbers; with review of sets and
functions, fundamental principles of counting, generating functions and recurrence relations, graph theory and its
application; Groups, isomorphism theorem, permutations group. Direct product, direct sum of abelian groups,
group action, rings, polynomial rings, PID and UFD and field and field extensions.
Module Objectives: On completion of the module students will be able to:
- understand the variety of methods for testing/proving primality,
- understand the factorization of composite integers,
- understand the concepts of a ring, subrings , ideals and quotient rings,
- distinguish between the different types of field extensions,
Module Duration One Semester (16 weeks)
Mode Delivery Parallel
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment:
19
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination.
Courses in the Module
Course Code Course Title ECTS
Math3091 Number Theory 5
Math3092 Modern Algebra I 5

Module Name Advanced Calculus of One Variable

Module Number 10
Module Category Core
Module Code Math-M3101
ECTS of the module 7
Module competency: up on completion of the module students will
 have the basic concepts of calculus of one variable from an advanced point of view to study advanced
courses in Analysis.
 understand the rigorous treatment of mathematical proofs.
MODULE DESCRIPTION: This module covers the Well Ordering Principle, principle of mathematical
induction, least upper bound property of the real number system, sequence of real numbers, the topology of the
real numbers, limits, continuity, differentiation, and the Riemann integral and its properties
Module Objectives: On completion of the module students will be able to:
 understand the topology and essential properties of the real number system
 understand the concept of sequences in depth and related results,
 understand the concepts of limit and continuity in a more general settings,
 master the theory of differentiation and its consequences,
 understand the concept of the Riemann integral,
 understand proofs of the standard results about the Riemann integral,
Module Duration One Semester (16 weeks)
Mode Delivery Parallel
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment:
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination.
Courses in the Module
Course Code Course Title ECTS
Math3101 Advanced Calculus of One Variable 7

Module Name Mathematical modeling and project

Module Number 11
Module Category Core
Module Code Math-M3111
ECTS of the module 10
Module Competency: up on completion of the module students will
 have a concise mathematical formulation of characteristic problems of real life with emphasis on
quantitative aspects of the problems.
20
  develop the basic concepts and methods in modeling focusing on forecasting relevant solutions to
specified area problems.
 understand mathematical concepts independently
 conduct research in Mathematics and its application.
Module Description: This module covers basic concepts and methods in modeling, dimensional analysis,
graphical methods and applications, approximation and testing, Eulerian and Lagrangian modeling, consecutive
equations, applications (growth and decay models, population growth model, interacting species, traffic flow,
diffusion and population models, etc) and identifying and studying the problem, gathering data and relevant
materials and analyzing the data, modeling, reformulating and/or proving a conjecture in implementing the
problem identified and presenting the findings/results.
Module Objectives: On completion of the module students will be able to:
 understand properties and importance of models,
 understand dimensional analysis,
 develop mathematical models representing a physical problem,
 analyze mathematical problem or prove conjecture,
 write scientific guided research/ project report,
 present final research/ project report.
Module Duration Two Semester (32 weeks)
Mode Delivery Parallel
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment:
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination.
Courses in the Module
Course code Course Title ECTS
Math3111 Mathematical modeling 5
Math3112 Project I 1.5
Math3113 Project II 3.5

16.2. Elective Modules

Module Name Advanced Courses in Algebra
Module Number 12
Module Category Elective
Module Code Math-M3122
ECTS of the module 15
Module Competency: up on completion of the module students will
 recognize the world of formal logics from the perspectives of truth, proof, and arguments.
 have basic concepts of sets axiomatically which lay on a foundation for classical mathematics.
 have deep understanding of Galois and Module theories, which prepare them for graduate study.
 have basic concepts and techniques in algebraic geometry, which treats by using algebra.
 develop algorithms for manipulating systems of polynomial equations that are useful in computer science
and engineering
Module Description: This module covers propositional and predicate logic, intuitive and axiomatic set theory,
relations and functions, the natural numbers, cardinal and ordinal numbers, transfinite arithmetic, the axioms of
choice, and zorn’s lemma; introduction to Galois theory, module theory, modules over principal ideal domains
21
 and commutative rings; quick review of number theory, primality test, primality proofs, and factorization;
polynomial and affine varieties, Groebner basis, elimination theory, the algebra-geometry dictionary, polynomial,
and rational functions on a variety.
Module Objectives: On completion of the module students will be able to:
 understand the statement calculus,
 apply rules of inferences,
 prove validity of arguments,
 understand the axiomatic approach to set theory,
 understand the construction of natural numbers,
 understand the notion of cardinal and ordinal numbers,
 apply counting principles in classification of sets,
 state the Well Ordering Principle,
 state the Axiom of Choice and Zorn’s lemma
 comprehend the concepts in Galois theory,
 state the fundamental theorem of Galois theory,
 compute the Galois group of a polynomial,
 understand the concept of modules and their properties,
 determine the Jordan and canonical forms
 comprehend the concept of algebraic geometry,
 understand the relationship between algebra and geometry
 perform parameterization of affine varieties,
 understand Groebner bases and their properties,
Module Duration Two Semester (16 weeks)
Mode Delivery Parallel
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment: Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination;
Presentation; Final Examination.
Courses in the Module
Course Code Course Title ECTS
Math3121 Logic and set theory 5
Math3122 Modern algebra II 5
Math3123 Introduction to Algebraic Geometry 5

Module Name ANALYSIS

Module Number 13
Module Category Elective
Module Code Math-M3132
Total E Total ECTS of the module 15
Module Competency: up on completion of the module students will
 analyze carefully and rigorously theory of functions of several variables.
 understand advanced courses in analysis and related fields of mathematics.
MODULE DESCRIPTION: The module covers the topics, series of real numbers, sequence and series of
functions, power series and stieltjes integral; topics in Euclidean n–space and transformation, the topology on Rn,
limit and continuity, differentiation, inverse function theorem, implicit function theorem, integration, and Fubini’s
theorem; metric spaces treating topics such as open sets, closed sets, continuity, convergence and completeness,

22
and it extends the ideas to general topological spaces.
Rationale and Objectives of the module
At the end of this module students will be able to:
 Understand some of the consequences of uniform convergence,
 Compute the radius of convergence of a power series,
 Represent function by Taylor series,
 understand and apply the notion of convergence of sequences of points in n in terms of sequences in R
 apply the concepts of limit and continuity of functions in one
 determine whether a collection of subsets of a set is topology
 understand basic properties of the Euclidean space and linear transformations on
 understand the various topological aspects in 
n

 understand the notion of convergence of sequences of points in  in terms of sequences

n

 apply the notion of convergence of sequences of points in  in terms of sequences

n

 apply the concepts of limit and continuity of functions in one variable to functions defined on 
n

 evaluate limits of functions defined on 

n

 understand the concept of differentiability of a function on  ,

n

 find derivatives and partial derivatives,

 apply the implicit function theorem,
 understand the theory of integration on 
n

 apply Fubini theorem to compute integrals in 

n

Module Duration Two Semester (32 weeks)

Mode Delivery Parallel
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment:
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination.
Courses in the Module
Course Number Course Name ECTS
Math3131 Introduction to topology 5
Math3132 Introduction to real analysis 5
Math3133 Advanced calculus of several variable 5

Module name Advanced Discreet Mathematics

Module Number 14
Module Category Elective
Module code Math-M3142
ECTS of the module 15
Module Competency: up on completion of this module students will
 have an introduction to many methods currently used for testing/proving primality and for factorization of
composite integers.
 develop the mathematical theory that underlines these methods, and describes the methods themselves.
 Have a basic fundation in the study of applied mathematics fields such as cryptography.
MODULE DESCRIPTION: This module covers graphs and their matrix representation, paths and circuits, trees
23
 and forests, planar graphs, graph coloring, digraph, networks, and flows; cipher system, methods and types of
attack, information theory, stream ciphers, block ciphers, public key ciphers, authentication, identification, and
digital signatures; Kinematics of fluid flow, equation of continuity, flow and circulation, motion in two
dimensions, applications (Navier’s and Stoke’s equation and their solution, Prandtl’s boundary layer theory,
energy equation, solution of particular case studies).
Rationale and Objectives of the module
On completion of the course, successful students will be able to:
- have an overview of some of the classical cryptosystems,
- understand the basic mathematics behind private-key and public-key cryptography,
- describe several well known techniques for cryptography, security and authentication,
- understand the method of encryption and decryption of ciphers,
- understand how to use private and public keys, know how to construct or extend a key,
- understand the algorithms that arise in the study of cryptology and error control codes,
- know the algebraic method involved in decoding or correcting a code.
Module Duration Two Semester (16 weeks)
Mode Delivery Parallel
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment:
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination.
Courses in the Module
Course Number Course Name ECTS
Math3141 Introduction to cryptography 5
Math3142 Computational Number Theory 5
Math3143 Graph theory 5

Module Name Advanced Computational Mathematics I

Module Number 15
Module Category Elective
Module Code Math-M3152
Total E Total ECTS of the module 15
MODULE DESCRIPTION: This module covers basic notions of convex analysis, nonlinear optimization,
discrete optimization, graph theory, and network optimization; interpolation and numerical integration,
approximation theory, numerical methods for initial value and boundary value problems and methods for solving
eigenvalue problems; integer programming, deterministic dynamic programming, inventory models, forecasting
models, decision theory, queuing systems, and simulation modeling.
Rationale and Objectives of the module
On completion of the course, successful students will be able to:
- identify the problems that can be solved using quantitative methods, explain steps in quantitative analysis,
- formulate a decision making problem,
- apply time-series forecasting models,
- formulate different types of inventory models,
Module Duration One Semester (16 weeks)
Mode Delivery Parallel

24
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment:
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination.
Courses in the Module
Course Number Course Name ECTS
Math3151 Operational research 5
Math3152 Numerical analysis II 5
Math3153 Nonlinear optimization 5

Module Name Advanced Computational Mathematics II

Module Number 16
Module Category Elective
Module Code Math-M3162
ECTS of the module 15
MODULE DESCRIPTION: This module covers basic notions of convex analysis, nonlinear optimization,
discrete optimization, graph theory, and network optimization; interpolation and numerical integration,
approximation theory, numerical methods for initial value and boundary value problems and methods for solving
eigenvalue problems; integer programming, deterministic dynamic programming, inventory models, forecasting
models, decision theory, queuing systems, and simulation modeling.
Rationale and Objectives of the module
On completion of the course, successful students will be able to:
- understand basic concepts of fluid dynamics,
- understand the kinematics of fluid flow,
- identify body and surface forces,
- understand pressure in fluid,
- understand Reynold’s transportation theorem,
Module Duration Two Semester (16 weeks)
Mode Delivery Parallel
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment:
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination.
Courses in the Module
Course Number Course Name ECTS
Math3161 Fluid mechanics 5
Math3162 Numerical analysis II 5
Math3163 Nonlinear optimization 5

25
Module name Advanced Geometry and Philosophy of Mathematics
Module Number 17
Module Category Elective
Module code Math-M3172
Total ECTS of the module 15
MODULE DECRIPTION: This module covers introduction to projections, projective transformation, projective
plane, analytic projective geometry and projective description of conics; polynomial and affine varieties,
Groebner basis, elimination theory, the algebra-geometry dictionary, polynomial, and rational functions on a
variety; calculus on Euclidean spaces, frame fields, Euclidean geometry, and calculus on a surface and shape
operators.
Rationale and Objectives of the module
On completion of the course, successful students will be able to:
- understand the philosophy of mathematics,
- tell the history of mathematics,
- recognize the values and advantages of learning the history of mathematics,
- understand some of the interrelations among various, geometries via projective geometry,
- understand the classical topics such as Desargues’ theorem, and Pappus theorem harmonic sets, etc,
- understand the basic geometric and algebraic properties,
- understand the interrelations between projective, transformations and conic sections,
- solve problems and prove theorems in projective geometry
Module Duration Two Semester (16 weeks)
Mode Delivery Parallel
Module Teaching -Learning Methods: Lecture Method; Problem Solving Method; Discussion and presentation
in small group; Reading assignment; Question and Answering Method.
Mode of Assessment:
Group Work; Assignment (Group/individual); Test; Quiz; Take-Home Examination; Presentation; Final
Examination.
Courses in the Module
Course Number Course Name ECTS
Math3171 Projective geometry 5
Math3172 Introduction to differential geometry 5
Math3173 History and Philosophy of Mathematics 5

16.3. Supportive

Module Name Basic Computer Skills

Module Number 04
Module Category Supportive
Module Code Comp-M1043
ECTS of the module 12
Objectives of the module
This Module is aimed to provide basic knowledge of
- explain what Computer Science is, its characteristics and applications
- explain the historical development, generations and types of computers
26
 - get familiar with the computer system, data representation techniques, and computer arithmetic
- get familiar with the different coding methods
- explain Boolean logic, logic elements, etc.
- define computer networks and types
 identify the basic elements of computer hardware and software
 Using application software
 Write programs
 Design data base system for organizations
Courses in the Module
Course Number Course Name ECTS
Comp1041 Introduction to computer science 6
Comp1042 Fundamentals of programming 6

Module Name Fundamentals of Mechanics and Heat

Module Code Phys-M2058
ECTS of the module 7
MODULE DESCRITON: This module covers Vector algebra, Particle Kinematics and Dynamics, Work and
Energy, Conservation forces and Potential Energy Dynamics of systems of Particles, Collision, Rotational
Kinematics, Dynamics and Static of a Rigid Body, Oscillations, Gravitation and Planetary Motion, Heat, Kinetic
Theory of Gases, Thermodynamics. The course aims to introduce students to the broader issues of global
environmental challenges facing the human society.
Rationale and Objectives of the module
This Module is aimed to provide basic knowledge of
- compute average and instantaneous values of velocity, speed and acceleration
- derive the Kinematic equations for uniformly accelerated one-dimensional motion
- solve problems involving bodies moving in one-dimensional and two-dimensional using the concepts
in calculus and trigonometry
- explain some implementations of Newton’s laws of motion
- derive the work-energy theorem
- solve mechanics problem using impulse, momentum and the conservation of linear momentum
- apply the law of conservation of linear momentum of collisions
- repeat the procedure followed in rectilinear motion for rotational motion
- explain basic laws of heat and thermodynamics,
- be aware of environmental issues of international or global scale.
Courses in the Module
Course Number Course Name ECTS
Phys2051 Mechanics and Heat 7

Module Name BASIC STATISTICS

Module Code Stat-M3073
ECTS of the module 10
MODULE DESCRIPITION: This module covers Meaning of statistics; Methods of data collection; Methods
of data presentation; Measures of location; Measures of variation; Moments, skewness and kurtosis; Counting
Techniques; Concepts of Probability (classical approach); Probability distributions: Binomial, Poisson, Normal, t
27
 and Chi-square; Sampling and Sampling Distribution of the mean and proportion; Chi-square test of association.
Each topic should begin with motivating examples.
Rationale and Objectives of the module: This Module is aimed to provide basic knowledge of
- statistical techniques demonstrated through principles of data collection, descriptive statistics,
- probability, probability and sampling distributions, statistical inference and linear regression.
- joint, marginal and conditional distribution and independent random variables;
- standard discrete and continuous probability distributions, how they arise in practice and their elementary
properties.
Courses in the Module
Course Number Course Name ECTS
Stat3071 Introduction to Statistics 5
Stat3072 Introductory Probability 5

16.4. General Modules

Module Name Basic English Skill
Module Number 01
Module Category General
Module Code Enla-M1013
ECTS of the module 10
Module Objectives: At the end of the course students will be able to
 Express their ideas in various communicative contexts(in group /pair discussion, in public speaking
settings)
 Present oral reports
 Write short reports
 Read various materials and make their own notes
 Identify the structure of oral and written discourses
 Attend their academic work at easy and clarity
Courses in the Module
Course Number Course Name ECTS
Enla1011 Communicative English Skills I 5
Enla1012 Basic Writing Skills 5

Module Name Civics and Ethical Education

Module Code CESt-M1023
Total ECTS of the module 5
Rationale and Objectives of the module
The overall objective of this module is to
 equip students with basic knowledge, skills and attitudes of socio-economic and political issues and
professional ethics,
 acquire comprehensive understanding of communication
Courses in the Module
Course Number Course Name ECTS
CESt1023 Civics and Ethical Education 5

28
Module Name Environmental Science
Module code Geol-M1033
ECTS of the module 5
Module Competency: The module aims to introduce students to the broader issues of global environmental
challenges facing the human society.
Rationale and Objectives of the module
On completion of the module, students will have an understanding of the interactions between humans and the
global environment; develop skills and insight into critical thinking and situational awareness of their surrounding
environment; gain an understanding of the physical processes that operate in and on earth, will be aware of
environmental issues of international or global scale.
Courses in the Module
Course Number Course Name ECTS
Geol1031 Environmental Science 5

17. Course Guide Books

UNIVERSITY----------------------------------
COLLEGE/FACULTY-----------------------------
Departement/Program Mathematics
Module Name Basic mathematics
Module No 01
Module Code Math-M1011
Course Title Fundamentals of College Mathematics
Course Code Math1011
ECTS 7
Module Coordinator
Instructor’s Name
Information Office number
Phone number
E-mail
Consultation hours
Status of Course Core
Study Workload Tutorial Lab Assessment Home study Total hour
Lecture work
(in hours) 64 32 0 8 85 189

Lecture time Day hours room

Tutorial time Day hours room

Target Group First year Mathematics students

Semester I

Pre-requisites None

29
Course Objectives & Competences Acquired
On completion of the course, successful students will be able to:
 understand mathematical logic,
 apply logic in reasoning and mathematical proofs,
 use quantifiers in open propositions,
 understand concepts of sets and set operations,
 understand the fundamental properties of real and complex numbers,
 find least upper bound and greatest lower bound,
 use mathematical induction in proofs,
 write polar representation of complex numbers,
 understand different types of functions, their inverses and graphs,
 find zero’s of some polynomials,
 identify various forms of conic sections and derive their equations,
 use basic properties of logarithmic, exponential, hyperbolic, and trigonometric functions.
Course description: This course rigorously discusses the basic concepts of logic and set theory, the real and
complex number systems, mathematical induction, least upper bound and greatest lower bound,
functions and types of functions, polynomial and rational functions, logarithmic and exponential functions,
trigonometric functions, hyperbolic functions and their graphs, and analytic geometry.
Course Outline
Chapter I Logic and Set Theory
1.1 Definition and examples of proposition
1.2 Logical connectives
1.3 Compound (or complex) propositions
1.3 Tautology and contradiction
1.4 Open proposition and quantifiers
1.5 The concept of a set and the underlying set operations
Chapter 2. The real and complex number systems
2.1 The real Number System
2.1.1. The natural numbers, Principle of mathematical induction and the Well ordering
principle
2.1.2. The integers, rational numbers and irrational numbers
2.1.3. Upper bound, lower bound, lub, glb, completeness property of the set of real numbers,
and the Archimedean principle
2.2 Complex number system
2.2.1 Definition of complex numbers and the underlying operations
2.2.2 Polar representation of complex numbers and the De-Mover’s formula
2.2.3 Extraction of roots
Chapter 3. Functions
3.1 Review of relations and functions
3.2 Real-valued functions and their properties
3.3 Types of functions (one-to-one, onto) and inverse of a function
3.4 Polynomials, zero’s of polynomials, rational functions, and their graphs,
3.5 Definitions and basic properties of logarithmic, exponential, hyperbolic,
trigonometric functions, and their graphs.
Chapter 4. Analytic geometry
4.1 Division of segments and various forms of equation of a line
4.2 Conic sections: Equation of a circle, parabola, ellipse and hyperbola
4.3 The general second degree equation
Teaching & learning Lecture, Questioning and answering, Pair Discussion, Reading assignment
Methods Evaluation, project

30
Assessment  Quiz …………………………………...5%
 Assignment (1) ……………….……………..10%
 Test (1&2)…………………………………….20%.
 Presentation ……………………………..........5%
 Take home exam------------------------------------10%
 Final Exam …………………………………...50%
 Total…………………………………………...100%
Attendance
Requirements
Textbooks
 Alemayehu Haile and Yismaw Alemu, Mathematics an Introductory course, Department of
mathematics, AAU
 Abera Abay, An introduction to Analytic Geometry, AAU, 1998
Reference
 Raymond A. Barnett, Precalculus, functions and graphs, McGram Hill, 1999
 M. L. Bettinger, Logic, proof and sets, Adddison-Wesley, 1982
 Dennis G. Zill, Jacqueline M. Dewar, Algebra and trigonometry, 2nd Edition.
 Kinfe Abraha, Basic Mathematics, Mekelle University, Mega Printing Press, 2002. Mekelle,
Ethiopia

UNIVERSITY----------------------------------
COLLEGE/FACULTY-----------------------------
Department/Program Mathematics
Module Name Basic Mathematics
Module No 01
Module Code Math-M1011
Course Title Fundamental Concepts of Algebra
Course Code Math1012
ECTS 5
Module Coordinator
Instructor’s information Name
Office number
Phone number
E-mail
Consultation hours
Prerequisite Math1011
Course category core
Study Workload Lecture Tutorial Lab Assessment Home study Total hour
work
(in hours) 64 32 0 8 85 189

Lecture time Day Hours room

Tutorial time Day Hours room

31
Target Group First year Mathematics students

Semester I

Course Description : The course mainly covers arguments, validity of statements and mathematical proofs,
relations, classification of sets, cardinal numbers, groups, rings, and the system of integers
Course Objectives & Competences Acquired
On completion of the course, successful students will be able to:
- understand arguments and validity of propositions and use them in mathematical proofs,
- understand the notion of relations, equivalence of sets and cardinal numbers,
- understand the properties of binary operations and algebraic structures,
- understand the basic properties of groups,
- grasp the concept of group and ring homomorphisms and use them to prove homomorphism of groups and
rings respectively,
- understand the axiomatic approach of the construction of integers,
- apply the principle of mathematical induction to prove statements involving integers.
Course Contents
Chapter 1: Set theory (15 hrs)
1.1 Sets and set operations, ordered pairs, relations and functions
1.2 Order and equivalence relation
1.3 Classification of sets
1.4 Cardinal numbers
Chapter 2: Groups (14 hrs)
2.1 Binary operations, algebraic structures
2.2 Identity element and inverses
2.3 Morphisms
2.4 Definition and examples of groups
2.5 Subgroups, cosets, and Lagrange’s theorem
2.6 Normal subgroups and quotient groups
2.7 Homeomorphisms
Chapter 3: Rings (11 hrs)
3.1 Definition of rings and examples
3.2 Subrings and characteristic of a ring
3.3 Ideals and quotient rings
3.4 Homomorphism of rings
3.5 Integral domains and the field of quotients
3.6 Polynomial rings
3.7 Prime fields

Chapter 4: The system of integers (8 hrs)

4.1 Properties of addition and multiplication
4.2 Order axioms of the system of integers
4.3 Well-ordering axioms
4.4 Mathematical induction
4.5 Characterization of the system of integers
Assessment/Evaluation
 Quiz (1&2) …………………………………...5%
 Assignment (1) ……………….……………..10%
 Test (1&2)…………………………………….20%

32
  Presentation ……………………………..........5%
 Take home exam----------------------------------10%
 Final Exam …………………………………...50%
 Total…………………………………………...100%
Attendance Requirements
Literature
Textbook: - Demissu Gemeda and Seid Mohammed, Fundamental Concepts of Algebra, Dept. of
Mathematics, AAU, 2008
References:
-B. Fraleigh John, A First Course in Abstract Algebra, 2nd ed,Addison-Wesley publishing Company,
Reading
J. J Gerald, Introduction to modern algebra(revised), 4th ed; University Book Stall, Reading, 1989
D. S. Dummit and R. M. Foote, Abstract algebra, 3rd ed, John Wiley and Sons, 2004.
P. B. Bhattachara et-al, Basic abstract algebra, 2nd ed, Cambridge University press, 1995
N. H. Ma-Coy et-al, Introduction to abstract algebra, Academic Press, 2005

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Basic Calculus of One Variable
Module No. 02
Module code Math-M1021
Course Title Calculus I
Course Code Math1011
Course EtCTS 7
Course Category Core
Instructor’s Name_____________________________
Information Office No.__________________
Phone No. __________________
Consultation hours: __________________
E-mail: __________________
Module Coordinator
Study Workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
64 32 0 8 85 189
Lecture time Day Hours room

Tutorial time Day Hours room

33
Target Group 1st year Mathematics Students
Semester II
Pre-requisites None
Course objectives: On completion of the course, successful students will be able to:
- understand the formal definition of limit and continuity,
- evaluate limits of functions,
- determine points of discontinuity of functions,
- apply Intermediate Value Theorem,
- evaluate derivatives of different types of functions,
- apply derivatives to solve problems,
- evaluate integrals of different types of functions,
- apply integrals to find areas and volumes.
Course Description :This course introduces the basic concepts of limit, continuity, differentiation, integration,
and some of their applications.
Course outline
Chapter 1: Limits and continuity (12 hrs)
1.1.    Definition of limit
1.2 Basic limit theorems
1.3 One-sided limits
1.4 Infinite limits and limits at infinity
1.5. Continuity
1.6. The Intermediate Value Theorem and its applications
Chapter 2. Derivatives (14 hrs)
2.1 Definition of derivative
2.2 Tangent and normal lines
2.3 Properties of derivatives
2.4 Derivative of functions (polynomial, rational, trigonometric, exponential,
logarithmic and hyperbolic functions)
2.5 The chain rule
2.6 Higher order derivatives
2.7 Implicit differentiation
Chapter 3. Applications of derivatives (20 hrs)
3.1 Extreme values of functions
3.2 Rolle’s Theorem, the Mean Value Theorem, and their applications
3.3 Monotonic functions
3.4 The first and second derivative tests
3.5 Applications to extreme values and related rates
3.6 Concavity & inflection points
3.7 Graph sketching
3.8 Tangent line approximation and the differentials
Chapter 4. Integrals (18 hrs)
4.1 Antiderivatives
4.2 Indefinite integrals and their properties
4.3 Partitions, upper and lower sum, Riemann sums
4.4 Definition and properties of definite integral
4.5 The Fundamental Theorem of Calculus
4.6 Techniques of integration (integration by parts, integration by substitution,
integration by partial fractions)
4.7 Application of integration: Area, volume of solid of revolution

34
Teaching-learning methods Four contact hours of lectures and two contact hours of tutorials per week.
The students do graded home assignments individually or in small groups.
Assessment 1. Quiz (1) ………………………………….........5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements

Textbook: -
Robert Ellis and Denny Gulick, Calculus with analytic geometry, 6thed, Harcourt Brace Jovanovich,
Publishers, 5th ed, 1993Leithold, The calculus with analytic geometry, 3rd Edition, Herper& Row, publishers.
Reference:
 R. T. Smith and R. B. Minton, Calculus concepts and connections, McGram-Hill book company, 2006
 D. V. Widder, Advanced calculus, Prentice-Hall, 1979
 Ross L. Finney et al, Calculus, Addison Wesley, 1995
 E. J. Purcell and D. Varberg, Calculus with analytic geometry, Prentice-Hall INC., 1987
 Adams, Calculus: A complete course, 5th ed, Addison Wesley, 2003
 R. Wrede and M. R. Spiegel, Theory of advanced calculus, 2nd ed., McGraw-Hill, 2002.
 A. E. Taylor and W. R. Mann, Advanced calculus, 3rd ed, John-Wiley and Son, INC, 1995.

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Basic Calculus of One Variable
Module No. 02
Module code Math-M1021
Course Title Calculus II
Course Code Math1012
Course EtCTS 7
Course Category Core
Instructor’s Name_____________________________
Information Office No.__________________
Phone No. __________________
Consultation hours: __________________
E-mail: __________________
Module Coordinator

35
Study Workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
64 32 0 8 85 189
Lecture time Day Hours room

Tutorial time Day Hours room

Target Group 1st Year Mathematics Students

Semester II
Pre-requisite(s) Math1021
Course Objectives & Competences Acquired
On completion of the course, successful students will be able to:
 Understand the basic definition of inverse function,
 find derivatives of inverse functions,
 evaluate integrals of different types of functions,
 evaluate limits by L’ Hopital’s Rule,
 approximate functions by Taylor’s polynomial,
 determine convergence or divergence of a series,
 find the interval of convergence of a power series,
 approximate a function by using its power series,
 apply integrals (arc length, surface area),
 approximate integrals by Trapezoidal, and Simpson’s rules,
 find the Taylor’s series expansion of a function
Course Description: This course covers inverse functions, derivatives of inverse functions, techniques of
integration focusing on trigonometric substitution and partial fractions, Trapezoidal
rule and Simpson’s rule, arc length, indeterminate forms, sequences, series and
power series.
Course Contents/description
Chapter 1. Inverse functions (12 hrs)
1.1 Properties of inverse functions
1.2 Derivative of inverse functions
1.3 Inverses of trigonometric functions and their derivatives
1.4 Exponential and logarithmic functions
1.5 Exponential growth and decay
1.6 Inverse of hyperbolic functions and their derivatives
Chapter 2. Techniques of integration (12 hrs)
2.1 Elementary integration formulas
2.2 Integration by parts
2.3 Integration by trigonometric substitution
2.4 Integration by partial fractions
2.5 Trigonometric integrals
2.6 Trapezoidal and Simpson’s rule
2.7 Application of integration (area, volume, arc length, surface area)
Chapter 3 Indeterminate forms, improper integrals and Taylor’s formula (12 hrs)
3.1 Cauchy’s formula
3.2 Indeterminate forms (L’ Hopital’s Rule)
3.3 Improper integrals
3.4 Taylor’s formula
36
 3.5 Approximation by Taylor’s polynomial
Chapter 4. Sequence and series (30 hrs)
4.1 Sequences
4.1.1 Convergence and divergence of sequences
4.1.2 Properties of convergent sequences
4.1.3 Bounded and monotonic sequences
4.2 Infinite series
4.2.1 Definition of infinite series
4.2.2 Convergence and divergence of series
4.2.3 Properties of convergent series
4.2.4 Convergence tests for positive term series (integral, comparison, ratio and root tests)
4.2.5 Alternating series
4.2.6 Absolute convergence, conditional convergence
4.2.7 Generalized convergence tests
4.3 Power series
4.3.1 Definition of power series
4.3.2 Convergence and divergence, radius and interval of convergence
4.3.3 Algebraic operations on convergent power series
4.3.4. Differentiation and integration of a power series
4.3.5 Taylor &Maclaurin series
4.3.6 Binomial Theorem
Teaching-learning methods
Four contact hours of lectures and two contact hours of tutorials per week. The students do home assignments
individually or in small groups.
Assessment 1. Quiz (1) ………………………………….........5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements

Literature
 Robert Ellis and Denny Gulick, Calculus with analytic geometry, 5thed, 1993
 Leithold, The calculus with analytic geometry, 3rd Edition, Herper& Row, publishers.
 R. T. Smith and R. B. Minton, Calculus concepts and connections, McGram-Hill book company, 2006
 D. V. Widder, Advanced calculus, Prentice-Hall, 1979
 Ross L. Finney et al, Calculus, Addison Wesley, 1995
 E. J. Purcell and D. Varberg, Calculus with analytic geometry, Prentice-Hall INC., 1987
 Adams, Calculus: A complete course, 5th ed, Addison Wesley, 2003
 R. Wrede and M. R. Spiegel, Theory of advanced calculus, 2nd ed., McGraw-Hill, 2002.
 A. E. Taylor and W. R. Mann, Advanced calculus, 3rd ed, John-Wiley and Son, INC, 1995.

37
University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Linear Algebra
Module No. 04
Module code Math-M2041
Course Title Linear Algebra I
Course Code Math2041
Course EtCTS
5
Instructor’s Information Name_____________________________
Office No.__________________
Phone No. __________________
Consultation hours: __________________
E-mail: __________________
Module Coordinators
Study workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
48 32 0 8 47 135
Lecture time Day Hours room

Tutorial time Day Hours room

Target Group 2nd Year Mathematics Students

Semester I
Pre-requisites None
Status of the Course Core
Course Description
This course covers vectors, lines and planes, vector spaces, matrices, system of linear equations,
determinants, eigenvalues & eigenvectors, and linear transformations.
Course objectives
On completion of the course, successful students will be able to:
 understand the basic ideas of vector algebra,
 understand the concept of vector space over a field,
 find scalar and vector products,
 understand the basic theory of matrix,
 find adjoint of a matrix,
 solve system of linear equations,
38
  determine row reduced echelon forms of a matrix,
 determine the eigenvalues and eigenvectors of a square matrix,
 grasp Gram-Schmidt process,
 find an orthogonal basis for a vector space,
 invert orthogonal matrix,
 understand the notion of a linear transformation,
 find the linear transformation with respect to two bases,
 find the eigenvalues and eigenvectors of an operator.
Contents
Chapter One-Vectors (12hrs)

1.1 Definition of points in n-space

1.2 Vectors in n-space; geometric interpretation in 2 and 3-spaces
1.3 Scalar product, and norm of a vector, orthogonal projection, and direction cosines
1.4 The vector product
1.5 Applications on area and volume
1.6 Lines and planes

Chapter 2: Vector spaces (9hrs)

2.1 The axioms of a vector space
2.2 Examples of different models of a vector space
2.3 Subspaces, linear combinations and generators
2.4 Linear dependence and independence of vectors
2.5 Bases and dimension of a vector space
2.6 Direct sum and direct product of subspaces
Chapter 3: Matrices (10hrs)
3.1 Definition of a matrix
3.2 Algebra of matrices
3.3 Types of matrices: square, identity, scalar, diagonal, triangular, symmetric, and skew symmetric
matrices
3.4 Elementary row and column operations
3.5 Row reduced echelon form of a matrix
3.6 Rank of a matrix using elementary row/column operations
3.7 System of linear equations
Chapter 4: Determinants (12hrs)
4.1 Definition of a determinant
4.2 Properties of determents
4.3 Adjoint and inverse of a matrix
4.4 Cramer’s rule for solving system of linear equations (homogenous and non homogenous)
4.5 The rank of a matrix by subdeterminants
4.6 Determinant and volume
4.7 Eigenvalues and eigenvectors of a matrix
4.8 Diagonalization of a symmetric matrix
Chapter 5: Linear Transformations (9hrs)
5.1 Definition of linear transformations and examples
39
 5.2 The rank and nullity of a linear transformation and examples
5.3 Algebra of linear transformations
5.4 Matrix representation of a linear transformation
5.5 Eigenvalues and eigenvectors of a linear transformation
5.6. Eigenspace of a linear transformation Order axioms of the system of integers
Assessment 1. Quiz (1) …………………………………...5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........10%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements
Text
1. Serge Lang; Linear Algebra
2. DemissuGemeda, An Introduction to Linear Algebra, Department of Mathematics, AAU, 2000
References
1. D. C. Lay, Linear algebra and its applications, Pearson Addison Wesley, 2006
th
2. Bernard Kolman& David R. Hill, Elementary linear algebra, 8 ed., Prentice Hall, 2004
3. H. Anton and C Rorres, Elementary linear algebra, John Wiley & Sons, INC., 1994
nd
4. K. Hoffman & R. Kunze, Linear Algebra, 2 ed., Prentice Hall INC. 1971
nd
5. S. Lipschutz, Theory and problems of linear algebra, 2 ed. McGraw-Hill1991

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Modern Geometry
Module No. 05
Module code Math-M 2051

Course Title Fundamental Concept of geometry

Course Code Math 2051
Course EtCTS 5
Course Category Core
Module coordinator

40
Instructor’s Name_______________________________________
Information Office No. ___________________________
Phone. No.__________________________
E-mail:_______________________________
Consultation hours:_________________________

Study workload Lecture Tutorial Lab Assessment Home Total study

(in hours) Work study
48 32 0 8 47 135
Lecture Time Days Hrs Room

Tutorial Time Days Hrs Room

Target Group second year mathematics students

Semester I
Pre-requisites None
Course description: This course covers absolute geometry, Euclidean geometry and its consistency,
Hyperbolic geometry and its consistency.
Course Objectives
On completion of the course, successful students will be able to:
 understand the basic notions in absolute geometry,
 apply concepts of algebraic geometry in Euclidian and hyperbolic geometry,
 apply the distance function and related concepts to prove the congruence between triangles,
 understand the basic axioms of Euclidian geometry and its consistency,
 apply axioms and theorems to solve different problems
 understand the basic axioms and unique properties of hyperbolic geometry and its consistency,
 understand The Poincare Model,
 distinguish the difference between Euclidian and hyperbolic geometry,
 Develop skills in mathematical proofs.
Course Contents
Chapter 1: Absolute geometry (12hrs)
1.1 Axioms of incidence
1.2 Distance functions and the ruler postulate
1.3 The axiom of betweenness
1.4 Plane separation postulate
1.5 Angular measure
1.6 Congruence between triangles
1.7 Geometric inequalities
1.8 Sufficient conditions for parallelism
1.9 Saccheri quadrilaterals
1.10 The angle-sum inequality for triangles
1.11 The critical function
1.12 pen triangles and critically parallel rays
Chapter 2: The Euclidean geometry (8hrs)
2.1 Parallel postulate and some consequences
2.2 The Euclidean parallel projections
2.3 The basic similarity theorem

41
 2.4 Similarity between triangles
2.5 The Pythagorean theorem
2.6 Equivalent forms of the parallel postulate
Chapter 3: Hyperbolic geometry(10hrs)
3.1 The Poincare model
3.2 The Hyperbolic parallel postulate
3.3 Closed triangles and angle sum
3.4 The defect of a triangle and the collapse of similarity theorem
Chapter 4: The consistency of the Hyperbolic geometry (9hrs)
4.1 Inversion of a punctured plane
4.2 Cross ratio and inversion
4.3 Angular measure and inversion
4.4 Reflection across L-line in the Poincare model
4.5 Uniqueness of the L-lines through two points
4.6 The ruler postulate, betweenness, Plane separation and angular measure
Chapter 5: The consistency of the Euclidean geometry(9hrs)
5.1 The coordinate plane and isometries
5.2 The ruler postulate
5.3 Incidence and parallelism
5.4 Translations and rotations
5.5 Plane separation postulate
5.6 Angle congruence
Teaching & learning Lecture Method, Discussion and Presentation, problem solving method,
Methods Reading assignment, questioning and answering.
Assessment 1. Quiz (1) …………………………………...5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance
Textbooks:
 Dr. Getinet and etal, Fundamental concepts of geometry, Haramaya University, 2010(unpublished)
 Edwin E. Moise, Elementary Geometry from an advanced standpoint
References:
 James R. Smart, Modern geometries, 5th ed, Brook/Cole Publ. Co., 1988
 Marvin J. Green Berg, Euclidian and non-Euclidian geometries, 2nd ed, W. H. Freman and Co. 1974
 R. L. Faber, Foundations of Euclidian and non-Euclidian geometry, Marcel Dekker INC., 1983
 Judith N. Cedrberg, A Course in Modern Geometries, 2001, 2nded.
 Divid A. Thomas, Modern Geometry, 2002

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Modern Geometry

42
Module No. 05
Module code Math-M 2051

Course Title Transformation Geometry

Course Code Math 2052
Course EtCTS 5
Course Category Core
Module coordinator
Instructor’s Name_______________________________________
Information Office No. ___________________________
Phone. No.__________________________
E-mail:_______________________________
Consultation hours:_________________________

Study workload Lecture Tutorial Lab Assessment Home Total study

(in hours) Work study
48 32 0 8 47 135
Lecture Time Days Hrs Room

Tutorial Time Days Hrs Room

Target Group second year mathematics students

Semester II
Pre-requisites Math 2051 & Math 2041
Course description: This course covers group of transformations, Affine Geometry, orthogonal
transformations, orientation preserving transformations, representation of orthogonal transformations, similarity
transformations, Affine transformations, and projective transformations.
Course Objectives
On completion of the course, successful students will be able to:

 understand the basic properties of transformations,

 recognize the axioms and the associated theorems of affine geometry,
 understand the basic properties of orthogonal transformations,
 understand the basic similarity transformations and their representations,
 understand the basic properties of affine transformations,
 identify several classes of affine transformations,
 Understand the relationship between affine transformations and linear mappings.
Course Contents

Chapter 1: Group of transformations (4hrs)

1.1 Definition of transformation
1.2 Examples of group of transformations

Chapter 2: Affine geometry (12hrs)

43
2.1 Axioms of an affine space
2.2 Geometry in an affine space
2.3 Lines and planes in an affine space
2.4 Concurrency
2.5 Classical theorems (Menelaus, Ceva, Desargues, and Papus.)
Chapter 3: Orthogonal transformations (12hrs)
3.1 Properties of orthogonal transformations
3.2 Orientation preserving and orientation reversing orthogonal transformations
3.3 The fundamental types of orthogonal transformations of the plane
(translations, reflections and rotation)
3.4 Representation of orthogonal transformations as product of the
fundamental orthogonal transformations
3.5 Orthogonal transformations of the plane in coordinates
Chapter 4: Similarity transformations (10hrs)
4.1 Properties of similarity transformations
4.2 Homothetic transformations
4.3 Representation of similarity transformations as the product of homothetic
and an orthogonal transformations
4.4 Similarity transformations of the plane in coordinates
Chapter 5: Affine transformations (10hrs)
5.1 Definition and examples of affine transformations (orthogonal and
Similarity transformations, Skew reflection, compressions, Shear)
5.2 Properties of Affine transformations
5.3 Affine transformations and linear mappings
Teaching & learning Lecture Method, Discussion and Presentation, problem solving method, Reading
Methods assignment, questioning and answering.
Assessment 1. Quiz (1) …………………………………...5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance
Textbooks:
 G. E. Martin, Transformation geometry: An introduction to symmetry, Springer-Verlag, 2009
 P. S. Modenov, Geometric transformation
References:
 Judith N. Cedrberg, A course in modern geometries, 2nd ed., 2001
 David A. Thomas, Modern geometry, 2002
 Edward C. Wallace & Stephen F. West, Roads to geometry, 3rd ed., 2004
 College geometry: A problem solving approach with applications, 2nd ed., 2008

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Combinatorics and Graph Theory

44
Module No. 03
Module code Math-M2031
Course Title Introduction to Combinatorics and Graph Theory
Course Code Math 2031
Course EtCTS 5
Module cordinator
Instructor’s Name---------------------------------------------;
Information Office No. ----------------
Phone No.----------
E-mail:----------------
Consultation hours:--------
workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
48 32 0 8 47 135
Lecture Day Hour Room

Tutorial Day Hour Room

Target Group Second year mathematics students

Semester II
Pre-requisites None
Status of the Course Core
Course Objectives
On completion of the course, successful students will be able to:
- know basic concepts of discrete mathematics,
- understand the principles of counting, recurrence relations and generating functions,
- understand the basic concepts of graph and their types,
- know the basic algorithms on graphs,
- use the methods and principles of combinatorics,
- apply combinatorics in counting problems,
- solve simple counting problems,
- construct graphs with given degree patterns,
- apply graph theory to solve network oriented problems
Course outline
Chapter 1: Elementary counting principles (9 hrs)
1.1 Basic counting principle
1.2 Permutations and combinations
1.3 The inclusion-exclusion principles
1.4 The pigeonhole principle
1.5 The binomial theorem
Chapter 2: Elementary probability theory (8 hrs)

45
 2.1 Sample space and events
2.2 Probability of an event
2.3 Conditional probability
2.4 Independent events
2.5 Random variables and expectation
Chapter 3: Recurrence relations (7 hrs)
3.1 Definition and examples
3.2 Linear recurrence relations with constant coefficient
3.3 Solutions of linear recurrence relations
3.4 Solutions of homogeneous and nonhomogeneous recurrence relations
Chapter 4: Elements of graph theory (10 hrs)
4.1 Definition and examples of a graph
4.2 Matrix representation of a graph
4.3 Isomorphic graphs
4.4 Path and connectivity of a graph
4.5 Complete, regular and bipartite graphs
4.6 Eulerian and Hamiltonian graphs
4.7 Trees and forests (Rooted and Binary trees)
4.8 Planar graphs
4.9 Graph coloring
Chapter 5: Directed graphs (6 hrs)
5.1 Definition and examples of digraphs
5.2 Matrix representation of digraphs
5.3 Paths and connectivity
Chapter 6: Weighted graphs and their applications (8 hrs)
6.1 Weighted Graphs
6.2 Minimal Spanning trees
6.3 Shortest path problem
6.4 Critical Path Problem
Teaching- learning methods Lecture, questioning &answering, Pair and individual work ,Problem solving ,
Gap -lecturing and Reading assignment, discussion.

1. Quiz (1) ………………………………….......5%

Assessment 2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements 85%
References:
N. CH SN Iyengar et al, Discrete mathematics, Vikas publishing house PVT LTD, 2004
S. Roman, An introduction to discrete mathematics, CBS College publishing, 1986
B. Harris, Graph Theory and its applications, Academic press, 1970
Iyengar, S. N, Elements of Discrete Mathematics

46
Lipschutz, S., Schaum’s outline series, Discrete Mathematics
Steven Roman, An Introduction to Discrete Mathematics
Mattson, H.F., Discrete Mathematics with Application
Oystein Ore, Theory of graphs, American mathematical Society, 1974

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Calculus of Functions of Several and Complex Variables
Module No. 07
Module code Math-M2071
Course Title Calculus of Functions of Several Variables
Course Code Math2071
Course EtCTS 7
Course Category Core
Instructor’s Name_____________________________
Information Office No.__________________
Phone No. __________________
Consultation hours: __________________
E-mail: __________________
Module Coordinator
Study Workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
64 32 0 8 85 189
Lecture Time Days Hrs Room

Tutorial Time Days Hrs Room

Target Group 2nd year mathematics Students

Semester I
Pre-requisite(s) Math 1022
Course Objectives
On completion of the course, successful students will be able to:
- understand vector algebra,
- write equations of lines and planes in space,
- sketch graphs of functions of two variables in 3-space,

47
- evaluate partial derivatives,
- find gradients and directional derivatives of a function of several variables,
- use differentials for approximation,
- use tangent plane approximation,
- apply partial derivatives to physical problems,
- evaluate multiple integrals of different functions of several variables,
- apply integrals to physical problems,
- understand the core theorems of the course.
Course Contents
Chapter 1. Vector valued functions (12)
1.1 Definition and examples of vector in space
1.2 Distance between two points, vectors algebra(dot product, projections, cross product)
1.3 Lines and planes in space
1.4 Introduction to vector-valued functions
1.5 Calculus of vector-valued functions
1.6 Change of parameter; arc length
1.7 Unit, tangent, normal
1.8 Curvature
Chapter 2. Limit and continuity of function of several variables (12)
2.1. Definitions and examples of real valued functions of several variables
2.2 Domain and range of functions of several variables
2.3 Graphs and level curves
2.4 Limit and continuity
Chapter 3. Differentiation of functions of several variables (10)
3.1 Partial derivatives and its geometrical interpretation
3.2 Differentiability of functions of several variables
3.3 The Chain rule
3.4 Implicit differentiation

Chapter 4. Application of partial derivatives (10)

4.1 Directional derivatives and gradient of functions of several variables
4.2 Tangent planes
4.3 Differentials and tangent plane approximations
4.4 Extreme values
4.5 Lagrange’s multiplier
4.6 Taylor’s theorem
Chapter 5 Multiple integrals (12)
5.1 Double integrals
5.2 Double integrals in polar coordinates
5.3 Surface area
5.4 Triple integrals
5.5 Triple integrals in cylindrical and spherical coordinates
5.6 Change of variables in multiple integrals
Chapter 6. Calculus of vector field (14)
6.1 Vector field
6.2 The divergence and curl of a vector field
6.3 Line integrals
6.4 Green’s theorem
Teaching & learning Methods Gapped Lecture, Question and answer, Discussion ,Class work ,Homework
Demonstration, Group work
Assessment 1. Quiz (1) ………………………………….........5%
2. Assignment (1) ……………….……………..10%
48
 3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements
Text: Robert Ellis and Denny Gulick, Calculus with analytic geometry, 5thed, 1993.
References:
 Leithold, The calculus with analytic geometry, 3rd Edition, Herper& Row, publishers.
 R. T. Smith and R. B. Minton, Calculus concepts and connections, McGram-Hill book company,
2006
 D. V. Widder, Advanced calculus, Prentice-Hall, 1979
 Ross L. Finney et al, Calculus, Addison Wesley, 1995
 E. J. Purcell and D. Varberg, Calculus with analytic geometry, Prentice-Hall INC., 1987
 Adams, Calculus: A complete course, 5th ed, Addison Wesley, 2003
 R. Wrede and M. R. Spiegel, Theory of advanced calculus, 2nd ed., McGraw-Hill, 2002.
 A. E. Taylor and W. R. Mann, Advanced calculus, 3rded, John-Wiley and Son, INC, 1995.

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Calculus of Functions of Several and Complex Variables
Module No. 07
Module code Math-M2071
Course Title Functions of Complex Variable
Course Code Math2072
Course EtCTS 7
Course Category Core
Instructor’s Name_____________________________
Information Office No.__________________
Phone No. __________________
Consultation hours: __________________
E-mail: __________________
Module Coordinator
Study Workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
64 32 0 8 85 189
49
Lecture Time Days Hrs Room

Tutorial Time Days Hrs Room

Target Group 2nd year mathematics students

Semester II
Pre-requisite(s) Math2071
Course Objectives
On completion of the course, successful students will be able to:
- understand the significance of differentiability of complex functions,
- define analytic function,
- distinguish between differentiable functions and analytic functions,
- apply Cauchy-Riemann equations,
- evaluate integrals along a path in the complex plane,
- understand the statement of Cauchy's Theorem,
- understand Cauchy integral formula,
- apply Cauchy integral formula to evaluate line integrals,
- represent analytic functions by a power series,
- prove Fundamental Theorem of Algebra,
- distinguish the singularities of a function,
- write the Laurent series of a function,
- calculate the residue,
- apply the Residue theorem,
- understand the properties of Mobius transformation and its action on circles.
Course Contents/description
Chapter 1: Complex numbers(8)
1.1 Definition of the complex numbers and their operations
1.2 Geometric representation and polar form of complex numbers
1.3 De-Moiver’s formula
1.4 Root extraction
1.5 The Riemmann and the extended complex plane
Chapter 2: Analytic functions (14)
2.1 Elementary functions
2.2 Open and closed sets, connected sets and regions in complex plane
2.3 Definitions of limit and continuity
2.4 Limit theorem
2.5 Definition of derivative and its properties
2.6 Analytic function and their algebraic properties
2.7 Conformal mappings
2.5 The Cauchy Riemann equations and harmonic conjugates

Chapter3: Cauchy's Theorem(14)

3.1 Definition and basic properties of line integrals
3.2 Intuitive version of Cauchy's theorem
3.3 Cauchy's theorem on simply connected regions
3.4 Cauchy – Goursat theorem for a rectangle
3.5 The Cauchy integral formula
3.6 The Maximum Principle

Chapter 4: Series representation of analytic functions(10)

50
 4.1 Basic definitions and properties of sequence and series
4.2 Taylor’s theorem
4.3 Liouville’s theorem
4.4 Laurent series and classification of singularities
Chapter 5: Calculus of residues(8)
5.1 Calculation of residues
5.2 The Residue theorem and its application
5.3 Evaluation of definite integrals
Chapter 6: The Mobius transformation(10)
6.1 Examples of mapping by functions
6.2 Magnification, translation, and rotation
1
6.3 The map w 
z
6.4 Definition of Mobius transformation and basic properties
6.5 The cross –ratios
Teaching &  Gapped Lecture, Question and answer, Discussion ,Class work ,Homework ,
learning
Methods Demonstration, Group work
Assessment 1. Quiz (1) ………………………………….........5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements
Text book:
- R. V. Churchill and J. W. Brown, Complex variables and applications, McGraw-Hill, Inc
- Jerrold Marsden & Michael J. Hoffman, Basic Complex Analysis
References:
Robert B. Ash, Complex variables, Academic press, 1971
R. E. Greene and S. G. Krantz, Functions of one complex varaiable, John Wiley & Sons, INC., 1997
N. Levinson & R. M. Redheffer, Complex variables, The McGram-Hill publishing company Ltd, 1980
A. I. Markushevich, Theory of functions of complex variable, Prentice-Hall INC., 1965
N. H. Asmar, Applied complex analysis with partial differential equations, Prentice Hall, 2002
A. D. Wunsch, Complex variables with applications, Addison-Wesley, 1994

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Computational Mathematics
Module No 06
Module Code Math-M 2060
Course Title Numerical Analysis I

51
Course Code Math2061
EtCTS 5
Course type Core
Module Coordinator
Instructor’s information Name:____________________________
Office No._________________________
Phone No:_________________________
email :____________________________
Consultation hours:__________________
Work load Lecture Tutorial Lab Assessment Home study Total hour
(in Hrs) work
48 32 0 8 47 135

Lecture time Days Hours Room

Tutorial time Days Hours Room

Target Group Second year Mathematics

Semester II

Pre-requisites Math 1021, Comp 1011

Course Objectives
On completion of the course, successful students will be able to:
- understand sources of errors,
- identify absolute and relative errors,
- understand a range of iterative methods for solving linear and non-linear systems of equations,
- comprehend the convergence properties of the numerical methods,
- understand the roles of finite differences,
- grasp practical knowledge of polynomial interpolation in numerical different ion and integration,
- appreciate the application of basic linear algebra and calculus concepts in deriving the numerical
algorithms,
- examine how a small change in the data and ill-conditioned algorithms affect the solution of the
mathematical problems,
- translate mathematical algorithms into computer programming,
- interpret computer outputs

Course Contents
Chapter 1: Basic concepts in error estimation (12 hrs)
1.1 Sources of errors
1.2 Approximations of errors
1.3 Rounding off errors
1.4 Absolute and relative errors
1.5 Propagation of errors
1.5. Instability
Chapter 2: Nonlinear equations (8 hrs)
2.1 Locating roots
2.2 Bisection method
2.3 Interpolation and Secant methods

52
 2.4 Iteration Methods
2.5 Conditions for convergence
2.5 Newton-Raphson Method
Chapter 3: System of equations (15 hrs)
3.1 Direct methods for system of linear equations (SLE)
3.1.1 Gaussian method
3.1.2 Gaussian method with partial pivoting
3.1.3 Jordan's method
3.1.4 Jordan’s method for matrix inversion
3.1.5 Matrix decomposition
3.1.6 Tri-diagonal matrix method
3.2 Indirect methods for SLE
3.2.1 Gauss Jacobi method
3.2.2 Gauss Seidel method
3.3 Systems of non-linear equations using Newton's method
Chapter 4: Finite differences (5 hrs)
4.1 Shift operators
4.2 Forward difference operators
4.3 Backward difference operators
4.4 Central difference operators
Chapter 5: Interpolations (11 hrs)
5.1 Linear interpolation
5.2 Quadratic interpolation
5.3 Lagrange's interpolation formula
5.4 Divided difference formula
5.5 Newton interpolation formula (forward and backward formulas)
Chapter 6: Application of interpolations (5 hrs)
6.1 Finding roots
6.2 Differentiation
6.3 Integration (Trapezoidal and Simpson's rule)

Teaching & learning Methods Questioning and answering, Lecture, Pair discussion, Class
Work, Gapped Lecture, Demonstrations, laboratory work
Assessment 1. Quiz (1) ……………………………………….5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements

Textbook:- Gerald C. F. and Wheatlly P. O., Applied numerical Analysis 5th ed, Edsion Wesley,Co
References:
- Richard L. Burden, Numerical Analysis, 1981, 2nd Ed.
- P.A. Strock, Introduction to numerical analysis
- Volkov, Numerical methods 1986
- Frank Ayres, Theory and Differential Equations (Schuam’s outline series, 1981)
- Robert Ellis and Denny Glick, Calculus with Analytical Geometry- 3rd Ed.

53
University __________________________________
College /faculty_____________________________
Department/Program Mathematics
Module Name Computational Mathematics
Module No 06
Module Code Math-M2060
Course Title Linear optimization
Course Code Math 2062
ECTS 5
Course category Core
Module Coordinator
Instructor’s information Name:____________________________
Office No._________________________
Phone No:_________________________
email :____________________________
Consultation hours:__________________
Study workload Lecture Tutorial Lab Assessment Home study Total hour
work
48 32 0 8 47 135

Lecture time Days Hours Room

Tutorial time Days Hours Room

Target Group Second year Mathematics students

Semester II

Pre-requisites Math 2041

Course Objectives

On completion of the course, successful students will be able to:

- understand the interplay between geometry and linear algebra,
- define a linear programming,
- understand matrix algebra,
- solve systems of linear equations,
- understand the fundamental principles of linear programming,
- formulate optimization problems,
- understand decision process with respect to an optimization problem,
- solve linear programs graphically,
- test convexity of sets,
- understand theorems and algorithms of the simplex method,
- solve linear programming problems by the simplex method,
- understand duality theorems,
- apply theorems and algorithms in duality theory,
- do sensitivity analysis,

54
 - comprehend the transportation problem,
- solve transportation problems,
- solve pure strategy games.

Course Contents

Chapter 1: Introduction to matrices (3 Hrs)

1.1 Introduction (definition of LP, Motivation, …)
1.2 Matrices ( Rank, Elementary row operations)
1.3 System of linear equations
1.3.1 n  n system: Gaussian Elimination Method
1.3.2 m  n system: Basic solutions
1.4 System of linear inequalities
Chapter 2: Linear programming models of practical problems (3 Hrs)
2.1 Introduction
2.2 Decision process and relevance of optimization
2.3 Model and model building
Chapter 3: Geometric methods (4 Hrs)
3.1 Graphical solution methods
3.2 Convex sets
3.3 Polyhedral sets and extreme points
3.4 The Corner Point theorem
Chapter 4: The Simplex method (12 Hrs)
4.1 Linear programs in standard form
4.2 Basic feasible solutions
4.3 Fundamental theorem of linear programming
4.4 Algebra of the simplex method
4.5 Optimality test and basic exchange
4.6 The simplex algorithm
4.7 Degeneracy and finiteness of simplex algorithm
4.8 Finding a starting basic feasible solution
4.8.1 The two-Phase method
4.8.2 The Big-M method
4.9 Using solver (MS EXCEL) in solving linear programming
Chapter 5: Duality theory and further variations of the simplex method (7 Hrs)
5.1 Dual linear programs
5.2 Duality theorems
5.3 The dual simplex method
5.4 The Primal-Dual simplex method
Chapter 6: Sensitivity analysis (6 Hrs)
6.1 Introduction
6.2 Variation of coefficients of objective function
6.3 Variation of vector requirement
6.4 Variation of constraints
6.5 Addition of new constraints or variables
6.6 Solver outputs and interpretations
Chapter 7: Interior point methods (6 Hrs)
7.1 Basic ideas
7.2 One iteration of Karmarkar’s projective algorithm
7.2.1 Projective transformation
7.2.2 Moving in the direction of steepest descent
7.2.3 Inverse transformation
55
 7.3 The algorithm and its polynomiality
7.4 A purification scheme
7.5 Converting a given LP into the required format
Chapter 8: Transportation problem (7 Hrs)
8.1 Introduction
8.2 Transportation table
8.3 Determination of an initial basic feasible solution
8.3.1 North-West corner rule
8.3.2 Row minima rule
8.3.3 Cost minima rule
8.4 Optimality conditions
8.5 Unbalanced transportation problems and their solutions
8.6 Degenerate transportation problems and their solutions
Chapter 9: Theory of games (2 Hrs)
9.1 Introduction
9.2 Formulation of two-person zero-sum games
9.3 Pure and mixed strategies
9.4 Solving pure strategy games
9.4.1 Reduction by dominance
9.4.2 The minimax (or maxmin) criterion
9.5 Some basic probabilistic considerations
9.6 Solving games with the simplex methods
9.7 2  n and m  2 games
Teaching & learning Methods Questioning and answering, Lecture, Pair discussion, Class
Work, Gapped Lecture, Demonstrations, Laboratory work
Assessment 1. Quiz (1) ……………………………………….5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements

References:
- Bertsimas and J. Tsitsiklis, Introduction to linear optimization, Athena Scientific, 1997
- Brian D. Bunday, Basic linear programming, Edward Arnold, 1984
- H. A. Taha, Operations research, an introduction, Macmillan publishing company, 2002
- F. S. Hillier and G. J. Lieberman, Introduction to Operation research, Holde-day, 2001
- Robert Fourer, David M. Gay, and Brian W. Kernighan, A modeling language for mathematical
programming, Boyd & Fraser publishing company, 1997
- R. J. Vanderbei, Linear programming: Foundations and extensions, 2001

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name First course in Modern Algebra &Number Theory

56
Module No. 09
Module code Math-M3091
Course Title Modern Algebra I
Course Code Math3092
Course EtCTS 5
Module coordinator
Instructor’s Name---------------------------------------------;
Information Office No. ----------------
Phone No.----------
E-mail:----------------
Consultation hours:--------
workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
48 32 0 8 47 135
Lecture Day Hour Room

Tutorial Day Hour Room

Target Group Third year mathematics students

Semester I
Pre-requisites Math1012
Status of the Course Core
Course Objectives
On completion of the course, successful students will be able to:
- understand the concept of groups and its properties,
- understand the action of a group on a set,
- determine the conjugacy classes,
- understand the concepts of a ring, subrings , ideals and quotient rings,
- grasp the concepts of Euclidean domain, unique factorization domain and principal ideal domains,
- understand the concept of field extension,
- distinguish between the different types of field extensions,
- state and prove the main theorems of classical group, ring and field theory,
- apply the main theorems of group rings and fields..
Course Contents/description
Chapter 1: Groups (18 hrs.)
1. 1 Definition and examples of a group
1.2 Subgroups
1.3 Cyclic groups
1.4 Cossets and Lagrange’s theorem
1.5 Normal subgroups and quotient groups
1.6 Groups homomorphism
1.7 Isomorphism theorems
57
 1.8 Direct sum of abelian groups and product of groups
1.9 Group of permutations
1.10 Group actions, conjugacy classes, and Cayley’s theorem
Chapter 2: Rings (18 hrs.)
2.1 Definition and examples of rings
2.2 Subrings
2.3 Ideals and quotient rings
2.4 Homomorphism of rings
2.5 Isomorphism theorems
2.6 Prime and maximal ideals
2.7 Quotient of integral domains
2.8 ED, UFD and PID
2.9 The ring of polynomials
2.10 Roots of polynomials, factorization of polynomials
Chapter 3: Introduction to field theory(12 hrs.)
3.1 Field extensions
3.2 Finite and algebraic extensions
3.3 Algebraic closure
3.4 Splitting fields and normal extensions
3.5 Separable and inseparable extensions
3.6 Finite fields
Teaching- learning methods Lecture, questioning &answering, Pair and individual work ,Problem solving
, Gap -lecturing and Reading assignment, discussion.

1. Quiz (1) ………………………………….......5%

Assessment 2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam-------------------------------------10%
7. Final Exam …………………………………....50%
Total…………………………………………......100%
Attendance Requirements
Textbook: - B. Fraleigh John, A First Course in Abstract Algebra, 2nd ed, Addison-Wesley
publishing Company, Reading
References:
J. J Gerald, Introduction to modern algebra(revised), 4th ed; University Book Stall,
Reading, 1989
D. S. Dummit and R. M. Foote, Abstract algebra, 3rd ed, John Wiley and Sons, 2004.
P. B. Bhattachara et-al, Basic abstract algebra, 2nd ed, Cambridge University press, 1995
N. H. Ma-Coy et-al, Introduction to abstract algebra, Academic Press, 2005
C. C. Pinter, A book of abstract algebra, McGram Hill, 1986
T. A. Whitelaw, Introduction to abstract algebra, Chapman and Hall, 2000
J. A. Gallian, Contemporary abstract algebra, D. C. Heath & Comp., 1994

University __________________________________
College /faculty_____________________________

58
Department/program Mathematics
Module Name First course in Modern Algebra and Number theory
Module No. 09
Module code Math-M3091
Course Title Introduction to Number Theory
Course Code Math3091
Course EtCTS
5
Instructor’s Name---------------------------------------------;
Information Office No. ----------------
Phone No.----------
E-mail:----------------
Consultation hours:--------
Module Coordinators
Study workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
48 32 0 8 47 135
Lecture Day Hour Room

Tutorial Day Hour Room

Target Group 3rd year mathematics students

Semester I
Pre-requisites Math1012
Status of the Course Core
Course Description
This course covers algebraic structure of integers, basic notions of divisibility theory, Diophantine equations,
theory of congruence and equations over finite rings, decimal representations of rational numbers, continued
fractions, and quadratic extension of rational numbers.

Course objectives
On completion of the course, successful students will be able to:
- explain basic properties of integers;
- use prime factorization of integers to find the LCM and GCF of two or more integers,
- compute the LCM and GCF of two or more integers with the help of Euclidean Algorithm,
- apply different techniques to solve Diophantine Equations,
- understand the basic notions of congruences,
- construct the rings of integers modulo n,
- apply Euler- Fermat Theorem,
- express a rational number as a decimal expansion,

59
 - differentiate the different types of continued fractions.
Contents
Chapter 1:Basic properties of integers (12hrs)
1.1Algebraic structure of integers
1.2 Order Properties: The relation of the Well Ordering Axiom and Mathematical Induction
1.3.Divisibility of integers
1.3.1Basic notions of factors, prime numbers, factorization, common multiple, common factor,
etc.
1.3.2The concept of relatively primeness
1.3.3Euclideanalgorithmand application to GCF
1.3.4Numbers with different bases and related concepts.
Chapter 2: Diophantine equations (6hrs)
2.1 Linear equations in one or more variables
2.2 The method of Euler in linear equations
2.3 Some general notions of Diophantine equations

Chapter 3: Theory of congruence (8hrs)

3.1 The notion of congruence and residue classes
3.2 Operations on congruence classes and basic properties
3.3 Basic facts from group theory in the Adams, W.W Goldstein, Introduction to Number Theory,
Prentice-Hall,1976 notion of congruences
3.4 Systems of linear congruences
Chapter4:TheEuler–Fermat theorem(10hrs)
4.1 The notion of complete system of residues
4.2 Euler quotient function, ϕ(m)
4.3 Euler-Fermat Theorem
4.4 An introduction to higher order congruence
4.5 Application of the Euler-Fermat Theorem to such congruencies
Chapter 5: Decimal expansion of rational numbers (6hrs)
5.1 The notion of decimal representation
5.2Typesof decimal representations
5.3Characterizing the rational using decimal representation .
Chapter 6: Other topics in number theory (6hrs)
6.1 Some examples of set of algebraic integers
6.2 Different completions of rational numbers
6.3Continued fractions in real numbers
Assessment 1. Quiz (1) …………………………………...5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements
Text Book

60
1. Adams, W.W Goldstein, Introduction to Number Theory, Prentice-Hall,1976
Recommended References
1.Adams, W.W Goldstein, Introduction to Number Theory, Prentice-Hall,1976
th
2.David M. Burston, Elementary Number theory, 5 ed., McGraw-Hill, 2002
3. Yismaw Alemu, Introduction to Elementary Theory of Numbers, Department of Mathematics, AAU

University________________________________
College/Faculty_____________________________
Department/Program Mathematics
Module Name Differential Equations
Module No. 08
Module Code Math-M3081
Course Title Ordinary Differential Equations
Course Code Math3081
Course EtCTS 5
Course Category Core
Module Coordinator
Instructor’s Information Name:__________________
Office No.:_________
Phone No.:_______________
Email:_______________
Consultation Hrs:________
Status of Course Core
Workload (in Hrs) Lecture Tutorial Lab Asse Home study Total
ssme
nt
48 32 0 8 47 135

Lecture Time Days Hrs Room

Tutorial Time Days Hrs Room

Target Group 3rd year Mathematics Students

Semester I
Pre-requisites Math 2071
Course Description
This course covers basic definitions and terminology, preliminary theory of first and higher order
linear ordinary differential equations (ODEs), method of solutions and their applications, series
solution, Laplace transform, and systems of first order linear differential equations.
Course Objectives
On completion of the course students will be able to:
 distinguish various classes of differential equations,
 understand the underlying theory of linear ODEs,
 understand various techniques of solving ODEs,
 apply the techniques to solve ODEs problems,
 apply the theory of power series to solve certain classes of differential equations,
 derive the properties of Laplace transform,
61
  apply Laplace transform to solve certain classes of ODE,
 understand the interrelation between ODEs and linear algebra,
 express physical problems in terms of differential equation. functions
Course Contents
Chapter 1: Basic definitions and terminology( 4 Hrs)
1.1 Definition of ODE and examples
1.2 Order of a differential equation, linear and nonlinear ODE
1.3 Nature of Solutions of ODE: particular and general solutions
Chapter 2: First Order differential equations(6 Hrs)
2.1 Initial value problem
2.2 Existence of a unique solution ( Picards theorem)
2.3 Method of separable of variables
2.4 Homogeneous equations
2.5 Exact equations, non exact equations and integrating factor
2.6 Linear equations
2.7 Orthogonal trajectories
Chapter 3: Higher order linear differential equations (14 Hrs)
3.1 Preliminary theory
3.1.1 Initial value problems (IVP) and existence of a unique solution to IVP
3.1.2 Boundary value problems( BVP)
3.2 Theory of solutions of linear equations
3.2.1 Linear dependence and linear independence, the Wronskian
3.2.2 Homogeneous linear equations
3.2.3 Superposition principle
3.2.4 Linearly independent solutions and existence of fundamental set of solutions for
homogeneous equations
3.2.5 Particular and general solutions of non-homogeneous equations
3.3 Solution methods of certain class of linear equations
3.3.1 Reduction of order
3.3.2 Constructing a second solution from a known solution
3.3.3 The method of undetermined coefficients
3.3.4 Variation of parameters
3.4 Applications of second ODEs to simple harmonic and damped motions
Chapter 4: Series solutions(10 Hrs)
4.1 Review of power series, power series solutions
4.2 Ordinary points and singular points of a linear second order ODEs
4.3 Series solutions of linear second order ODEs about ordinary points
4.4 Series solutions of linear second order ODEs about singular points
4.5 Regular and irregular singular points of a second order ODEs
4.6 The Method of Frobenius linear
4.7 The Gamma function and its properties
4.8 Solutions of Bessel's equation
4.9 Legender’s equation
Chapter 5: Laplace transform (6 Hrs )
5.1 Definition of Laplace transform
5.2 Inverse Laplace transform
5.3 Translation Theorem and derivative
5.4 Application to IVP
Chapter 6: Systems of linear first order differential equations (8 Hrs)
6.1 Definition of nth-order system of linear ODE and examples
6.2 Matrix form of a system and solution vector

62
 6.3 Initial value problem of a system and existence of a unique solution
6.4 Fundamental solutions of a homogeneous system
6.5 Non-homogeneous system and general solution
Teaching & learning Methods Lecture, Questioning and answering, Pair Discussion, Reading assignment
Evaluation, project
Assessment 1. Quiz (1) …………………………………...5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
4. Presentation ……………………………..........5%
5. Take home exam----------------------------------10%
6. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements
Textbook: Dennis G Zill, A first course in differential equations
References:
W. E. Boyce & R. C. DiPrima, Elementary differential equations and boundary value
problems, 7th ed. John Wiley & Sons, INC., 2001
Nagel et al, Fundamentals of differential equations, 5th ed., Addison Wesley Longman, 2004
Martin Braun, Differential equations and their applications, Springer-Verlag, 1993
E. D. Rainville and P. E. Bedient, Elementary differential equations, MacMillan publishing
company, 1999

University________________________________
College/Faculty_____________________________
Department/Program Mathematics
Module Name Differential Equations
Module No. 08
Module Code Math-M3081
Course Title Partial Differential Equations
Course Code Math3082
Course EtCTS 5
Course Category Core
Module Coordinator
Instructor’s Information Name:__________________
Office No.:_________
Phone No.:_______________
Email:_______________
Consultation Hrs:________
Status of Course Core
Workload (in Hrs) Lecture Tutorial Lab Asse Home study Total
ssme
nt
48 32 0 8 47 135

Lecture Time Days Hrs Room

Tutorial Time Days Hrs Room

63
Target Group 3rd year Mathematics Students
Semester II
Pre-requisites Math 3081
Course Description
This course discusses basic concepts of partial differential equations (PDE), some techniques of
solutions of first order PDE, Fourier series, second order PDE and analytical methods of solutions.
Course Objectives
On completion of the course students will be able to:
 define Fourier series of periodic functions,
 expand periodic functions in terms of sine and cosine,
 compute Fourier series,
 determine the order and classification of PDEs
 solve PDEs,
 model some physical problems using PDEs,
 apply Fourier and Laplace transforms for solving PDEs,
 solve one dimensional heat flow and wave equations,
 solve Laplace equations,
 understand generalized functions,
 apply generalized functions.
Course Contents
Chapter1: Fourier series and orthogonal functions (10 Hrs)
1.1 Orthogonal functions
1.2 Fourier series
1.2.1 Fourier series of functions with period 2
1.2.2 Fourier series of functions with arbitrary period
1.2.3 Fourier series of odd and even functions
1.3 Fourier integrals
1.4 Complex form of Fourier series
Chapter 2: Introduction to partial differential equations(8 Hrs)
2.1 Definitions and basic concepts
2.2 Classification of PDEs
2.3 Definition of initial/boundary value problems
2.4 Well-posedness of a problem
2.5 Modeling some physical problems using PDEs
Chapter 3: First order partial differential equations(8 Hrs)
3.1 Solution of first order PDEs with constant coefficients
3.2 Solution of a first order PDEs with variable coefficients
3.3 Charpit’s method
3.4 Application of a first order PDEs to fluid flow problems
Chapter 4: Fourier transform(10 Hrs)
4.1 Fourier transform and its inverse
4.2 Properties of Fourier transform
4.3 Fourier sine and cosine transforms
4.4 Convolution
Chapter 5: Second order partial differential equations ( 12 Hrs)
5.1 Definition and classification of second order PDEs
5.2 Method of separation of variables

64
 5.3 One dimensional heat and their solutions by using methods of Fourier transform
5.4 One dimensional wave equations and their solutions by using methods of Fourier transform
5.5 The potential(Laplace) equation
5.6 Fourier and Laplace transforms, applied to other PDE
Teaching & learning Methods Lecture, Questioning and answering, Pair Discussion, Reading assignment
Evaluation, project
Assessment 1. Quiz (1) …………………………………...5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
4. Presentation ……………………………..........5%
5. Take home exam----------------------------------10%
6. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements
Textbook: I.N. Sneddon, Elements of partial differential equations
References:
R. C. Mcowen, Partial differential equations, methods and applications, Pearson
education, INC, 2003
H. M. Lieberstein, Theory of partial differential equations, Academic press, 1972
R. B. Gunther & J. W. Lee, Partial differential equations of physics, Dover, 1996

University________________________________
College/Faculty_____________________________
Department/Program Mathematics
Module Name Advanced Calculus of Function of one variable
Module No. 10
Module Code Math-M3101
Course Title Advanced Calculus of Function of one variable
Course Code Math3101
Course EtCTS 7
Course Category Core
Module Coordinator
Instructor’s Information Name:__________________
Office No.:_________
Phone No.:_______________
Email:_______________
Consultation Hrs:________
Status of Course Core
Workload (in Hrs) Lecture Tutorial Lab Asse Home study Total
ssme
nt
64 32 0 8 85 189

Lecture Time Days Hrs Room

Tutorial Time Days Hrs Room

65
Target Group 3rd year Mathematics Students
Semester I
Pre-requisites Math 1022
Course Description
This course deals with the Well Ordering Principle, principle of mathematical
induction, least upper bound property of the real number system, sequence of real
numbers, the topology of the real numbers, limits, continuity, differentiation, and the
Riemann integral and its properties.
Course Objectives
On completion of the course students will be able to:
 understand the essential properties of the real number system
 understand the concept of sequences in depth and related results,
 understand the topology of the real numbers,
 understand the concepts of limit and continuity in a more general settings,
 master the theory of differentiation and its consequences,
 understand the definition of the Riemann integral,
 understand proofs of the standard results about the Riemann integral,
 compute Riemann integrals of functions.
Course Contents
Chapter 1: Topology of the real number system (26 Hrs)
1.1 Principle of mathematical induction and the Well Ordering Principle
1.2 The least upper bound property and some of its consequences
1.3 Convergent sequences
1.4 Limit theorems
1.5 Monotone sequences
1.6 Nested interval theorem
1.7 Bolzano-Weierstrass theorem
1.8 Cauchy sequences
1.9 Limit superior and inferior of a sequence
1.10 Open and closed sets
1.11 Compact sets; the Heine -Borel theorem
Chapter 2 : Limit and continuity of a function(14 Hrs)
2.1 Limit and limit theorems
2.2 Definition and algebra of continuous functions
2.3 Definition and properties of differentiable functions (such as maximum
and minimum value and the Intermediate Value Theorem)
2.4 Uniform continuity and its consequences
2.5 Monotonic functions
Chapter 3 : Differentiation(12 Hrs)
3.1 Differentiable functions
3.2 Properties of differentiable function
3.3 Higher derivatives
3.4 Extended mean value theorem and Taylor’s formula
Chapter 4: The Riemann integral(12 Hrs)
4.1 Definition of the integralS
4.2 Conditions for Riemann integrability
4.3 The class of Riemann integrable functions
4.4 Properties of Riemann integrable functions
Teaching & learning Methods Lecture, Questioning and answering, Pair Discussion, Reading assignment

66
 Evaluation, project
Assessment 1. Quiz (1) …………………………………...5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
4. Presentation ……………………………..........5%
5. Take home exam----------------------------------10%
6. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements
Textbook: D. R. Lick, Advanced calculus of one variable
References:
R. R. Goldberg, Methods of real analysis, 1970
S. C. Malik, Mathematical Analysis, 2nd ed., 1992
Douglas S. Bridges, Foundations of real and abstract analysis, Springer, 1998
Robert G. Bartle, The elements of real analysis, John Wiley & Sons INC., 1964
Walter Rudin, Principles of mathematical analysis, 3rd ed., McGraw-Hill, 1976
Hans Sagan, Advanced Calculus, Houghton Mifflin company

University
College/Faculty
Department/ program Mathematics
Module Name Mathematical modeling & project
Module No 11
Module Code Math – M3111
Course Title Project I
Course Code Math3112
Module Coordinator
Pre-requisites Permission of project advisor
Semester I
Status of Course Core
Instructor information Name
Office number
Phone number
E-mail
Consultation hours
The Credit in ECTS 1.5
Work load (In Hrs ) Lecture Advise Assessment Home study Total

0 16 1 23.5 40.5

Course Objectives
At the end of project I, the student will be able to:
- formulate researchable project problem or prove conjecture,
- do independent literature reading,
- write project proposal,
- Present project progress report.

67
Course description
The project work has three major components: Literature study, research project, and seminar presentation. The
relative weight of each will vary according to topic area, the level of preparedness of the participant(s), and the
number of students in the study group. Possible research tasks include formulating and proving a conjecture,
proving a known theorem in a novel way, investigating a mathematical problem by computer experiments, or
studying a problem of practical importance using mathematical methods.
Assessment 

 project presentation………………………………………... 100%

University
College/Faculty
Department/ program Mathematics
Module Name Mathematical modeling & project
Module No 11
Module Code Math – M3111
Course Title Project II
Course Code Math3113
Degree Program B.Sc. in Mathematics
Module Coordinator
Pre-requisites Project I
Semester II
Status of Course Compulsory
Instructor informationName
Office number
Phone number
E-mail
Consultation hours
The Credit in ECTS 3.5
Weekly hour of course Lecture Advise Assessment Home study Total
element
0 32 1 61.5 94.5

Course Objectives & Competences Acquired

At the end of project II, the student will be able to:
- analyze mathematical problem or prove conjecture,
- write scientific project report,
- present final project report.
Course Contents/description
The project work has three major components: Literature study, research project, and seminar presentation. The
relative weight of each will vary according to topic area, the level of preparedness of the participant(s), and the
number of students in the study group. Possible research tasks include formulating and proving a conjecture,
proving a known theorem in a novel way, investigating a mathematical problem by computer experiments, or
studying a problem of practical importance using mathematical methods.

68
Assessment/Evaluation
 project report ……………………………………………………..50%

 project presentation………………………………………... 50%

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Advanced Courses in Algebra
Module No. 12
Module code Math-M3122
Course Title Logic and Set Theory
Course Code Math3121
Course EtCTS 5
Course Category Elective
Instructor’s Name_____________________________
Information Office No.__________________
Phone No. __________________
Consultation hours: __________________
E-mail: __________________

Module Coordinator
Study Workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
48 32 0 8 47 135
Lecture Time Days Hrs Room

Tutorial Time Days Hrs Room

Target Group 3rd year mathematics students

Semester I
Pre-requisite(s) Math1012
Course Objectives
On completion of the course, successful students will be able to:
- understand the statement calculus,
- apply rules of inferences,
- prove validity of arguments,
- understand the axiomatic approach to set theory,
- understand algebra of sets,
- determine equivalence classes,
- understand the construction of natural numbers,
- understand the notion of cardinal and ordinal numbers,
- apply counting principles in classification of sets,
- state the Well Ordering Principle,
- state the Axiom of Choice and Zorn’s lemma.
69
Course Contents/description
Chapter 1: Propositional and predicate logic (16)
1.1 Sentential connectives and truth tables
1.2 The statement calculus
1.3 Validity
1.4 Consequence and Rules of Inference
1.5 Application
1.6 Symbolizing Everyday Language
1.7 Predicate Calculus
1.8 Consequence
Chapter 2: Introduction to set theory(8)
2.1 Intuitive set theory
2.2 Axiomatic set theory
2.3 The primitive notions and axioms
2.4 Algebra of sets
Chapter 3: Relations and functions (8)
3.1 Ordered pairs, Cartesian Products and relations
3.2 Functions
3.3 Equivalence and ordering relations
Chapter 4: The natural numbers (4)
4.1 Construction of the natural numbers
4.2 Arithmetic and ordering on a set of natural numbers

Chapter 5: Cardinal and ordinal numbers (8)

5.1 Cardinal numbers
5.2 Countable sets and cardinal arithmetic
5.3 Order types, well-ordered sets & ordinal numbers
Chapter 6: The Axiom of Choice, the Well Ordering theorem and alephs(4)
6.1 The axiom of choice
6.2 The Well Ordering theorem
Teaching & learning Methods Questioning and answering, Lecture, Pair discussion, Class Work, Gapped
Lecture, Demonstrations
Assessment 1. Quiz (1) ………………………………….........5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements
Literature Textbook: - R. R. Stoll, Set theory and logic
REFERENCES:
- AdemeMekonen, Logic and Set theory, Department of
Mathematics,AAU,
2007
-YiannisMoschovakis, Notes on set theory, 2nd ed., Springer
-Peter T. Johnstone, Notes on logic and set theory, Cambridge University
press, 1987
George Tourlakis, Lectures in logic and set theory, Cambridge University
press, 2003
M. L. Bettinger, Logic, Proof, and sets, Adison-Wesley, 1982
70
 I. Copi& C. Cohen: Introduction to logic, Maxwell Macmillan, 1990
R. S. Wolf: Proof, logic and conjucture, The mathematics toolbox, 1998
J. Barkley Rosser, Logic and set theory
P.R. Halmos, Naïve Set theory
H.B. Enderton, Elements of set theory

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Advanced Courses in Algebra
Module No. 12
Module code Math-M3122
Course Title Modern Algebra II
Course Code Math3122
Course EtCTS 5
Course Category Elective
Instructor’s Information Name_____________________________
Office No.__________________
Phone No. __________________
Consultation hours: __________________
E-mail: __________________

Module Coordinator
Study Workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
48 32 0 8 47 135
Lecture Time Days Hrs Room

Tutorial Time Days Hrs Room

Target Group 3rd year mathematics students

Semester II
Pre-requisites Math3091
Course Objectives
On completion of the course, successful students will be able to:
- comprehend the concepts in Galois theory,
- state the fundamental theorem of Galois theory,
- solve polynomials by radical,
- compute the Galois group of a polynomial,
- define and give an example of a module,
- understand the concept of modules and their properties,
- state and prove the main theorems of Galois theory,
- state and prove the main theorems of Module theory,
- determine the isomorphism of two modules,
- define a module over PID,
- define different types of rings,
71
 - define exact sequences,
- determine the Jordan and canonical forms.
Course Contents/ description
Chapter 1: Galois theory (14)
1.1 Basic definitions
1.2 The fundamental theory of Galois theory
1.3 The Galois group
1.4 Properties of the Galois group
1.5 Galois group of a polynomial
1.6 Solvability by radicals
Chapter 2: Module theory (13)
2.1 Definition and examples of a module
2.2 Basic properties of modules
2.3 Submodules
2.4 Quotient modules and module homomorphisms
2.5 Generation of modules, direct sums, and free modules
2.6 Exact sequences, projective, injective and flat modules
Chapter 3: Modules over PID (9)
3.1 The basic theory
3.2 The rational canonical form
3.2 The Jordan canonical form
Chapter 4: Introduction to commutative rings (12)
4.1 Primary decomposition of ideals
4.2 Integral dependence and valuation
4.3 Noetherian rings
4.4 Artinian rings
Teaching & learning Methods Questioning and answering, Lecture, Pair discussion, Class Work, Gapped
Lecture, Demonstrations
Assessment 1. Quiz (1) ………………………………….........5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements

Literature Textbook: - B. Fraleigh John, A First Course in Abstract Algebra,

2nded, Addison-Wesley publishing Company, Reading
References:
- J. J Gerald, Introduction to modern algebra(revised), 4thed; University
Book Stall, Reading, 1989
- D. S. Dummit and R. M. Foote, Abstract algebra, 3rded, John Wiley and
Sons, 2004.
- P. B. Bhattacharaet-al, Basic abstract algebra, 2nded, Cambridge
University press, 1995
- N. H. Ma-Coy et-al, Introduction to abstract algebra, Academic Press,
2005
- C. C. Pinter, A book of abstract algebra, McGram Hill, 1986
- T. A. Whitelaw, Introduction to abstract algebra, Chapman
and Hall, 2000
72
 - J. A. Gallian, Contemporary abstract algebra, D. C. Heath & Comp.,
1994

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Advanced Courses in Algebra
Module No. 12
Module code Math-M3122
Course Title Introduction to Algebraic Geometry
Course Code Math3123
Course EtCTS 5
Course Category Elective
Instructor’s Name_____________________________
Information Office No.__________________
Phone No. __________________
Consultation hours: __________________
E-mail: __________________
Module Coordinator
Study Workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
48 32 0 8 47 135
Lecture Time Days Hrs Room

Tutorial Time Days Hrs Room

Target Group 3rd year mathematics students

Semester II
Pre-requisites Math3091
Course Objectives
On completion of the course, successful students will be able to:
- comprehend the concept of algebraic geometry,
- understand the relationship between algebra and geometry
- solve problems in algebraic geometry,
- perform parameterization of affine varieties,
- understand Groebner bases and their properties,
- apply Groebner bases,
- find sums, products, and intersections of ideals
- decomposition of a variety into irreducibles.
Course Contents
Chapter 1: Geometry, algebra, and algorithms(5)
1.1 Polynomials and affine space
1.2 Affine varieties
1.3 Parametrizations of affine varieties
1.4 Ideals
1.5 Polynomials of one variable
73
Chapter 2: Groebner bases (11)
2.1 Introduction
2.2 Orderings on the monomials in k[x1, . . . , xn]
2.3 A division algorithm in k[x1, . . . , xn]
2.4 Monomial ideals and Dickson’s Lemma
2.5 The Hilbert basis theorem and Groebner bases
2.6 Properties of Groebner bases
2.7 Buchberger’s algorithm
2.8 First Applications of Groebner bases
2.9 Improvements on Buchberger’s algorithm (Optional)
Chapter 3: Elimination theory (8)
3.1 The elimination and extension theorems
3.2 The geometry of elimination
3.3 Implicitization
3.4 Singular points and envelopes
3.5 Unique factorization and resultants
3.6 Resultants and the extension theorem
Chapter 4: The algebra–geometry dictionary (12)
4.1 Hilbert’s Nullstellensatz
4.2 Radical ideals and the ideal–variety correspondence
4.3 Sums, products, and intersections of ideals
4.4 Zariski closure and quotients of ideals
4.5 Irreducible varieties and prime ideals
4.6 Decomposition of a variety into irreducibles
4.7 Primary decomposition of ideals (Optional)
Chapter 5: Polynomial and rational functions on a variety (12)
5.1 Polynomial mappings
5.2 Quotients of polynomial rings
5.3 Algorithmic computations in k[x1, . . . , xn]/I
5.4The coordinate ring of an affine variety
5.5 Rational functions on a variety
5.6 Proof of the closure theorem (Optional)
Teaching & learning Methods Questioning and answering, Lecture, Pair discussion, Class Work, Gapped
Lecture, Demonstrations
Assessment 1. Quiz (1) ………………………………….........5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements
Literature Textbook: - David Cox , John Little, Donal O’Shea , Ideals Verities
and
Algorithms:An Introduction to Computational
Algebraic
Geometry and Commutative Algebra, 3rded Springer,
2007.
References: - Miles Reid, Undergraduate algebraic geometry,
Cambridge University press, 1998.
- William Fulton, Algebraic curves: An introduction to
74
 algebraic geometry, Addison Wesley, 1974.
- George R. Kempf, Algebraic verities, Cambridge
University press, 1993

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Advanced Computational Mathematics II
Module No. 16
Module code Math-M3162
Course Title Nonlinear Optimization
Course Code Math3163
Course EtCTS 5
Course Category Elective
Instructor’s Information Name_____________________________
Office No.__________________
Phone No. __________________
Consultation hours: __________________
E-mail: __________________
Module Coordinator
Study Workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
48 32 0 8 47 135
Lecture Hrs, Days & Room
Tutorial Days & Hours
Target Group
Semester
Pre-requisites Math2062
Course Objectives
On completion of the course, successful students will be able to:
- define convex sets and convex functions,
- determine continuity and differentiability of convex functions,
- understand the fundamental principles of nonlinear programming,
- formulate a problem statement as a mathematical model,
- test necessary and sufficient optimality conditions,
- understand Kuhn-Tucker conditions,
- solve nonlinear programming problems,
- apply penalty method,
- apply Lagrange method,
- apply iterative methods for solving convex optimization problems,
- solve discrete optimization problems,
- understand the scope and limitation of modeling practical problems as nonlinear programs,
- apply graph theory to solve network oriented problems.
Course Outline
Chapter 1: Basic notions of convex analysis (7 hrs)
1.1 Affine and convex sets
1.2 Convex functions
75
 1.3 Continuity and differential property of convex functions
Chapter 2: Nonlinear optimization (17 hrs)
2.1 Convex optimization problems
2.2 Necessary and sufficient optimality conditions
2.3 Penalty methods
2.4 Lagrange-method and the Kuhn-Tucker conditions
2.5 Quadratic optimization problems
2.6 Separable optimization problems
2.7 Iterative methods for solving convex optimization problems

Chapter 3: Discrete optimization (12hrs)

3.1 Dynamic optimization
3.2 The Knapsack problem
3.3 Branch-and-Bound method

Chapter 4: Graph theory and network optimization(12 hrs)

4.1 Basic notions of graph theory
4.2 Paths and circuits
4.3 Trees and forests
4.4 Directed graphs
4.5 Network flow
4.6 Minimum and critical path problems
4.7 Maximal flow problems
Teaching & learning Methods Questioning and answering, Lecture, Pair discussion, Class Work, Gapped
Lecture, Demonstrations
Assessment 1. Quiz (1) ………………………………….........5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements
Literature Teaching materials
Textbook:
 Bazaraa, Sherali and Shetty, Nonlinear programming, 3rd Edition,
Wiley 2006
References:
 R. Deumlich, Lecture note for theory of optimization, Dept. of
mathematic AAU
 P. Whittle, Optimization under constraints
 Bertsekas, Nonlinear programming, Athena Scientific, 1999
 Fletcher, Practical methods of optimization, Wiley 2000
 Rockafellar, Convex analysis, Princeton, 1970
 Mangasarian, Nonlinear programming, SIAM, 1994
 Boyd and Vandenberghe, Convex optimization, Cambridge, 2004
 algorithms, Duxbury Press, Belmont, 1994
 Eric V. Denardo, The science of decision making: a problembased

76
 approach using Excel, John Wiley & Sons, Inc., 2002

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Advanced Geometry and Philosophy of Mathematics
Module No. 17
Module code Math-M 3172

Course Title Introduction to Differential Geometry

Course Code Math3171
Course EtCTS 5
Course Category Elective
Module coordinator
Instructor’s Information Name_______________________________________
Office No. ___________________________
Phone. No.__________________________
E-mail:_______________________________
Consultation hours:_________________________
Study workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
48 32 0 8 47 135
Days Hours Room
Lecture Time
Tutorial Time
Target Group third year mathematics students
Semester I
Pre-requisites Math 2057& Math 2052
Course description: This course covers calculus on Euclidean spaces, frame fields, Euclidean geometry, and
calculus on a surface and shape operators.
Course Objectives
On completion of the course, successful students will be able to:
 comprehend the basic principles of differential geometry,
 analyze calculus on general spaces,
 understand the properties of curves and surfaces,
 find covariant derivatives,
 define orientation,
 comprehend topological properties of surfaces and manifolds
 Compute curvature integral forms.
Course Contents

Chapter 1: Calculus on Euclidean space (10hrs)

1.1 Euclidean space

1.2 Tangent vectors
1.3 Directional derivatives
77
 1.4 Curves in
1.5 Forms
1.6 Differential forms
1.7 Mappings
Chapter 2: Frame fields (9hrs)

2.1 Dot product

2.2 Curves
2.3 The Frenet formulas
2.4 Arbitrary-speed curves
2.5 Covariant derivatives
2.6 Frame fields
2.7 Connection forms
2.8 The structural equations
Chapter 3: Euclidean geometry(9hrs)

3.1 Isometries of
3.2 The Derivative map of an isometry
3.3 Orientation
3.4 Euclidean geometry
3.5 Congruence of curves
3.6 Summary

Chapter 4: Calculus on a surface (12hrs)

4.1 Surfaces in
4.2 Patch computations
4.3 Differentiable functions and tangent vectors
4.4 Differential forms on a surface
4.5 Mappings of surfaces
4.5 Integration of forms
4.6 Topological properties of surfaces
4.7 Manifolds

Chapter 5: Shape operators (8hrs)

5.1. The shape operator of

5.2. Normal curvature
5.3. Gaussian curvature
5.4. Computational techniques
5.5. Special curves in a surface
5.6. Surfaces of revolution
Teaching & learning Lecture Method, Discussion and Presentation, problem solving method,
Methods Reading assignment, questioning and answering.
Assessment 1. Quiz (1) …………………………………...5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%

78
Attendance
Textbooks:
 Barrett O'Neill, Elementary differential geometry, Academic press, 1966
References:
 Gabriel Lugo, Differential geometry in physic, Dept. of mathematical science Universty of North
Carolina at Wilmington,1998
 Do Carmo, M. P., Differential geometry of curves and surfaces, Prentice-Hall, New Jersey, USA
 Guggenheimer, H. W., Differential geometry, Dover Pub., New York, USA.
 Judith N. Cedrberg, Course in Modern Geometries, 2001, 2nd ed.
 Divid A. Thomas, Modern Geometry, 2002
 James W. Anderson, Hyperbolic Geometry, 2005, 2nd ed.
 College Geometry: A problem solving approach with applications, 2008, 2nd Ed.
 Edward C. Wallace Stephen F. West, Roads to Geometry, 2004, 3rd ed.

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Advanced Geometry and Philosophy of Mathematics
Module No. 17
Module code Math-M 3172

Course Title Projective Geometry

Course Code Math3172
Course EtCTS 5
Course Category Elective
Module coordinator
Instructor’s Information Name_______________________________________
Office No. ___________________________
Phone. No.__________________________
E-mail:_______________________________
Consultation hours:_________________________
Study workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
48 32 0 8 47 135
Days Hours Room
Lecture Time
Tutorial Time
Target Group third year mathematics students
Semester II
Pre-requisites Math 2052
Course description: This course covers introduction to projections, projective transformation, projective
plane, analytic projective geometry and projective description of conics.
Course Objectives
On completion of the course, successful students will be able to:
 comprehend the basic principles of projective geometry,
 understand some of the interrelations among various, geometries via projective geometry,
79
  understand the classical topics such as Desargues’ theorem, and Pappus theorem harmonic
sets, etc.,
 write equations of projective lines,
 apply cross ratio,
 understand the basic geometric and algebraic properties,
 understand the interrelations between projective, transformations and conic sections,
 solve problems and prove theorems in projective geometry
Course Contents

Chapter 1: Introduction to projections (10hrs)

1.1 Parallel projections of a line

1.2 The real projective plane
1.3 Central projections
1.4 Central projections of a line on intersecting lines
1.5 Central projections of a line on intersecting planes
1.6 The value of cross ratio of points, parallel and concurrent lines
1.7 Harmonic division

Chapter 2: Projective transformation (8hrs)

2.1 Definitions
2.2 Equations of projective transformations
2.3 Projective group
2.4 Projective transformations and projections
2.5 Projective transformations and conic sections

Chapter 3: The Projective Plane (12hrs)

3.1 The ideals definitions

3.2 Model of extended plane projective space
3.4 Projections in a broader sense
3.5 Duality: Co linearity and concurrence
3.6 Cross-Ratio and ideal element
3.7 Application of the cross ratio
3.8 Order on a projective line
3.9 Figures in a projective plane
3.10 Harmonic properties of complete figures

Chapter 4: Analytic projective geometry (10hrs)

4.1 Homogeneous coordinates of points

4.2 Equations of projective lines
4.3 Linear combination of points
4.4 Equations of tangents to projective conics
4.5 Homogeneous coordinates of lines
4.6 Equations of points
4.7 Linear combination of lines
4.8 The summation notation

Chapter 5: Projective description of conics (8hrs)

80
 5.1 Introduction: Pascal and Brianchol’s propositions
5.2 First projective view point of conics
5.3 Projective correspondence

Teaching & learning Lecture Method, Discussion and Presentation, problem solving method,
Methods Reading assignment, questioning and answering.
Assessment 1. Quiz (1) …………………………………...5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance
Textbooks:
 Tuller Van Nostrand Co., A Modern introduction to geometry, 1967
 C. F. Adler, Modern geometry, 2nd Ed., McGraw-Hill, 1967.
References:
 Judith N. Cedrberg, Course in Modern Geometries, 2nd, 2001, ed.
 Divid A. Thomas, Modern geometry, 2002
 James W. Anderson, Hyperbolic Geometry, 2005, 2nd ed.
 College Geometry: A problem solving approach with applications, 2008, 2nd Ed.
 Edward C. Wallace Stephen F., Roads to Geometry, West, 3rded, 2004.

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Advanced Geometry and Philosophy of Mathematics
Module No. 17
Module code Math-M 3172
Course Title History and Philosophy of Mathematics
Course Code Math3173
Course EtCTS 5
Course Category Elective
Module coordinator
Instructor’s Information Name_______________________________________
Office No. ___________________________
Phone. No.__________________________
E-mail:_______________________________
Consultation hours:_________________________
Study workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
48 32 0 8 47 135
Days Hours Room
Lecture Time
Tutorial Time
81
Target Group third year mathematics students
Semester II
Pre-requisites None
Course description: This course presents history and philosophy of mathematics in three eras: before, in and
after the eighteenth century. The values of learning the history of mathematics and the roles of different
mathematicians and countries in the development of mathematics are discussed. It helps students
appreciate that mathematics is an open science, the frontiers of which are always widened through the
interaction of theory and practice in different scientific relationships of physical quantities.
Course Objectives
On completion of the course, successful students will be able to:

 understand the philosophy of mathematics,

 tell the history of mathematics,
 recognize the values and advantages of learning the history of mathematics,
 describe the roles that ancient mathematicians played in the development of mathematics
and other advancement in science technology,
 appreciate the works and contributions of the ancient mathematicians just by looking at
their discoveries and their inventions,
 State the roles played by Mathematics in the development process of countries.
Course Contents

Chapter 1: Historical Dimension of Mathematics (20hrs)

1.1 Introduction
1.2 Primitive origin
1.3 Babylonians’ contribution
1.4 Egyptians’ contribution
1.5 The Greeks contribution
1.6 The Alexandrian Hellenistic Greek mathematics
1.7 The Hindu mathematics
1.8 The Arab/ Islam contribution
1.9 The Renaissance- Golden age
1.10 The present age mathematics
1.11 The great mathematicians behind mathematics

Chapter 2: Philosophical dimension of mathematics (20hrs)

2.1 Introduction
2.2 What is philosophy?
2.3 What is knowledge?
2.4 Philosophy of mathematics
2.5 The Absolutist
2.6 Logicism
2.7 Formalism
2.8 Intuitionism
2.9 Falliblism
2.10 Conventionalism
2.11 Empiricism
2.12 Quasi-Empiricism
2.13 Platonism

82
Chapter 3: Mathematics education (18hrs)

3.1 Introduction (Definition of mathematics and the scope of mathematics)

3.2 Mathematics and Logic
3.3 Values of mathematics education
Teaching & learning Lecture Method, Discussion and Presentation, problem solving method,
Methods Reading assignment, questioning and answering.
Assessment 1. Quiz (1) …………………………………...5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance
References:
 James Robert Brown, Philosophy of Mathematics: A contemporary introduction to the world of
proofs & pictures, 2nd ed., 2008
 W. S. Anglin, Mathematics: A concise history and philosophy, Springer, 1994
 Matthias Schirm, The philosophy of mathematics today, Clarendon Press Oxford, 1998
 William Ewald, From Kant to Hilbert: A source book in the foundation of mathematics, Oxford
University press, 1996
 Aspray, William, and Philip Kitcher, History and philosophy of modern mathematics, university of
Minnesota, 1988
 Philip Kitcher, The nature of mathematical knowledge, Oxford University press, 1984

UNIVERSITY----------------------------------
COLLEGE/FACULTY-----------------------------
Departement/Program Mathematics
Module Name Advanced computational Mathematics -II
Module No 16
Module Code Math-M3162
Course Title Numerical Analysis-II
Course Code Math3162
ECTS 5
Module Coordinator
Instructor Information Name
Office number
Phone number
E-mail
Consultation hours
Pre-requisites Numerical Analysis I
Course category Elective
Work load Lecture Tutorial Lab work Assessment Home study Total
(in hrs )
48 32 0 8 47 135

83
Lecture time Day hours room

Tutorial time
Target Group Third year Mathematics students
Semester II
Course Objectives & Competences Acquired
On completion of the course, successful students will be able to:
- use numerical methods for approximating functions,
- derive numerical methods for solving initial and boundary value
problems,
- investigate the stability and convergence properties of numerical methods,
- identify the numerical methods that preserve the quantitative behavior of solution,
- solve eigenvalue problems,
 - translate complex algorithms into computer programming format..
Course description: This course rigorously discusses the basic concepts review of interpolation and numerical
integration , approximation theory , numerical methods for IVP , and methods for solving eigen value problems
Course Contents
Chapter 1: Revision of numerical integration
1.1 Interpolation
1.2 Trapezoidal and Simpson’s rules, Gaussian quadrature
1.3 Multiple integration

Chapter 2: Approximation theory

2.1 Least-square approximation
2.2 Approximation of functions by orthogonal polynomials (such as
Chebyshev, Legendre and Fourier series)

Chapter 3: Numerical methods for ordinary differential equations

3.1 The initial value problem
3.1.1 Taylor’s method of order n
3.1.2 Euler’s methods
3.1.3 Runge-Kutta methods
3.1.4 Multistep methods
3.1.5 Higher-order equations and system
3.2 Boundary value problems
3.2.1 The Linear shooting method
3.2.2 The Shooting method for non linear problems
3.2.3 Finite Difference method for linear problems
3.2.4 Finite-Difference method for non linear problems

Chapter 4: Eigenvalue problems

4.1 Basic properties of eigen values and eigen vectors
4.2 The power method for finding dominant eigen values
4.3 Householder’s method and the QL algorithm
Teaching & learning Methods Lecture, Questioning and answering, Pair Discussion, Reading assignment
Evaluation, lab
Assessment  Practical work ……………….……………..20%
 Test (1&2)…………………………………….20%.
 Take home exam----------------------------------10%
 Final Exam …………………………………...50%

84
  Total…………………………………………...100%
Attendance Requirements
Textbook:
- Gerald C. F. and Wheatlly P. O., Applied Numerical analysis 5th ed, Edsion Wesley,Co
References:
- P.A. Strock, Richard L. Burden, Numerical Analysis- 2nd Ed 1981.
- Volkov, Numerical methods 1986
- Frank Ayres, Theory and Differential Equations Schuam’soutline series,
1981
- Robert Ellis and Denny Glick, Calculus with Analytical Geometry, 3rd Ed.
 - Murry R. Advanced Calculus, Spiegel Advanced Calculus for Engineering and Scientists- Murry
R. Spiegel

University________________________________
College/Faculty_____________________________
Department/Program Mathematics
Module Name Analysis
Module No. 13
Module Code Math-M3132
Course Title Advanced Calculus of Several variables
Course Code Math3133
Course EtCTS 5
Course Category Elective
Module Coordinator
Instructor’s Information Name:__________________
Office No.:_________
Phone No.:_______________
Email:_______________
Consultation Hrs:________
Course Category Core
Workload (in Hrs) Lecture Tutorial Lab Assessment Home study Total

48 32 0 8 47 135

Lecture Time Days Hrs Room

Tutorial Time Days Hrs Room

Target Group 3rd year Mathematics Students

Semester II
Pre-requisites Math2071
Course Description
This course covers the topics in Euclidean n–space and transformation, the topology on , limit and
continuity, differentiation, inverse function theorem, implicit function theorem, integration, and
Fubini’s theorem.
Course Objectives
On completion of the course students will be able to:

85
  understand basic properties of the Euclidean space and linear transformations on ,
 understand the various topological aspects in ,
 understand and apply the notion of convergence of sequences of points in in terms of sequences in
R,
 apply the concepts of limit and continuity of functions in one variable to functions defined on ,
 evaluate limits of functions defined on ,
 understand the concept of differentiability of a function on ,
 find derivatives and partial derivatives,
 apply the implicit function theorem,
 understand the theory of integration on ,
 apply Fubini theorem to compute integrals
 exhibit core skills in proofs.
Course Contents
Chapter 1: Euclidean n–space and transformation (8 Hrs)
1.1. Euclidean n – Space
1.2. Norm in
1.3. Inner product in
1.4. Linear transformation
1.5. Dual space of
CHAPTRE 2: Topology on (16 Hrs)
2.1. Interior, exterior, boundary and points of a Set.
2.2. Sequences
2.3. Product of sets
2.4. Open and closed sets
2.5. Compact sets
2.6. Connectedness
CHAPTER 3: Limit and continuity of functions on (8Hrs)
3.1. Vector valued functions
3.2. Limit and continuity of vector and real valued functions
3.3. Connectedness and continuity
3.4. Compactness and continuity
CHAPTER 4: Differentiation in (8Hrs)
4.1. The chain rule
4.2. Partial derivatives
4.3. Directional derivatives
4.4. Mean value theorem
4.5. Surjective function theorem and open mapping theorem
4.6. The inverse and the implicit functions theorem
CHAPTER 5: Integration in (8 Hrs)
5.1. Basic definition
5.2. Measure zero and content zero
5.3. Integrable functions
5.4. Fubini’s theorem
Teaching & learning Methods Lecture, Questioning and answering, Pair Discussion, Reading assignment
Evaluation, project
Assessment 1. Quiz (1) …………………………………...5%
2. Assignment (1) ……………….……………..10%

86
 3. Test (1&2)…………………………………….20%
4. Presentation ……………………………..........5%
5. Take home exam----------------------------------10%
6. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements
Textbook:
References:
W. H. Flemming, Functions of several variables, Addison-Wesly publishing company, INC,
1965
Bisrat Dilnesahu, Advanced calculus of several variables, Department of Mathematics, AAU
R. C. Werde & M. Spiegel, Advanced calculus, 2nd ed., McGraw-Hill, 2002
Ian Craw, Advanced calculus and analysis, University of Aderdeen, 2000
Michael Spivak, Calculus of manifolds
C. H. Edwards, Calculus of several variables

University________________________________
College/Faculty_____________________________
Department/Program Mathematics
Module Name Analysis
Module No. 13
Module Code Math-M3132
Course Title Introduction to Real Analysis
Course Code Math3132
Course EtCTS 5
Course Category Elective
Module Coordinator
Instructor’s Information Name:__________________
Office No.:_________
Phone No.:_______________
Email:_______________
Consultation Hrs:________
Course Category Core
Workload (in Hrs) Lecture Tutorial Lab Assessment Home study Total

48 32 0 8 47 135

Lecture Time Days Hrs Room

Tutorial Time Days Hrs Room

Target Group 3rd year Mathematics Students

Semester II
Pre-requisites Math3101
Course Description
The course covers the topics, series of real numbers, sequence and series of functions, power
series and stieltjes integral

87
Course Objectives
On completion of the course students will be able to:
 understand the concept of series of real number in depth and related results,
 understand the concepts of sequence and series of functions,
 understand the concept of power series
 understand the definition of the stieltjes integral,
 understand proofs of the standard results about the stieltjes integral,
 compute stieltjes integrals of functions.
Course Contents
Chapter 1 Series of real numbers (14 hrs)
1.1. Definition of convergent series
1.2. Series of nonnegative terms
1.3. The root and ratio tests
1.4. Absolute convergence
1.5. Multiplication of series
1.6. Rearrangements of a series
Chapter 2. Sequence and series of functions (12 hrs)
2.1. Definition of convergence of sequences and series of functions
2.2. Point –wise and uniform convergence
2.3. Uniform convergence and continuity
2.4. Integration and differentiation of sequence of functions
2.5. Equicontinuous family of functions
2.6. The stone – Weierstrass theorem
Chapter 3 Power series (10 hrs)
3. 1.The interval of convergence
3.2. Functions defined by power series
3.3. Taylor series
Chapter 4. Stieltjes integration (12 hrs)
4.1. Functions of bounded variation
4.2. The Darboux – Sieltjes integral
4.3. The Riemann Stieltjes integral
4.4. Integration and differentiation
4.5. necessary and sufficient conditions for Riemann integrability
Teaching & learning Methods Lecture, Questioning and answering, Pair Discussion, Reading assignment
Evaluation, project
Assessment 1. Quiz (1) …………………………………...5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
4. Presentation ……………………………..........5%
5. Take home exam----------------------------------10%
6. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements
Textbook: Walter Rudin, Principle of mathematical Analysis
References:
Richard R, Goldberg Methods of Real Analysis
Don R. Lick, The Advanced Calculus of One variable

88
University________________________________
College/Faculty_____________________________
Department/Program Mathematics
Module Name Analysis
Module No. 13
Module Code Math-M3132
Course Title Introduction to Topology
Course Code Math3131
Course EtCTS 5
Course Category Elective
Module Coordinator
Instructor’s Information Name:__________________
Office No.:_________
Phone No.:_______________
Email:_______________
Consultation Hrs:________
Status of Course Core
Workload (in Hrs) Lecture Tutorial Lab Assessment Home study Total

48 32 0 8 47 135

Lecture Time Days Hrs Room

Tutorial Time Days Hrs Room

Target Group 3rd year Mathematics Students

Semester I
Pre-requisites Math3101
Course Description
This is an introductory course in topology dealing with metric spaces treating topics such as open
sets, closed sets, continuity, convergence and completeness, and it extends the ideas to general
topological spaces.
Course Objectives
On completion of the course students will be able to:
 understand the definition of a metric space,
 distinguish between open balls and closed balls in a metric space,
 understand the definition and properties of open set in a metric space,
 know the conditions for equivalent metrics,
 understand the definition of a topology and topological space,
 determine whether a collection of subsets of a set is topology,
 distinguish the open and closed sets in a topological space,
 understand the definitions and properties of compact space,
 recognize compact subsets of a topological space,
 understand the definitions and properties of connected space,
 recognize connected subsets of a topological space,
 prove that two topological spaces are homeomorphic

89
Course Contents
Chapter 1. Metric spaces(14 Hrs)
1.1 Definition and examples of a metric space
1.2 Open sets and closed sets in metric spaces
1.3 Interior, closure and boundary
1.4 Continuous functions
1.5 Equivalence of metric spaces
1.6 Complete metric spaces
Chapter 2. Topological spaces(12 Hrs)
2.1 Definition and some examples of a topological space
2.2 Interior, closure and boundary
2.3 Basis and subbasis
2,4. Continuity and topological equivalence
2.5 Subspaces
Chapter 3. Connectedness(12Hrs)
3.1 Definition and theorems on connectedness
3.2 Connectedness and continuity
3.2 Connected subspaces of the real line
3.3 Applications of connectedness.
Chapter 4. Compactness(12 Hrs)
4.1 Compact spaces and subspaces
4.2 Compactness and continuity
4.3 Properties related to compactness
4.4 One–point compactification
4. 5 The Cantor set
Teaching & learning Methods Lecture, Questioning and answering, Pair Discussion, Reading assignment
Evaluation, project
Assessment 1. Quiz (1) …………………………………...5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
4. Presentation ……………………………..........5%
5. Take home exam----------------------------------10%
6. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements
Textbook: Fred H. Croom, Principles of Topology
S. Lipschutz, Theory and problems of general topology, McGraw-Hill 1965
References:
James R. Munkers, Topology a first course
George F. Simmons, Introduction to Topology and Modern Analysis
Bert Mendelson, Introduction to topology, 3rd ed., John D. Baum, Elements of point-set topology,

University _____________________
College/Faculty _____________________
Department/Program Mathematics

90
Module Name Advanced Computational Mathematics I
Module No 15
Module Code Math-M3152
Course Title Numerical Analysis II
Course Code Math3152
ECTS 5
Course category Elective
Module Coordinator
Instructor’s information Name:____________________________
Office No._________________________
Phone No:_________________________
email :____________________________
Consultation hours:__________________
Study work load Lecture Tutorial Lab Assessment Home study Total hour
work
48 32 0 8 47 135

Lecture time Days Hours Room

Tutorial time Days Hours Room

Target Group 3rd year Mathematics Students

Semester II
Pre-requisites Math2061
Course Objectives

On completion of the course, successful students will be able to:

- use numerical methods for approximating functions,
- derive numerical methods for solving initial and boundary value
problems,
- investigate the stability and convergence properties of numerical methods,
- identify the numerical methods that preserve the quantitative behavior of solution,
- solve eigenvalue problems,
- translate complex algorithms into computer programming format
Course Contents
Chapter 1: Revision of numerical integration
1.2 Interpolation
1.2 Trapezoidal and Simpson’s rules, Gaussian quadrature
1.3 Multiple integration
Chapter 2: Approximation theory
2.3 Least-square approximation
2.4 Approximation of functions by orthogonal polynomials (such as
Chebyshev, Legendre and Fourier series)
Chapter 3: Numerical methods for ordinary differential equations
3.3 The initial value problem
3.3.1 Taylor’s method of order n
3.3.2 Euler’s methods
3.3.3 Runge-Kutta methods
3.3.4 Multistep methods
3.3.5 Higher-order equations and system

91
 3.4 Boundary value problems
3.4.1 The Linear shooting method
3.4.2 The Shooting method for non linear problems
3.4.3 Finite Difference method for linear problems
3.4.4 Finite-Difference method for non linear problems
Chapter 4: Eigenvalue problems
4.1. Basic properties of eigen values and eigen vectors
4.2. The power method for finding dominant eigen values
4.3. Householder’s method and the QL algorithm
Teaching & learning Methods Questioning and answering, Lecture, Pair discussion, Class
Work, Gapped Lecture, Demonstrations
Assessment 1. Quiz (1) ……………………………………….5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements

Textbook:
- Gerald C. F. and Wheatlly P. O., Applied numerical analysis 5th ed, Edsion Wesley,Co
References:
- P.A. Strock, Richard L. Burden, Numerical Analysis- 2nd Ed 1981.
- Volkov, Numerical methods 1986
- Frank Ayres, Theory and Differential Equations Schuam’soutline series,
1981
- Robert Ellis and Denny Glick, Calculus with Analytical Geometry, 3rd Ed.
- Murry R. Advanced Calculus, Spiegel Advanced Calculus for Engineering and Scientists- Murry R.
Spiegel

University _____________________
College/Faculty _____________________
Department/Program Mathematics
Module Name Advanced Computational Mathematics I
Module No 15
Module Code Math-M3152
Course Title Non linear optimization
Course Code Math3153
ECTS 5
Course category Elective
Module Coordinator
Instructor’s information Name:____________________________
Office No._________________________
Phone No:_________________________
email :____________________________
Consultation hours:__________________
Study work load Lecture Tutorial Lab Assessment Home study Total hour
work

92
 48 32 0 8 47 135

Lecture time Days Hours Room

Tutorial time Days Hours Room

Target Group 3rd year mathematics students

Semester II
Pre-requisites Math2062
Course Objectives
On completion of the course, successful students will be able to:
- define convex sets and convex functions,
- determine continuity and differentiability of convex functions,
- understand the fundamental principles of nonlinear programming,
- formulate a problem statement as a mathematical model,
- test necessary and sufficient optimality conditions,
- understand Kuhn-Tucker conditions,
- solve nonlinear programming problems,
- apply penalty method,
- apply Lagrange method,
- apply iterative methods for solving convex optimization problems,
- solve discrete optimization problems,
- understand the scope and limitation of modeling practical problems as nonlinear programs,
- apply graph theory to solve network oriented problems.
Course content

Chapter 1: Basic notions of convex analysis (7 hrs)

1.1 Affine and convex sets
1.2 Convex functions
1.3 Continuity and differential property of convex functions
Chapter 2: Non linear optimization (17 hrs)
2.1 Convex optimization problems
2.2 Necessary and sufficient optimality conditions
2.3 Penalty methods
2.4 Lagrange-method and the Kuhn-Tucker conditions
2.5 Quadratic optimization problems
2.6 Separable optimization problems
2.7 Iterative methods for solving convex optimization problems

Chapter 3: Discrete optimization (12 hrs)

3.1 Dynamic optimization
3.2 The Knapsack problem
3.3 Branch-and-Bound method

Chapter 4: Graph theory and network optimization (12 hrs)

4.1 Basic notions of graph theory
4.2 Paths and circuits
4.3 Trees and forests
4.4 Directed graphs
4.5 Network flow
93
 4.6 Minimum and critical path problems
4.7 Maximal flow problems
Teaching & learning Methods Questioning and answering, Lecture, Pair discussion, Class
Work, Gapped Lecture, Demonstrations
Assessment 1. Quiz (1) ……………………………………….5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements 85%

Textbook:
 Bazaraa, Sherali and Shetty, Nonlinear programming, 3rd Edition, Wiley 2006
References:
 R. Deumlich, Lecture note for theory of optimization, Dept. of mathematic AAU
 P. Whittle, Optimization under constraints
 Bertsekas, Nonlinear programming, Athena Scientific, 1999
 Fletcher, Practical methods of optimization, Wiley 2000
 Rockafellar, Convex analysis, Princeton, 1970
 Mangasarian, Nonlinear programming, SIAM, 1994
 Boyd and Vandenberghe, Convex optimization, Cambridge, 2004
 algorithms, Duxbury Press, Belmont, 1994
 Eric V. Denardo, The science of decision making: a problembased approach using Excel, John Wiley
& Sons, Inc., 2002

University _____________________
College/Faculty _____________________
Department/Program Mathematics
Module Name Advanced Computational Mathematics I
Module No 15
Module Code Math-M3154
Course Title Operation research
Course Code Math3151
ECTS 5
Course category Elective
Module Coordinator
Instructor’s information Name:____________________________
Office No._________________________
Phone No:_________________________
email :____________________________
Consultation hours:__________________
Study work load Lecture Tutorial Lab work Assessment Home study Total hour

48 32 0 8 47 135
94
Lecture time Days Hours Room

Tutorial time Days Hours Room

Target Group 3rd year mathematics students

Semester II
Pre-requisites Math2062
Course Objectives

On completion of the course, successful students will be able to:

- identify the problems that can be solved using quantitative methods,

explain steps in quantitative analysis,
- formulate a decision making problem,
- develop the use of probability in decision making,
- apply the method of depicting a series of decisions and outcomes of decisions,
- measure forecast accuracy,
- apply time-series forecasting models,
- formulate different types of inventory models,
- formulate different types of queuing models,
- relate queuing problems to simulation,
- apply inventory models to material requirement planning,
- formulate problems that can be solved using integer programming
- check feasibility of solutions of an integer programming problem.
Course Contents

Chapter 1: Integer programming (5 hrs)

1.1 Introduction
1.2 Problem formulation
1.3 Optimal feasible solution
Chapter 2 : Deterministic dynamic programming (7 hrs)
2.1 Bellman principle
2.2 Forward and backward recursion
2.3 Dynamic programming for Knapsack problem
Chapter 3 : Inventory models (6 hrs)
3.1 Elements of inventory analysis
3.2 Inventory control systems
Chapter 4: Forecasting (6 hrs)
4.1 Introduction
4.2 Types of forecast
4.3 Scatter diagram
4.3 Measures of forecasting accuracy
Chapter 5: Decision theory (6 hrs)
5.1 Decision making without probabilities
5.2 Decision making with probabilities
5.3 Utility in decision making
5.4 Solving problems using computer software
Chapter 6: Queuing systems (10 hrs)
6.1 Single server model
6.2 Multi-server models
95
 6.3 Machine repair models
6.4 Queues in series
6.5 Queues in Priorities
6.6 Queuing simulation
6.6.1 Types of simulation
6.6.2 Elements of discrete event simulation
6.6.3 Manual simulation of a single server model
Chapter 7: Simulation modeling (8 hrs)
7.1 Random variable
7.2 Monte Carlo simulation
7.3 Different types of simulation
7.4 Applications
Teaching & learning Methods Questioning and answering, Lecture, Pair discussion, Class
Work, Gapped Lecture, Demonstrations
Assessment 1. Quiz (1) ……………………………………….5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirements

Teaching materials
References:
 F. S. Hillier and G. J. Lieberman, Introduction to operations research, Holde-day, 2001
 H. A. Taha, Operations research, an introduction, Macmillan publishing company, 2002
 W. L. Winston, Operations research: Applications and algorithms, Duxbury Press, Belmont, 1994
 Eric V. Denardo, The science of decision making: a problembased approach using Excel, John Wiley
& Sons, Inc., 2002
 Walter C. Giffin, Queuing Theory and applications, Grid Inc, 1978
Rechard J. Terssine (1994) Principles of inventory and materials management, 4th edn. Prientice-Hall
1994

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Advanced Discrete Mathematics
Module No. 14
Module code Math-M3142
Course Title Introduction to Cryptography
Course Code Math3142
Course EtCTS 5
Instructor’s Name:____________________________
Information Office No._________________________
Phone No:_________________________
email :____________________________
96
 Consultation hours:__________________
Module Coordinators
Study workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
48 32 0 8 47 135
Lecture Time Day Hr Room

Tutorial Time Day Hr Room

Target Group 3rd Year Mathematics Students

Semester
Pre-requisites Math3091
Status of the Course Elective
Course Description
This course covers cipher system, methods and types of attack, information theory, stream ciphers, block
ciphers, public key ciphers, authentication, identification, and digital signatures.
Course objectives
On completion of the course, successful students will be able to:
- have an overview of some of the classical cryptosystems,
- understand the basic mathematics behind private-key and public-key
cryptography,
- describe several well known techniques for cryptography, security and
authentication,
- understand secure hashes,
- understand digital signatures,
- understand the method of encryption and decryption of ciphers,
- understand how to use private and public keys,
- know how to construct or extend a key,
- understand the algorithms that arise in the study of cryptology and error
control codes,
- know the algebraic method involved in decoding or correcting
Contents
Chapter 1: Introduction to modern cryptography (5hrs)
1.1 Encryption: Historical glance
1.2 Modern encryption
1.3 Security definition
1.4 The model of adversary
1.5 Road map to encryption
1.6 Mathematical background (Introduction to finite field theory)
Chapter 2: One-way and trapdoor functions (3hrs)
2.1 One way functions: Motivation and definition
2.2 Hard-core predicate of a one way function
2.3 One-way and trapdoor predicates
Chapter 3: Block ciphers (6hrs)
3.1 Definition of a block cipher
3.2 Data encryption standard (DES): Brief history, construction and speed
3.3 Key recovery attacks on block ciphers
3.4 Iterated-DES and DESX
3.5 Advanced encryption standard (AES)
3.6 Limitations of key-recovery based security
Chapter 4: Pseudo-random functions (7hrs)
97
4.1 Function families
4.2 Random functions and permutations
4.3 Pseudorandom functions and permutations
4.4 Modeling block ciphers
4.5 Example attacks, security key recovery, the birth day attack
4.6 The PRP/PRF switching lemma
4.7 Some applications of PRFs
Chapter 5: Private-key encryption (6hrs)
5.1 Symmetric encryption schemes
5.2 Some symmetric encryption schemes, stream ciphers
5.3 Issues in privacy
5.4 Indistinguishabilty under chosen-plaintext attack
5.5 Examples chosen-plaintext attacks
5.6 IND-CPA implies PR-CPA
5.7 Security of CTR modes
5.8 Security of CBC with random IV
5.9 Indistinguishability under chosen-ciphertext attack
5.10 Examples of chosen-chipertext attacks
5.11 Other methods for symmetric encryption
Chapter 6: Public-key encryption (3 hrs)
6.1 Definition of public-key encryption
6.2 Simple examples of PKC: The trapdoor function model
6.3 Defining security
6.4 Probabilistic public key encryption
6.5 Exploring active adversaries
Chapter 7: Hash functions (6hrs)
7.1 The hash function SHA1
7.2 Collision-resistant hash functions
7.3 Collision-finding attacks
7.4 One-wayness of collision-resistant hash functions
7.5 The MD transfer
7.6 Collision-resistance under hidden-key attack
Chapter 8: Message authentication (5hrs)
8.1 Definition of security for MACs
8.2 Construction from pseudorandom functions
8.3 The CBC MACs (The basic CBC MAC, birthday attack on the CBC MAC)
8.4 MACing with cryptographic hash functions
8.5 Combining encryption and authentication
Chapter 9: Digital signatures (7hrs)
9.1 The ingredients of digital signature
9.2 Digital signatures: the trapdoor model
9.3 Attack against digital signatures
9.4 The RSA digital signature shemes
9.5 ElGamal’s sheme, Rabin’s sheme
9.6 Probabilistic signatures
9.7 Concrete security and practical RSA based signatures
Assessment 1. Quiz (1) …………………………………...5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
98
 Total…………………………………………...100%
Attendance Requirement
Text Book
1. Van Alferd J. Menezes, Paul C Oorschot and Scott S. Vanstone Handbook of applied cryptography
CRC Press, 1996
2. Neal Koblitz, A course in number theory and cryptography, 2nd ed; Springer, 1994
3. J. A. Buchmann, Introduction to cryptography, Springer-Verlag, 2000
4. Alferd J. Menezes, Paul C. Van Oorschot and Scott S. Vanstone, Introduction to modern
cryptography, 2008

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Advanced Discrete Mathematics
Module No. 14
Module code Math-M3142
Course Title Computational Number Theory
Course Code Math3142
Course EtCTS 5
Instructor’s Name:____________________________
Information Office No._________________________
Phone No:_________________________
email :____________________________
Consultation hours:__________________
Module Coordinators
Study workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
48 32 0 8 47 135
Lecture Time Day Hr Room

Tutorial Time Day Hr Room

Target Group 3rd Year Mathematics Students

Semester
Pre-requisites Math3091
Status of the Course Elective
Course Description
This course covers quick review of number theory, primality test, primality proofs, and factorization.

Course Description
This course covers the characteristic equation of a matrix, orthogonality, matrix factorizations, canonical
forms, direct sum decomposition of vector spaces, bilinear, quadratic and positive definite forms.

99
Course objectives
On completion of the course, successful students will be able to:
- - understand the variety of methods for testing/proving primality,
- understand the factorization of composite integers,
- understand the theory of binary quadratic forms, elliptic curves and
quadratic number fields sufficient to understand the principles
behind state-of-the art factorization methods,
- analyze the complexity of some fundamental number-theoretic
algorithms,
- conduct primality test,
- analyze the primality proofs,
- understand factorization methods.
Contents
Chapter 1: Number theory background (14hrs)
1.1 Complexity analysis
1.2 Revision of Euclid’s algorithm
1.3 Continued fractions
1.4 The prime number theory
1.5 Smooth numbers
1.6 Elliptic curves over a finite field
1.7 Square roots modul a prime
1.8 Quadratic number fields
1.9 Binary quadratic forms and fast polynomial evaluation
Chapter 2: Primality test (14hrs)
2.1 Femat Test
2.2 Miller-Rabin test
2.3 CarMichael numbers
2.4 Euler test
2.5 Euler-Jacobi test
2.6 Lucas test
2.7 Mersenne numbers
2.8 Prime number generation (random search, strong primes)
Chapter 3: Primality proofs (4hrs)
3.1 Succint certificates
3.2 Elliptic curve method
Chapter 4: Factorization (16hrs)
4.1 Trial division
4.2 Parallization
4.3 Fermat’s method and extensions
4.4 Methods using binary quadratic forms
4.5 Pollard’s p-1 method
4.6 Pollard’s rho and roo method
4.7 Factor-base methods
4.8 Quadratic sieve
4.9 Number field sieve
Assessment 1. Quiz (1) …………………………………...5%
2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%

100
 Total…………………………………………...100%
Attendance Requirement

Textbook
- David M. Bressoud and Stan Wagon, A course in computational number theory, Springer-Verlag, 2000
References
1. R. Crandall, Prime Numbers: A computational perspective, Springer, 2001.
2. Neal Koblitz, A course in number theory and Cryptography, Spronger-Verlag, 2nd ED 1994.

University __________________________________
College /faculty_____________________________
Department/program Mathematics
Module Name Advanced Discrete Mathematics
Module No. 14
Module code Math-M3142
Course Title Graph Theory
Course Code Math3143
Course EtCTS 5
Instructor’s Office No. ----------------
Information Name---------------------------------------------; Mobile No.----------
E-mail:----------------
Consultation hours:--------
Qualification:-------------
Module Coordinators
Study workload Lecture Tutorial Lab Assessment Home Total study
(in hours) Work study
48 32 0 8 47 135
Lecture Time Days Hours Room

Tutorial Time Days Hours Room

Target Group
Semester
Pre-requisites Math2041
Status of the Course Elective
Course Description
This course covers graphs and their matrix representation, paths and circuits, trees and forests, planar graphs,
graph coloring, digraph, networks, and flows.
Course objectives
On completion of the course, successful students will be able to:
- understand the basic concepts of graphs and their types,
- formulate problems in terms of graphs,
- represent graphs and digraphs by matrices,
- understand the concepts of paths and circuits,
- identify Eulerian and Hamiltonian graphs,
101
 - comprehend the Greedy algorithm,
- find the minimal spanning tree,
- distinguish planar graphs,
- find chromatic numbers,
- apply graph coloring in scheduling and shortage problems.
Contents
Chapter 1: Introduction (8hrs)
1.1. Basic definitions and examples
1.2 Degree of a vertex
1.3 The incidence and adjacency matrices
1.4 Isomorphism of graphs
1.5 Subgraphs

Chapter 2: Paths and circuits (8hrs)

2.1 Walks, paths and circuits
2.2 Connectedness
2.3 Eulerian graphs
2.4 Hamiltonian circuits
2.5 Weighted graphs
2.6 Applications

Chapter 3: Trees and forests (8hrs)

3.1 Characterization of trees
3.2 Distances and centers
3.3 Cut-edges and cut-vertices
3.4 Spanning trees
3.5 Rooted and binary trees
3.6 Applications

Chapter 4: Planar graphs (10hrs)

4.1 Plane and planar graphs
4.2 Plane duality
4.3 Kuratowiski’s theorem
4.4 Thickness and crossing numbers
4.5 Applications

Chapter 5: Graph coloring (6hrs)

5.1 The chromatic number
5.2 Edge coloring
5.3 Vertex coloring
5.4 Coloring of maps
5.5 Chromatic polynomials
5.6 Applications

Chapter 6: Networks and flows (8hrs)

6.1 Directed graphs
6.2 Eulerian digraphs and tournaments
6.3 Minimal and critical path problems
6.4 Flows and cuts
6.5 The max-flow min-cut theorem
Assessment 1. Quiz (1) …………………………………...5%

102
 2. Assignment (1) ……………….……………..10%
3. Test (1&2)…………………………………….20%
5. Presentation ……………………………..........5%
6. Take home exam----------------------------------10%
7. Final Exam …………………………………...50%
Total…………………………………………...100%
Attendance Requirement
Textbooks: -
J. A. Bondy and U. S. R. Murthy, Graph Theory with Applications, Elsevier Science Publishing Co. Inc.
NewYork, 1976.
References
- F. Harary, Graph Theory, Addison-Wesely, 1969.
- R. Diestel, Graph Theory, Springer-Verlag New York, 2000.
- R. J. Wilson, Introduction to Graph theory, 3rd ed., Longmann Inc. New York, 1985.
- B. Harris, Graph Theory and its applications, Academic press, 1970
- Oystein Ore, Theory of graphs, American Mathematical Society, 1974

Course Code Enla1011

Course Title Communicative English Language I
Module Coordinator
Lecturer
The Credit in ECTS 5
Weekly Hour of course Lecture Tutorial Assessment Home Total
element study
3 0 1 4 8

Course Objectives & By the end of the course students will be able to
Competences Acquired  Express their ideas in various communicative contexts(in group
/pair discussion, in public speaking settings)
 Present oral reports
 Write short reports
 Read various materials and make their own notes
 Identify the structure of oral and written discourses
 Attend their academic work at easy and clarity
Course Contents/description
UNIT 1:
Listening: Learning Finding out about other people
Vocabulary : Learning to learn vocabulary
Grammar: learning to use grammar for facilitating meaning
Reading: What is involved in understanding text.
Speaking: Introducing oneself and others
Writing: Personal description
UNIT 2:
Listening: Understanding markers addition and relating Learning
Vocabulary :: using component parts of a word as clues to learning
Grammar: Using relative clauses
103
Reading: Identifying audience and purpose.
Speaking: Public speaking
Writing: Writing a short summary
UNIT 3:
Listening: Identifying the structure of a talk
Vocabulary :: using topic relationships to learn new words
Grammar: Using active and passive constructions for descriptive writing
Reading: critical reading
Speaking: Brainstorming
Writing: Writing a brief summary of key ideas from a text
UNIT 4:
Listening: Thinking about what you do when you listen to a lecture and take notes.
Vocabulary :Using dictionary
Grammar: Using conditional 1
Reading: Learning style etc.
Speaking: Brainstorming
Writing: Summarizing a talk
UNIT 5:
Listening: Noticing the structure of lectures, responding to lectures
Vocabulary : Working out meanings of core words related to theme 1 from context
Grammar: reporting clauses
Reading: interpreting tables and interviews
Speaking: discussions and interviews
Writing: Assessing problems and proposing solutions.
Pre-requisites None
Semester I/1
Status of Course General
Teaching & learning Methods Gapped lecture, brain storming, Group or pair work, Presentation
Attendance Requirements 85%
Literature John S.(2000).The Oxford Guide to writing and speaking. Oxform: Oup
Oshima,A. and Hogue,
A.(!991). College Writing Skilla:McGraw Hill Rudolph,F and
Lass,A.H.(1996).
The Classic Guide to Better writng .New York Solomon G/giorgis.(1991).
Writing for Academic purpose .,AAU Printing press Axeilod B.and cooper
R.(2001).The St. Martin’s Guide to Writing 6th ed.
Boston:Bedford/St.Martin’s

104
Course Code Enla1012
Course Title Basic Writing English Skill II
Degree Program B.Sc. in Mathematics
Module Coordinator
Lecturer
The Credit in ECTS 5
Weekly Hour of course Lecture Tutorial Assessment Home study Total
element
3 0 1 4 8
Course Objectives & Competences Acquired
Upon completing the course, students will be :
 Construct meaningful sentences in English
 Use appropriate coordination and subordination skills to relate ideas
 Identify and correct faulty sentences
 Identify and correct agreement problems
 Punctuate sentences correctly
 Compose a paragraph that has clearly stated topic sentences and supporting details
 Write a well structured essay of different type
Course Contents/description
UNIT 1: Writing effective sentences (12hrs)
1.1 Sentence type (simple ,compound, complex and compound complex)
1.2 Sentence kinds (declarative, interrogative, imperatives and exclamatory)
1.3 Faulty sentences
1.3.1 Fragments
1.3.2 Run- ons

105
 1.3.3 Comma splices
1.3.4 Dangling modifiers
1.3.5 Miss placed modifiers
1.3.6 Agreement errors
1.4 diction
1.5 sentence variety
1.6 punctuation and capitalization
UNIT 2: Writing effective paragraphs (20hrs)
2.1 Structure of a paragraph
2.2 Characteristics of a good paragraph
2.1.1. Unity
2.1.2. Cohesion
 Transition words
 Synonyms
 Pronounce
2.1.3.Coherence
 Chronological
 Spatial
 Emphatic
2.1.4.Complitness
2.5 Basic Types of paragraph
2.3.1. Expository
2.3.2. Narrative
2.3.3. Descriptive
2.3.4. Argumentative
2.6 Technique of paragraph development
2.4.1. Definition
2.4.2. Exemplification
2.4.3. Classification
2.4.4. Cause and Effect
2.4.5. Compare and contrast
2.4.6. Process
2.4.7. Narration
2.4.8. Description
UNIT 3: Essay Writing(16hrs)
3.1. What is an Essay?
3.2 Structure of an essay
3.3 Types of an essay
3.3.1. Expository
3.3.2. Narrative
3.3.3. Descriptive
3.3.4. Argumentative
Pre-requisites
Semester II/1
Status of Course Supportive
Teaching & learning Gapped lecture, brain storming, Group or pair work, Presentation
Methods
Attendance Requirements 85%
Literature John S.(2000).The Oxford Guide to writing and speaking. Oxform: Oup
Oshima,A. and Hogue, A.(!991). College Writing Skilla:McGraw Hill Rudolph,F
and Lass,A.H.(1996).The Classic Guide to Better writng .New York Solomon
106
 G/giorgis.
(1991).Writing for Academic purpose .,AAU Printing press Axeilod B.and
cooper ,R.(2001).The St. Martin’s Guide to Writing 6th ed.
Boston:Bedford/St.Martin’s

Course Code Comp1041

Course Title Introduction to computer Sciences
Degree Program B.Sc. in Mathematics
Module Coordinator
Lecturer
The Credit in ECTS 7
Weekly Hour of course Lecture Laboratory Assessment Home Total
element study
4 2 1 4 12

Course Objectives & Competences Acquired

This course introduces the students with fundamentals of Computer Science by furnishing them with a broad
oversight of the discipline of formal computer science.
At the end of the course students should be able to:
- explain what Computer Science is, its characteristics and applications
- explain the historical development, generations and types of computers
- get familiar with the computer system, data representation techniques, and computer arithmetic
- get familiar with the different coding methods
- explain Boolean logic, logic elements, etc.
- define computer networks and types
- get familiar with the Internet and its services
Course Contents/description
Chapter 1: Overview of Computer Science (5 hours)
1.1 Introduction to Information and Communication Technology (1/2 hour)

107
 1.2 Definition of Computer and Computer Science (1/2 hour)
1.3 Characteristics of computers (1 hour)
- Speed, accuracy, capacity, versatility, durability and reliability
1.4 Types of computers (1 hour)
- Analog, digital, special purpose, general purpose
- Super computers, mainframe computers, minicomputers, microcomputers (desktop, laptop or
notebook, PDA or palmtop, handheld)
1.5 Applications of computers (2 hours)
- Learning aid
- Entertainment
- Commercial and business applications
- Information utility
- Engineering and research applications
- Public service
Chapter 2: Development of computers (3 hours)
2.1 History of computing (1 hour)
- Abacus
- Pascal’s Calculator
- The difference engine and the analytical engine
- Herman Hollerith’s tabulating machine
- Mark I
- ENIAC - Electronic Numerical Integrator And Computer
- The Von Neumann Machine
- Commercial computers
2.2 Generations of computers (2 hours)
- First, second, third, and fourth generations
- Current Trends
Chapter 3: Organization of a computer system (8 hours)
3.1 Introduction to Computer Systems (1/2 hour)
3.2 Computer hardware (3 hours)
- The Central Processing Unit (CPU)
- Purposes of the Central Processing Unit
- Control Unit
- Arithmetic and Logic Unit (ALU)
- RAM and ROM

108
 - The bus system (address bus, data bus, and control bus)
- Input/Output units
- Input units (pointing devices, game controllers, keyboard, scanner, camera, microphone)
- Output units (monitor, printer, speaker)
- Storage units
- Sequential access media ( tape)
- Random access media (magnetic disk, optical storage media, flash memory cards)
3.3 Computer software
- System software (3 hours)
- Operating systems
- What is an operating system?
- Functions of an operating system (controlling operations, input/output
management, command processing)
- Types of operating systems (single/multi tasking, single/multi user,
real-time, command driven vs GUI-based)
- Example operating systems (Windows, UNIX, Solaris, MacOS)
- Language software
- Translators (assemblers, compilers, interpreters), and editors
- Applications software (1 1/2 hours)
- Word processing
- Spreadsheet
- Database management systems
- Graphics
- Software suites
- Enterprise application software
Chapter 4: Data representation in computers (12 hours)
4.1 Units of data representation (1 1/2 hours)
- Bit, Byte, Word
4.2 Concept of number systems and binary arithmetic (4 hours)
- Binary, Octal, and Hexadecimal number systems
- Conversion from one number system to another
- Binary arithmetic
4.3 Coding method (2 1/2 hours)
- EBCDIC (Extended Binary Coded Decimal Interchange Code)
- BCD 4 and 6 (Binary Coded Decimal)
- ASCII 7 and 8 (American Standard Code for Information Interchange)
- UNICODE
4.4 Representation of negative numbers and arithmetic (3 hours)
- Signed magnitude, One’s complement, Two’s complement
109
 4.5 Floating-point representation (1 hour)
Chapter 5: Computer System architecture (12 hours)
5.1 Hierarchical structure of computer system architecture (1 hour)
5.2 Logic elements and Boolean algebra (3 hours)
- Logic gates and Boolean algebra
5.3 Implementation of Boolean algebra (3 hours)
- Boolean functions and truth tables
- Construction of logic circuits
5.4 Types of circuits (2 hours)
- Combinational and sequential circuits
Chapter 6: Computer networks and communications (4 hours)
6.1 Introduction to computer networking and its applications (2 hours)
6.2 Types of networks
- LANs (Local Area Networks) and WANs (Wide Area Networks)
6.3 Introduction to tthe Internet (2 hours)
-Services of tthe Internet (e-mail, World Wide Web, file transfer/access, remote login/
execution, video conferencing)
Chapter 7: Computer security (1 hour)
- Introduction to computer security
- Encryption
- Backup
- Viruses and worms
Pre-requisites None
Semester I/1
Status of Course Supportive
Teaching & learning
Lectures, tutorials, discussions, demonstration and assignments.
Methods
Attendance 85%
Requirements
Literature Textbook:
Introduction to Computer Science, ITL Education Solutions Ltd, Pearson
Education, 2004
References :
Dida Midekso , Introduction to Computer Science , Ethiopia, AAU, 1994
Computer Science: An Overview: International Edition, (10th ed.), Pearson
Higher Education, 2007.

110
Course Code Comp1042
Course Title Fundamentals of programming
Degree Program B.Sc. in Mathematics
Module Coordinator
Lecturer
The Credit in ECTS 7
Weekly Hour of course Lecture Laboratory Assessment Home study Total
element
4 2 1 5 12

Course Objectives &

On completion of this course students should be able to:
Competences Acquired
-describe the problem solving process as applied in programming
-describe the basics of C++ programming – syntax and semantic
elements of the programming
-describe and exercise the Arithmetic and Logic operations
implemented in C++
-implement the program flow control in software
-describe and implement the basic data structure elements in C++ that
serve as holding homogenous data primitives
Course Contents/description
Chapter 1: Introduction to Programming (12 hrs)
1.1 General Introduction to computer and programming
1.2 Software Development Life Cycle (SDLC)
1.3 Feasibility study

111
 1.4 Requirement Analysis
1.5 Designing Solution
1.6 Testing Designed Solution
1.7 Implementation(Coding)
1.8 Unit Testing
1.9 Integration and System Testing
1.10 Maintenance
1.11 Algorithm development and representation
1.11.1 Structured Chart
1.11.2 Pseudocode
1.11.3 Flow chart
Chapter 2: C++ Basics (4 hrs)
2.1 Structure of C++ Program
2.2 C++ IDE
2.3 Showing Sample program
2.4 Keywords, Identifiers, Inputs, Outputs, Comments, Parts of a program
2.5 Data Types, Variables, and Constants
2.6 Operators
2.6.1 Assignment Operators
2.6.2 Compound Assignment Operators
2.6.3 Arithmetic Operators
2.6.4 Relational Operators
2.6.5 Increment and Decrement Operators
2.6.6 Infix and postfix types
2.7 Precedence of Operators
Chapter 3: Control Statements (16 hrs)
3.1 If statements: If…else, nested if
3.2 Switch Statements: Multiple cases, break, Default
3.3 Looping: for, while, do, break, continue
3.4 Nested Loops
Chapter 4: Arrays and String Manipulation (12 hrs)
4.1 Array Definition
4.2 Array referencing
4.3 One dimensional and multidimensional arrays
4.4 Strings: Definition, accessing Strings
Chapter 5: Pointers (4 hrs)
5.1 Definition of Pointers
5.2 Pointer and address of operator
Pre-requisites None
Semester I/1
Status of Course Supportive
Teaching & learning
Methods
112
Attendance Requirements 85%
Literature References
Walter Savitch, “Problem solving with C++ – The Object of
Programming”, Menlo Park: Addison-Wesley, 1996
John R. Hubrard, “Fundamentals of Computing with C++”, Shuam’s Outline,
1997
Jess Liberty, “An Introduction to C++”, 1995
Robert Lafore, “The Wait Group Object Oriented Programming With C++”,

Course Code Comp2061

Course Title Fundamentals of Data base System
Degree Program B.Sc. in Mathematics
Module Coordinator
Lecturer
ECTS 7
Weekly Hour of course Lecture Laboratory Assessment Home study Total
element
4 2 1 4 12

Course Objectives &

At the end of the Course students should be able to:
Competences Acquired
- understand what a Database System is, and be able to identify its
characteristics and applications,
- explain the Different models of database,
- design ER models from specifications and interpret them into
relational
tables,
- write SQL statements for data creation and manipulation purposes,
- know how to optimize databases to the most efficient form,
- distinguish and use relational model and relational algebra,
- identify and fix the possible problems that may occur in securing data,
Course Contents/description
Chapter 1: Introduction (4 hours)
1.1 Overview

113
 1.2 Basics of Database
1.3 File organization verses Database approach
1.4 Users and actors of Database system
Chapter 2: Database System Architecture (5 hours)
2.1 Data models, Schemas, and Instances
2.2 Over view of data models
2.3 Architecture and Data Independence
Chapter 3: The ER Model (10 hours)
3.1 The high-level conceptual model
3.2 Entities, Attributes, and Keys
3.3 Relationships, Associations, and Constraints
3.4 The ER Diagrams
3.5 Mapping ER-models to relational tables
Chapter 4: Functional Dependency and Normalization (6 hours)
4.1 Functional Dependency
4.2 Normal Forms
Chapter 5: The SQL Language (9 hours)
5.1 Data Definition Language
5.2 Data Manipulation Language
5.3 Basic Queries in SQL
5.4 Views
Chapter 6: The Relational Data Model and the Relational Algebra (7 hours)
6.1 The Relational Model Concepts
6.2 The Relational Constraints and Relational Database Schemas
6.3 The Relational Operations
Chapter 7: Data Protection (4 hours)
7.1 Data recovery
7.2 Concurrency
7.3 Data Security
Pre-requisites
Semester I/2
Status of Course Supportive
Teaching & learning
Methods
Attendance Requirements 85%
Literature
Textbook:
Ramez Elmasri, Shamkant B. Navathe, Fundamentals of Database Systems,
Addison-Wesley, 2000
References
- Abraham Silberschatz, Henry F. Korth, S. Sudarshan, Database SystemConcepts,
4th Ed., McGraw Hill, 2002
- Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom, Database Systems:
The Complete Book, Prentice Hall, 2002
- Introduction to Database systems, C.J.DATE

114
Course Code Phy2051
Course Title Mechanics and Heat
Degree Program B.Sc. in Mathematics
Module Coordinator
Lecturer
The Credit in ECTS 7
Weekly hour of course Lecture Laboratory Assessment Home study Total
element
4 2 1 4 12
Course Objectives & Competences Acquired
Upon Completion of this course students should be able to:
- compute average and instantaneous values of velocity, speed and acceleration
- derive the Kinematic equations for uniformly accelerated one-dimensional motion
- solve problems involving bodies moving in one-dimensional and two-dimensional using the concepts in
calculus and trigonometry
- explain some implementations of Newton’s laws of motion
- derive the work-energy theorem
- solve mechanics problem using impulse, momentum and the conservation of linear momentum
- apply the law of conservation of linear momentum of collisions
- repeat the procedure followed in rectilinear motion for rotational motion
- explain basic laws of heat and thermodynamics,

115
Course Contents/description
1. Vectors (2 hrs)
1.1 Vector Algebra
1.2 Geometrical and algebraic representation of vectors
1.3 Vector addition
1.4 Vector multiplication
2. One and two dimensional motions ( 5 hours)
2.1 Average and instantaneous velocities
2.2 Average and instantaneous accelerations
2.3 Motion with constant acceleration
2.4 Projectile motion
2.5 Uniform circular motion
3. Particle dynamics ( 6 Hours)
3.1 Newton’s law of motion
3.2 Friction force
3.3 Applications of Newton’s laws
3.4 Velocity dependent forces
4. Work and Energy (7 hrs)
4.1 Work done by constant and variable forces
4.2 The work energy theorem
4.3 Conservative and non-conservative forces, conservative force and potential forces
4.4 Conservation of mechanical energy
4.5 Power
5. Dynamics of system of particles (8 hrs)
5.1 Linear momentum and impulse
5.2 Conservation of momentum
5.3 Systems of particles
5.4 Center of mass
5.5 Center of mass of a rigid body
5.6 Motion of system of particles
5.7 Elastic and inelastic collision(1 & 2-D)
5.8 Elastic collisions in one dimension
5.9 Two-dimensional elastic collisions
5.10 Inelastic collisions
5.11 Systems of variable mass
6. Rotation of rigid bodies (7 hrs)
6.1 Rotational motion with constant and variable angular accelerations
6.2 Rotational kinetic energy
6.3 Momentum of inertia
6.4 Rotational dynamics
6.5 Torque and angular momentum
6.6 Work and power in rotational motion
6.7 Conservation of angular momentum
6.8 Relation between linear and angular motions
7. Simple harmonic motion (4hrs)
7.1 Energy in simple harmonic motion
7.2 Equations of simple harmonic motion
7.3 Pendulum
7.4 Damped and simple oscillations
7.5 Resonance
8. Temperature and thermometry (2 hrs)
8.1 Temperature scale
116
 8.2 Thermometry, the fixed points
8.3 Thermocouple
9. Heat and energy (4 hrs)
9.1 Heat energy
9.2 Heat capacity and specific heat capacity
9.3 Specific latent heat
9.4 Heat loses
10. Gas laws and basic laws of thermodynamics (6 hrs)
10.1 The gas laws
10.2 Internal energy
10.3 The first law of thermodynamics
10.4 Isothermal and adiabatic changes
10.5 Work done by gas
11. Kinetic theory of gases (6 hrs)
11.1 Ideal gas
11.2 Temperature and kinetic theory
11.3 Boltzmann’s constant
11.4 Graham’s law of diffusion
11.5 Maxwell’s distribution of molecular speeds
12. The second law of thermodynamics(4 hrs)
12.1 Heat energies and thermodynamic efficiency
12.2 The Carnot cycle
12.3 The second law of thermodynamics
12.4 The Kelvin temperature scale
12.5 Entropy
Pre-requisites None
Semester II/1
Status of Course Supportive
Teaching & learning Presentation of the course is through lecture, a related guided problems section with
Methods demonstrator assistance and additional assessed course work. Online learning resources
Assessment/Evaluation  Continuous Assessment 50%
 Final examination 50%
Attendance Requirements 85%
Textbook: Raymond A. Serway, Physics: For Scientists & Engineers, 6th ed., Thomson Bruke, 2004
References:
 Hugh D. Young and Roger A. Freedmann, University physics with modern physiscs, 12th ed. 2008
 Douglas C. Giancoli, Physics for scientists and engineer, Prentice Hall 4th ed., 2005
 Robert Resnick and David Halliday, Fundamentals of physics extended, HRW 8th ed. 2008
 Paul M. Fishbane, Stephene Gasiorowicz, Stephen T. Thoronton, Physics for scientists and engineers, 3rd ed.,
2005

117
Course Code Ensc1031
Course Title Environmental Science
Degree Program B.Sc. in Mathematics
Module Coordinator
Lecturer
The Credit in ECTS 5
Weekly CP of course Lecture Tutorial Assessment Home study Total
element
6 0 2 8 16

Course Objectives & Competences Acquired

After successful completion of the course students will have an understanding of the interactions between
humans and the global environment; develop skills and insight into critical thinking and situational awareness
of their surrounding environment; gain an understanding of the physical processes that operate in and on earth,
will be aware of environmental issues of international or global scale.
Course Contents/description
1. Introduction [4 hrs]
o Global environmental issues and challenges
o Population-resource-environment linkage
o Population size as global environmental challenge and opportunity
o Development-resources-sustainability

118
 o Earth materials, systems and cycles
2. Natural Hazards [10 hrs]
o Earthquakes and Earthquake hazards
 Internal structure and composition of the earth
 Origin and distribution of earthquakes, tsunamis
 Measurement of earthquakes, earthquake magnitude, Earthquake Intensity
 Effects of Earthquakes, Predicting earthquakes and earthquake risks
 The response to earthquake hazards, mitigation measures
 Earthquake hazard in Ethiopia
o Volcanism and Volcanic hazards
 Volcanoes, volcano types, volcano origins
 Forecasting volcanic activity
 Predicting volcanic hazards and mitigation measures
 Adjustment to and perception of volcanic hazards
 Volcanic hazards in Ethiopia
o Landslides and Landslide hazards
 Introduction to Landslides, slope processes and types of landslides, slope stability
 Landslide hazards
 Minimizing the landslide hazard, perception of the landslide hazard
 Landslide hazard in Ethiopia
o Hydro-climatic hazards
 Climatic hazards: El Nino, La Nina, cyclones, drought, climate change, hurricanes,
floods
 Hydro-climatic hazards vs geologic hazards global inventory
 Hydrologic hazards: flooding, magnitude and frequency, urbanization and
flooding
 Adjustments to flood hazards, perception of flooding, flooding hazards in Ethiopia
3. Global water resources [6 hrs]
o The hydrologic cycle, global water balance, global water supply and demand
o Global Water Scarcity
 Physical
 Technical water scarcity
o International waters and conflict on water resources
o Groundwater
 Occurrence and zones of groundwaters
 Groundwaters as resources
 Groundwater as environmental, social and economic good
o Concepts of integrated water resources management
o Oceans and the environment
o Ocean resources, ownership of oceans, international laws on oceans
o Oceans as sinks of global CO2
o Interaction between ocean waters and adjacent lands
4. Environmental pollution sources and processes [8 hrs]
Atmosphere of the Earth
 Composition of the Atmosphere
 Structure of the Atmosphere: troposphere, stratosphere, mesosphere, thermosphere
 The solar Energy balance of the Atmosphere: vertical and horizontal flows
Air pollution and sources
 Green house gases, green house effect, global warming
 The Ozone layer and its depletion
119
  Pollution of the lower Atmosphere
Water pollution and sources
 Landfills
 Nitrate pollution
 Lake Eutrophication
 Oil spills
 Acid Mine drainage
5. Mineral and energy resources and their link to the environment [6 hrs]
o Environmental impact of mineral exploitation
o Non petroleum energy sources
o Petroleum and natural gas
o Alternative energy resources
o Energy resources of the 21st century
6. Soils and environment [3 hrs]
o Soils as regulators of global climate changes
o Formation and types of soils
o Soil Erosion and degradation
o Deforestation and desertification
o Soil preservation approaches
o Soil pollution
7. Megacities and solid waste management [4 hrs]
o Type and classification of wastes
o Megacities and various development challenges
o Solid waste management in cities
o Waste management challenges in cities/towns of Ethiopia
8. Other Environmental challenges of international scale [5 hrs]
o Food and nutrition
o Biodiversity and species extinction
o International conflicts
o Foresight capability
Pre-requisites None
Semester I/2
Status of Course Supportive
Teaching & learning Presentation of the course is through lecture, a related guided problems section
Methods with demonstrator assistance and additional assessed course work. Online learning
resources..
Assessment/Evaluation & Continuous assessment 50%
Grading System Final Examination 50%
Attendance Requirements 85%
Literature Textbooks and Reference Materials
. Edward Keller, Introduction to Environmental Geology 4th edition.
. Montgomery, Carla W., 2008, Environmental Geology, [8th Ed.], McGraw Hill.

120
Course Code Stat3071
Course Title Introduction to Statistics
Degree Program B.Sc. in Mathematics
Module Coordinator
Lecturer
The Credit in ECTS 5
Weekly hour of course Lecture Tutorial Assessment Home study Total
element
6 0 2 8 16

Course Objectives & Competences Acquired

At the end of the course students are expected to:
 have a broad knowledge of the basic understanding of statistical techniques demonstrated through
principles of data collection, descriptive statistics, probability, probability and sampling distributions,
statistical inference and linear regression.
 understand the methods of data collection, organization, presentation, analysis and interpretation;
 know what is meant by sample space, event, relative frequency, probability, conditional probability,
independence, random variable, probability distribution, probability density function, expected value and

121
 variance;
 be familiar with some standard discrete and continuous probability distributions;
 be able to use standard statistical tables for the Normal t, chi-square distributions;
 be able to differentiate between common types of data, and display them appropriately;
 learn some desirable properties of point estimators;
 recognize the additional benefits of calculating interval estimates for unknown parameters;
 understand the framework of hypothesis testing for carrying out statistical inference;
 be able to produce and interpret interval estimates and tests of hypotheses correctly in some simple
cases;
 be able to present their results correctly and in non-technical language;
 have basic skills in exploratory data analysis..
Course Contents/description
1. Introduction (3 lecture hours)
1.1 Definition and classification of Statistics
1.2 Stages in statistical investigation
1.3 Definition of Some Basic terms
1.4 Applications, uses and limitations of Statistics
1.5 Types of variables and measurement scales
2. Methods of Data Collection and Presentation (4 lecture hours)
2.1 Methods of data collection
2.1.1 Sources of data
2.1.2 Methods of collection
2.2 Methods of Data Presentation
2.2.1 Motivating examples
2.2.2 Frequency Distributions: qualitative, quantitative: absolute, relative and Percentage.
2.2.3 Tabular presentation of data
2.2.4 Diagrammatic presentation of data: Bar charts, Pie-chart, Cartograms
2.2.5 Graphical presentation of data: Histogram, and Frequency Polygon
3. Measures of Central Tendency (5 lecture hours)
3.1 Motivating example
3.2 Objectives of measures of central tendency
3.3 Summation notation
3.4 Important Characteristics of a good average
3.5 Mean
3.4.1 Arithmetic Mean

122
 3.4.2 Geometric Mean
3.4.3 Harmonic Mean
3.6 Median
3.7 Mode
4. Measures of variation (Dispersion), Skewness and Kurtosis (5 lecture hours)
4.1 Motivating examples
4.2 Objectives of measures of central tendency
4.3 Measures of Dispersion (Variation)
4.3.1 Range
4.3.2 Variance, Standard Deviation and coefficient of variation
4.3.3 Standard scores
4.4 Moments
4.5 Skewness
4.6 Kurtosis
5. Elementary Probability (5 lecture hours)
5.1 Introduction
5.2 Definition & some concepts (Experiment, sample, event, equally likely outcomes, mutually
exclusive events, independent events)
5.3 Random experiments
5.4 Counting rules: addition, multiplication rules, permutation and combination
5.5 Definitions of probability (probability of an event)
5.6 Some rules of probability
6. Probability Distributions (7 lecture hours)
6.1 Definition of random variables (discrete and continuous) and probability distributions
6.2 Introduction to expectation: mean and variance of random variable
6.3 Common discrete distributions: binomial and Poisson
6.4 Common continuous distributions: Normal, t, and chi-square distribution
7. Sampling and Sampling Distributions of the Mean (3 lecture hours)
7.1 Basic concepts (population, sample, parameter, statistic, sampling frame,
Sampling unit, sampling error, sample size)
7.2 Reasons for Sampling
7.3 Different types of Sampling (Probability vs Non probability Sampling
Techniques)
7.4 Simple random sampling (lottery method, table or computer generated random numbers)
7.5 Sampling distribution of the sample mean and proportion

123
 7.6 Central limit theorem
8. Estimation and Hypothesis Testing (10 lecture hours)
8.1 Estimation
8.1.1 Motivating examples
8.1.2 Point estimation: mean and proportion
8.1.3 Interval estimation: mean and proportion
8.2 Hypothesis Testing
8.2.1 Motivating examples
8.2.2 Important concepts in testing a statistical hypothesis
8.2.3 Steps in testing a hypothesis
8.2.4 Hypothesis testing about the population mean
8.2.5 Hypothesis testing about the population proportion
8.2.6 Chi-square test of association
9. Simple Linear Regression and Correlation (6 lecture hours)
9.1 Motivating examples
9.1 Introduction: regression and correlation
9.2 Simple Linear Regression
9.3 Correlation Coefficient
Pre-requisites None
Semester I/2
Status of Course Supportive
Teaching & learning
Lectures, tutorials, discussions, demonstration and assignments.
Methods
Assessment/Evaluation &
Grading System
Attendance Requirements 85%
Literature
Textbook
Bluman, A.G. (1995). Elementary Statistics: A Step by Step Approach (2nd
edition). Wm. C. Brown Communications, Inc.
References
 Coolidge, F.L.(2006). Statistics: A Gentle Introduction (2nd edition).
 David, S.M., McCabe, P. and Craig, B. (2008). Introduction to the Practice of
Statistics (6th edition). W.H. Freeman.
 Eshetu Wencheko (2000). Introduction to Statistics. Addis Ababa University
Press.
 Freund, J.E and Simon, G.A. (1998). Modern Elementary Statistics (9th Edition).
 Gupta, C.P.(). Introduction to Statistical Methods (9th Revised Edition).
 Snedecor, G.W and Cochran, W.G. (1980). Statistical Methods (7th edition).
124
  Spiegel, M.R. and Stephens, L.J. (2007). Schaum's Outline of Statistics,
Schaum's Outline Series (4th edition). McGraw-Hill.
 Woodbury, G. (2001). Introduction to Statistics. Duxbury press.

Course Code Stat3072

Course Title Introduction to Probability
Degree Program B.Sc. in Mathematics
Module Coordinator Mr. x
Lecturer Mr. x
The Credit in ECTS 5
Weekly hour of course Lecture Tutorial Assessment Home study Total
element
6 0 2 8 16

Course Objectives &

At the end of the course students are expected to:
Competences Acquired
 have equipped with basic concept of probability and a good appreciation of
the laws of probability;
 know what is meant by random variable, probability distribution,

125
 cumulative distribution function, probability density function, expectation,
variance and correlation;
 have the skills to tackle simple problems on probability distributions;
 understand conditional probability and independence;
 know what is meant by joint, marginal and conditional distribution and
independent random variables;
 be familiar with one and two dimensional random variables and their
functions and deriving their probability distributions and computing their
expectation, variance and correlation;
 be familiar with standard discrete and continuous probability distributions,
how they arise in practice and their elementary properties.
Course Contents/description
1. Review (2 lecture hours)
1.1 Deterministic and non-deterministic models
1.2 Random experiments, sample space and events
1.3 Review of set theory: sets, union, intersection, complementation, De Morgan’s rules
1.4 Finite sample spaces
1.5 Equally likely outcomes
1.6 Counting techniques
1.7 Axioms of probability
1.1 Derived theorems of probability
2. Conditional Probability and Independence (3 lecture hours)
2.1. Conditional Probability
2.2 Multiplication rule
2.3 Partition Theorem, Bayes’ Theorem and Applications
Independent Events
3. One-dimensional Random Variables (3 lecture hours)
3.1 Random variable: definition and distribution function
3.2 Discrete random variables
3.3 Continuous random variables
7.1 Cumulative distribution function and its properties
4. Functions of Random Variables (6 lecture hours)
4.1 Equivalent events
4.2 Functions of discrete random variables and their distributions
4.3 Functions of continuous random variables and their distributions
5. Two-Dimensional Random Variables (8 lecture hours)
5.1 Two-dimensional random variables

126
 5.2 Joint distributions for discrete and continuous random variables
5.3 Marginal and conditional probability distributions
5.4 Independent random variables
5.5 Distributions of functions of two random variables
6. Expectation (5 lecture hours)
Expectation of random variable
Expectation of a function of a random variable
Properties of expectation
Variance of a random variable and its Properties
Chebyshev’s Inequality
Covariance and Correlation Coefficient
Conditional Expectation
7. Common Discrete Distributions and their Properties ( 10 lecture hours)
7.1 Binomial distribution
7.2 Poison distribution
7.3 Hypergeometric distribution
7.4 Geometric distribution
7.5 Multinomial distribution
8. Common Continuous Distributions and their Properties (11 lecture hours)
1.1 Uniform distribution
1.2 Normal distribution
1.3 Exponential distribution
1.4 Chi - square distribution
1.5 t distribution
1.6 F distribution
1.7 Bivariate normal distribution
Pre-requisites
Semester I/2
Status of Course Compulsory
Teaching & learning
Lectures, tutorials, discussions, demonstration and assignments.
Methods
Assessment/Evaluation & Continuous Assessment 50%
Grading System Final Examination 50%
Attendance Requirements 85%
Textbook Ross S. (2006). A First Course in Probability (7th Edition). Prentice-Hall, Upper Saddle Rivel, New
Jersey.
References

127
  Cheaffer, R.L. and McClave, J.T (1994). Probability and Statistics for Engineers (4 nd Edition).
Duxbury Press.
 Lipschutz, S. and Schiller, J. (1998). Introduction to Probability and Statistics. Schaum's Outline
Series, Mc Graw-Hill.
 Mendenhall, W., Beaver, R.J. and Bearer, B.M. (2008). Introduction to Probability and Statistics
(13th Edition). Duxbury Press.
 Mendenhall, W., Beaver, R.J. and Bearer, B.M. (2005). Student Solutions Manual for Introduction
to Probability and Statistics (12th Edition). Duxbury Press.
 Walpole, R. E., Myers, S.L. and Ye, K. (2006). Probability and Statistics for Engineers and
Scientists (6th Edition). Prentice Hall.
 Roussas, G. G. (2006). Introduction to Probability. Academic Press.
 Bertsekas, D. P. and Tsitsiklis, J. N. (2008). Introduction to Probability (2nd Edition). Athena
Scientific.

19. Quality Assurance

The Department of Mathematics will monitor and maintain the quality of the program according
to the quality assurance standards set by the university. To this effect, the department will:
 ensure that contents of the courses are covered.
 ensure that exams, tests, assignments and projects are properly set and conducted.
 ensure that appropriate technology is employed in the teaching-learning process.
 conduct short-term courses and seminars for staff members in order to make use of
modern
 methodology and IT.
 make sure that tutorial classes are well-organized, relevant exercises, home works and
assignments are
 carefully set to enhance and strengthen the students’ ability to solve problems and
understand the
 underlying theory.
 ensure that appropriate and recent text books are used for the courses. provide enough
reference
 books for each course.
 evaluate the courses at the end of each semester based on the feed back obtained from the
o instructors, the tutors and the students, so as to make the courses more relevant.
 ensure that the lectures are conducted by an appropriate instructors

128