COVENANT UNIVERSITY
COURSE COMPACT
Department Of Mathematics
2013/2014 Session
College: Science and Technology
Department: Mathematics
Programme: Industrial Mathematics
Course Code: MAT 415
Course Title: Experimental Design
Units: 3
Course Lecturer: Dr. T. A. Anake & Odetunmibi O.A.
Semester: Alpha
Time: 12.00noon – 1.00pm (Mondays)
Location: CST Hall 204
A. BRIEF OVERVIEW OF COURSE
Scientific methods require investigations and daily experiments are conducted both
in academics and in industry. This course is designed to teach the process of
conducting meaningful and result oriented experiments in situations where many
variables are investigated simultaneously. It is concerned with the planning,
allocation and management of experimental and observational units and statistical
analysis.
B. COURSE OBJECTIVES/GOALS
At the end of the course, students should be able to:
i.
Plan experiments
ii.
Obtain relevant information regarding hypotheses
iii.
Make statistical analysis.
C. METHOD OF DELIVERY /TEACHING AIDS

Guided Instructions

Class Activity

Assignments

White board and marker
D. COURSE OUTLINE
Module 1: Design and Analysis of Experiments
Week One: Introduction to experimental designs.
Week Two: Replication and Randomization
Week Three: Completely randomized
Week Four: Randomized block Designs
Week Five:
Latin Square Designs,
Week Six:
Factorial experiments
Module 2: Further analysis of treatment effects
Orthogonal contrasts and multiple comparisons.
Module 3: Investigation of assumptions and theory of tests
E. TUTORIALS
Tutorials will be given at the end of the course.
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Continuous Assessment:
Test 1
10 marks
Test 2
10 marks
Assignment
10 marks
Examination
70 marks
Total
100 marks
G. GROUND RULES & REGUKATIONS

No eating in the class

Punctuality to classes

No use of i-pods in the class

Dress code must be correctly adhered to

75% required for eligibility to semester examination.
H. TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITY
Assignment and term papers will be given as the course progresses.
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS

Classes are conducted in such away that the university core values are
observed and respected.

Course is delivered in a manner that the knowledge acquired is useful and
applicable.
J. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
Course is relevant for planning, allocation of resources and predictions, control.
K. RECOMMENDED READING/TEXT
Knight, K. (2000). Mathematical Statistics. New York. Chapman & hall/CRC.
Montegomery, D.C. (2001). Design and Analysis of Experiments (5th Ed): New
York. John Wiley & Sons Inc.
Spiegel, M. R. and Stephens, L. J. (2004). Schaum’s Outline Series of Theory and
Problems of Statistics (3rd Ed). New Delhi. Tata McGraw-Hill Publishing Co.
Ltd. (Original work 1961).
COVENANT UNIVERSITY
COURSE COMPACT
2013/2014 Academic Session
College: Science and Technology
Department: Mathematics
Programme: Industrial Mathematics
Course Code: MAT 318
Course Title: Statistical Inference
Units: 2
Course Lecturer: Owoloko, E.A. (Mr.) & Odetunmibi, O. A
Semester: Alpha
Time: Thursday, 10am – 12noon.
Location: Hall 202 CST.
A. BRIEF OVERVIEW OF COURSE
Scientific methods require investigations and daily experiments and inference taken
about a population from a sample space. This course is designed to teach the
process of conducting meaningful and unbiased methods of conducting
experiments and the best way to take a decision about a population based on the
decision taken on a sample space.
B. COURSE OBJECTIVES/GOALS
At the end of the course, students should be able to:
i.
Use various statistical tests.
ii.
Differentiate between parametric and non-parametric test
iii.
Apply statistical analysis to real life problems.
C. METHOD OF DELIVERY /TEACHING AIDS

Guided Instructions

Class Activity

Assignments

White board and marker
D. COURSE OUTLINE
Module 1: Parametric statistics
Week 1: principle and methods of estimation.
Week 2&3: Point estimations; methods of moments.
Week 4: Maximum likelihood method.
Week 5: Interval Estimation.
Week 6&7: Principle of hypothesis testing.
Week 8: Introducing the various parametric tests- chi, t, F
Week 9: Analysis of variance.
Module 2: Non-parametric Statistics
Week 10: Introducing the non – parametric test. Definition and concepts.
Week 11: The Sign and median test.
Week 12: Walcoxon two sample rank and the Kruskal – wallis tests.
Week 13: Revision.
Week 14: Examination.
E. TUTORIALS
Tutorials will be given at the end of the course.
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Continuous Assessment:
Mid-semester test
20 marks
Assignment
10 marks
Examination
70 marks
Total
100 marks
G. GROUND RULES & REGULATIONS

No eating in the class

Punctuality to classes

No use of i-pods in the class

Dress code must be correctly adhered to

75% required for eligibility to semester examination.
H. TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITY
Assignment and term papers will be given as the course progresses.
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS

Classes are conducted in such away that the university core values are
observed and respected.

Course is delivered in a manner that the knowledge acquired is useful and
applicable.
J. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
Course is relevant for planning, allocation of resources and predictions.
K. RECOMMENDED READING/TEXT
Mood, A.M., Graybill, F.A., and Boes D.C. (2004). Introduction to the theory of
statistics .
Spiegel, M. R. and Stephens, L. J. (2004). Schaum’s Outline Series of Theory and
Problems of Statistics.
COVENANT UNIVERSITY, OTA
2013/2014 Academic Session
COURSE COMPACT FOR MAT313
College: Science and Technology
School: Natural & Applied Sciences
Department: Mathematics
Programme: Industrial Mathematics
Course Code: MAT313
Course Title: Complex Analysis I
Units: 2
Course Lecturers: DR. M.C. AGARANA & MR O.O. AGBOOLA
Semester: Alpha
Time: Monday, 12:00 Noon – 2:00 pm
Location: Hall 102 (CST Building)
A. BRIEF OVERVIEW OF COURSE
This is the first course (of two) in the sequence "Complex Analysis." It is a third-year
undergraduate level course on complex analysis. Complex analysis is an extremely useful and
beautiful part of mathematics and forms the basis of many techniques employed in many branches
of mathematics and physics. In this course, some basic rudiments of complex analysis will be
studied. The notions of derivatives, familiar from calculus, will be extended to the case of complex
functions of a complex variable. In fact, analytic functions form the centrepiece of this course. It is
a prerequisite for MAT418 (Complex Analysis II).
B. COURSE OBJECTIVES/GOALS
In this course students will learn the algebra and geometry of complex numbers, mappings in the
complex plane, the theory of multi-valued functions and the calculus of functions of single complex
variable. In particular, students after completing this course are expected to be able to
 perform basic mathematical operations (arithmetics, powers, roots) with complex numbers
in Cartesian and polar forms;
 determine continuity/differentiability/analyticity of a function and find the derivative of a
function;
 work with functions (polynomials, reciprocals, exponential, trigonometric, hyperbolic, etc)
of single complex variable and describe mappings in the complex plane;
 work with multi-valued functions (logarithmic, complex power) and determine branches of
these functions;
 determine whether a series is convergent or divergent by using the ratio test
C. METHOD OF DELIVERY /TEACHING AIDS
The course has an in-class component and an out-of-class component. The in-class component will be a
combination of lectures, problem solving demonstrations, discussions, questions/answers and short
problem solving activities. In the out-of-class component, students are expected to read and review their
notes and textbooks, and complete homework problems.
Classroom Powerpoint presentations will be used to reinforce concepts. Many sample problems will
be presented on overhead transparencies. Students will be led step-by-step through various thinking
and problem solving strategies to solve many kinds of problems. Students will be given ample
opportunity to practice solving problems through in-class assignments as well as through homework
assignments.
D. COURSE OUTLINE
Course Outline and Weekly Course Coverage Calendar
Week 1
Review of the field of Complex Numbers and Complex Algebra
Week 2
Functions of a complex variable: polynomials, rational, trigonometric, hyperbolic, logarithmic
functions and their inverses and branch point
Week 3
Functions of a complex variable: logarithmic functions; the inverses of trigonometric, hyperbolic
and branch point
Week 4
Limit and continuity of a complex-valued function of a complex variable
Week 5
Test #1
Week 6
Differentiation: complex derivative
Week 7
Analytic functions and the Cauchy-Riemann equations
Week 8 & 9
Convergence of sequences and series of functions of complex variabless: absolute and uniform
convergence
Week 10
Test #2
Week 11
Tutorials and General Revision
Week 12 & 13 (Final exam)
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Each student will be evaluated on the basis of performance in each of the following areas:
1. Attendance at class meetings, In-class work / group work (periodically), quizzes (some
quizzes may be unannounced), homework, collected and graded and solutions provided
(counting for 10% of the total course marks);
2. Two tests, 1-hour duration for each (counting for 20% total of the course marks) and
3. One (1) End-of-semester examination, 2 hours duration counting for 70% of the total
course marks.
G. GROUND RULES & REGULATIONS
Students would be required to maintain high level of discipline (which is the soul of an army) in the
following areas:






Regularity and punctuality at class meetings – Because regular participation enhances the
learning process, students are expected to adhere to the attendance policy set forth by the
University. Therefore, students are strongly encouraged to attend all classes to better prepare
them for assignments, tests and other course-related activities;
Modest dressing;
Good composure;
Regardless of the cause of absences, a student who is absent six or more days in a semester
is excessively absent, and will not receive credit unless there are verified extenuating
circumstances.
A note on academic honesty: Collaboration among students to solve homework
assignments is welcome. This is a good way to learn mathematics. So is the consultation of
other sources such as other textbooks.
However, every student should hand in an own set of solutions, and if you use other people's
work or ideas you should indicate the source in your solutions.
(In any case, complete and correct homework receives full credit.)
Late homework assignments will NOT be accepted.
H. TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITIES
Group projects will be assigned at the discretion of the course tutor/facilitator.
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS
Prayers are to be offered at the beginning of lectures. Presentation of the learning material will be
done in such a way that the knowledge acquired is useful and applicable. Efforts would be made to
address students on godliness, integrity and visionary leadership.
J. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
Complex analysis is useful in many branches of mathematics, including algebraic geometry,
number theory, applied mathematics; as well as in physics, including hydrodynamics,
thermodynamics, mechanical engineering and electrical engineering.
K. RECOMMENDED READING/TEXT
1. Advanced Engineering Mathematics 3rd Edition by Dennis G. Zill & Michael R. Cullen (2006)
(Publishers: Jones & Bartlett Publishers)
2. A First Course in Complex Analysis with Applications by Dennis G. Zill & Patrick D. Shanahan
(Publishers: Jones & Bartlett Publishers)
COVENANT UNIVERSITY
COURSE COMPACT
2013/2014 Academic Session
College: College of Science and Technology
Department: CIS/Mathematics
Programme: Industrial Mathematics
Course Code: MAT312
Course Title: Numerical Methods 1
Units: 3
Course Lecturer: Oghonyon, J. Godwin and Famewo, M. M.
Semester: Alpha
Time: Mondays; 5-7pm and Thursdays; 8-9am
Location: Hall 201 and Hall 204
a.
Brief Overview of Course
This course is a continuation of introduction to numerical analysis one
and provides
the various step by step process for solving numerical
method of ODEs as well as
investigating the theoretical properties of the
methods.
b.
Course Objectives
At the end of the course, student should be able to:




Understand the essence of numerical methods for solving odes
Define the one step and multistep methods
Derive the one step and multistep methods.
Find the numerical method of ODEs using the one step and multistep
methods
 Investigate the theoretical properties of the scheme of the one step
and multistep scheme.
 compare the analytically and numerical methods.
c.
Methods of Lecture delivery/Teaching Aids.
-
d.
Guided instructions
Active student participation and interaction
Solution of guided and related problems.
Assignments.
White board and marker
Lecture notes and textbooks
Multimedia facilities
Course Outlines
Module 1:
Introduction to Numerical Methods
Week One:
Numerical Solution of ODEs and existence of solutions
Week Two:
One step schemes
Week Three:
Continuation of one step schemes
Week Four:
Theory of convergence and Stability.
Week Five:
Tutorials.
Week Six:
Continuous Assessment.
Module 2:
Introduction to Linear Multistep methods.
Week Seven:
Definitions and development of the schemes.
Week Eight:
Theory of convergence and stability.
Week Nine:
Extrapolation processes.
Week Ten:
Tutorials.
Week Eleven:
Continuous Assessment.
Module Three:
Integral equation and boundary value problem
Week Twelve:
problems.
Introduction on integral equation and boundary value
Week Thirteen:
Revision
Week Fourteen:
e.
End of semester examination.
Structure of the Programme/Method of Grading
Continuous Assessment:
Test 1
10 marks
Test 2
10 marks
Assignment and attendance
10 marks
Examination
70 marks
Total
100 marks
f.
Ground Rules & Regulations
Students are to maintain high level of discipline in the following areas.




g.
Punctuality
Modest Dressing
Quietness
75% lecture attendance for eligibility to semester examination.
Assignment
Students are given assignments at the end of the lecture.
h.
Alignment with Covenant University Vision/Goals
*
Prayers at the commencement of lectures and commitment to God.
*
Classes are conducted with total compliance to the university core
values.
*
Course is delivered in a manner that the knowledge acquired is useful
and applicable.
i.
Industry Relevance
This course is useful for demonstrating:
 computational skills necessary for problem solving and mathematical
modeling.
 It provides approximate solution when the analytical method is not
possible.
j.
Recommended Reading/Text
1. Numerial Methods: P. Kandasamy, K. Thilagavathy and K. Gunavathi.
2. Numerical Mehtods: S. .R. K Iyengar and R. K. Jain.
COVENANT UNIVERSITY, OTA
2013/2014 Academic Session
COURSE COMPACT FOR MAT217
College: Science and Technology
School: Natural & Applied Sciences
Department: Computer & Information Sciences/Mathematics
Programme: Industrial Mathematics
Course Code: MAT217
Course Title: Statistics for Biological Sciences
Units: 3
Course Lecturers: ODETUNMIBI, O. A. & Famewo, M. M.
Semester: Alpha
Time: 6.00 pm – 7.00 pm (Mondays) & 8.00 am – 10.00 am (Wednesdays)
Location: CST Hall 108 & 202
A. BRIEF OVERVIEW OF COURSE
This course is designed to provide students majoring in Biological Sciences such as Biochemistry,
Microbiology, Applied Biology, Biology e.t.c an introductory survey of the many applications of
inferential statistics. Basically, it introduces the importance, the uses of statistics and application of
statistics in biological sciences. Topics in this course include frequency distribution, laws of
probability, probability distributions, hypothesis testing, and estimation of small and large samples,
linear regression, and analysis of variance. Basic computer skills (especially spreadsheet
knowledge) are desirable. A calculator is required. Casio fx-991 recommended.
B. COURSE OBJECTIVES/GOALS
At the end of the course, students should be able to:
i.
know the uses and the importance of statistical methods in biological sciences.
ii.
have an in-depth understanding of what is called frequency distribution.
iii.
recognize data that follow Binomial and Poisson probability distributions and be able
to calculate probabilities using statistical tables..
iv.
recognize data that are normally distributed and be able to calculate probabilities
using statistical tables.
v.
perform and interpret hypothesis tests on claims about means and proportions for
small and large sample data both manually and using appropriate technology. Also,
students should be able to determine the proper statistic to use under various
circumstances and how probabilities of Type I and Type II errors affect hypothesis
testing.
vi.
vii.
perform a simple regression on two-sample data, understand the uses and limitations
of a regression analysis, and perform a test of significance on the correlation
coefficient.
perform Analysis of Variance (ANOVA) tests.
C. METHOD OF DELIVERY /TEACHING AIDS
 The course will be taught via Lectures using power-point presentations. Tutorial
Sessions would also be designed to complement and enhance both the lectures
and the students’ appreciation of the course.
 Course work assignments will be reviewed with the students.
 White board and marker
D. COURSE OUTLINE / DELIVERY MODULES
LECTURE DELIVERY MODULE FOR MAT217 (STATISTICS FOR BIOLOGICALSCIENCES)
Module 1: Use of Statistical Methods in Biology
Week 1: What is Statistics, The relationship between Statistics and Biology, The usefulness of
Statistics in Biological Sciences?
Week 2: Frequency Distributions
Module 2 – Probability Distributions
Week 3: Laws of Probability
Week 4: Binomial and Poisson distributions
Week 5: Normal distribution
Week 6: Conduct of Test I
Module 3 – Correlation, Regression and Hypothesis Testing
Week 7: Linear correlation, product moment and rank correlation
Week 8: Regression Analysis and Tests of Significance
Week 9: Estimation of parameters (Small and Large sample)
Week 10: Test of hypothesis for Small and Large samples
Week 11: Analysis of Variance
Week 12: Revision and Conduct of Test II
Week 13 & 14: End-of-Semester Examination
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
4. Attendance at class meetings, In-class work / group work (periodically), quizzes (some
quizzes may be unannounced), homework, collected and graded and solutions provided
(counting for 10% of the total course marks);
5. Two tests, 1-hour duration for each (counting for 20% total of the course marks) and
6. One (1) End-of-semester examination, 3 hours duration counting for 70% of the total
course marks.
G. GROUND RULES & REGULATIONS
Students would be required to maintain high level of discipline in the following areas:

Regularity and punctuality at class meetings – Because regular participation enhances the
learning process, students are expected to adhere to the attendance policy set forth by the
University. Therefore, students are strongly encouraged to attend all classes to better prepare
them for assignments, tests and other course-related activities;






Regardless of the cause of absences, a student who is absent six or more days in a semester
is excessively absent, and will not receive credit unless there are verified extenuating
circumstances
Students will be given assignments periodically. Students may work together to understand
these assignments, but all work submitted must be the student’s original work. There is a
distinct difference between providing guidance and instruction to a fellow student and
allowing the direct copying of another’s answers or work.
Late homework assignments will NOT be accepted.
Modest dressing; and
Good composure
Missed Tests - There are no make-up tests. If the test is missed for a valid reason, affected
student must submit appropriate documentation to the course facilitator within one week of the
test. Print on it his/her name, student matriculation number, course number, and date. If
documentation is not received in time, the affected student’s test mark will be zero. If a test
is missed for a valid reason, its weight could be shifted to the final exam (subject to
Management approval)
H. TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITIES
Group projects will be assigned at the discretion of the course tutor/facilitator.
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS
Prayers are to be offered at the beginning of lectures. Presentation of the learning material will be
done in such a way that the knowledge acquired is useful and applicable. Efforts would be made to
address students on Godliness, integrity and visionary leadership.
J. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
The course will help students in using statistical approach and methods in making useful
decisions in Biological Sciences
K. RECOMMENDED READING/ TEXT
 Hoel, P. G. (1976). Elementary Statistics (4th Ed). London: John Wiley & Sons Inc.
 Shork, M. A. And Remington, R. D. (2000) Statistics with application to the Biological and
Health Sciences (3rd Ed): Prentice Hall.
 Chap, T. Le (2003). Introductory Biostatistics. New Jersey: John Wiley & Sons Inc.
COVENANT UNIVERSITY, OTA
2013/2014 Academic Session
COURSE COMPACT FOR MAT212
College: Science and Technology
School: Natural & Applied Sciences
Department: Mathematics
Programme: Industrial Mathematics
Course Code: MAT212
Course Title: Mathematical Methods I
Units: 2
Course Lecturers: DR. MRS S.A. BISHOP & MR O.O. AGBOOLA
Semester: Alpha
Time: Tuesdays, 1:00 pm – 3 pm; Fridays, 11:00 am – 12:00 Noon
Location: Hall 308 (CST Building)
A. BRIEF OVERVIEW OF COURSE
This is the first course (of two) in the sequence "Mathematical Methods." This course is designed to
teach students about a variety of mathematical methods which are used in modelling through their
application to solving real world problems. To study this course students should have a sound
knowledge of algebra, calculus, and geometry as provided by MAT111 (Algebra) and MAT121
(Calculus). MAT212 is a prerequisite for MAT222 (Mathematical Methods II).
B. COURSE OBJECTIVES/GOALS
Objectives: At the end of the course students will be able to:





relate the concepts of limit and continuity studied in MAT121 to function of several
variables
carry out partial differentiation of function of several variables
apply the concept of Lagrange multiplier techniques to finding the minima and
maxima of functions of several variables
find higher derivatives of functions of several variables
carry out Taylor series and Maclaurin series expansion of functions of several
variables.
C. METHOD OF DELIVERY /TEACHING AIDS
The course has an in-class component and an out-of-class component. The in-class component will
be a combination of lectures, problem solving demonstrations, discussions, questions/answers and
short problem solving activities. In the out-of-class component, students are expected to read and
review their notes and textbooks, and complete homework problems.
Classroom Powerpoint presentations will be used to reinforce concepts. Many sample problems will
be presented on overhead transparencies. Students will be led step-by-step through various thinking
and problem solving strategies to solve many kinds of problems. Students will be given ample
opportunity to practice solving problems through in-class assignments as well as through homework
assignments.
D. COURSE OUTLINE
Course Outline and Weekly Course Coverage Calendar
Week 1
Partial differentiations: application
Week 2
Classification of critical points of functions of two variables
Week 3
Lagrangian multipliers
Week 4
Coordinate system: change from Cartesian to polar, spherical and cylindrical coordinate systems.
Week 5
Test #1
Week 6
Coordinate system: change from Cartesian to polar, spherical and cylindrical coordinate systems II
Week 7
Taylor’s and Maclaurin’s series
Week 8
Differential coefficients of the nth order
Week 9
Leibnitz’s rule, application to the solution of differential equations
Week 10
Test #2
Week 11
Tutorials and General Revision
Week 12 & 13 (Final exam)
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Students’ grades in the course will be determined as from their total scores weighted as follows:
Attendance at class meetings, in-class wrok / group work (periodically), quizzes (some quizzes may
be unannounced) 10%, Two tests 20%, Final Exam 70%.
G. GROUND RULES & REGULATIONS
Students would be required to maintain high level of discipline (which is the soul of an army) in the
following areas:






Regularity and punctuality at class meetings – Because regular participation enhances the
learning process, students are expected to adhere to the attendance policy set forth by the
University. Therefore, students are strongly encouraged to attend all classes to better prepare
them for assignments, tests and other course-related activities;
Modest dressing;
Good composure;
Regardless of the cause of absences, a student who is absent six or more days in a semester
is excessively absent, and will not receive credit unless there are verified extenuating
circumstances.
A note on academic honesty: Collaboration among students to solve homework
assignments is welcome. This is a good way to learn mathematics. So is the consultation of
other sources such as other textbooks.
However, every student should hand in an own set of solutions, and if you use other people's
work or ideas you should indicate the source in your solutions.
(In any case, complete and correct homework receives full credit.)
Late homework assignments will NOT be accepted.
H. TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITIES
Group projects will be assigned at the discretion of the course tutor/facilitator.
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS
Prayers are to be offered at the beginning of lectures. Presentation of the learning material will be
done in such a way that the knowledge acquired is useful and applicable. Efforts would be made to
address students on godliness, integrity and visionary leadership.
J. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
This course will provide the mathematical background for optimization and develop
mathematical thinking.
K. RECOMMENDED READING/TEXT
G. Stephenson (1977). Mathematical Methods for Science Students. London and New York:
Longman.
P. D. S. Verma (1995). Engineering Mathematics. New Delhi: Vikas Publishing House PVT
Ltd.
COVENANT UNIVERSITY, OTA
2013/2014 Academic Session
COURSE COMPACT FOR MAT122
College: Science and Technology
School: Natural & Applied Sciences
Department: Mathematics
Programme: Industrial Mathematics
Course Code: MAT112
Course Title: Trigonometry and Analytical Geometry
Units: 2
Course Lecturers: DR. T.A. ANAKE & AGBOOLA, O. O.
Semester: Alpha
Time: Wednesday, 12:00 Noon – 2:00 pm
Location: Lecture Theatre I
A. BRIEF OVERVIEW OF COURSE
This course is a preparation course intended for students majoring in engineering, mathematics,
physics, chemistry, computer science or certain vocational fields. The course is a study of both
trigonometric and conic functions and equations. Both rectangular and polar coordinates are
studied.
B. COURSE OBJECTIVES/GOALS
• To introduce trigonometric functions and their applications.
• To introduce exponential functions and their applications
• To introduce logarithmic functions and their graphs.
• To study the basic properties of logarithmic functions.
Specific Learning Outcomes: Upon successful completion of this course the student should be able to:
1. Define the trigonometric ratios and find these ratios for arbitrary angles.
2. State and apply the basic trigonometric identities.
3. Solve application problems involving triangles.
4. Sketch graphs involving the trigonometric functions.
5. State and apply the inverse trigonometric functions.
6. Verify trigonometric identities.
7. Solve trigonometric equations.
8. solve problems on equations of lines and planes.
8. describe a conic section and solve related problems.
C. METHOD OF DELIVERY /TEACHING AIDS
The course has an in-class component and an out-of-class component. The in-class component will be a
combination of lectures, problem solving demonstrations, discussions, questions/answers and short
problem solving activities. In the out-of-class component, students are expected to read and review their
notes and textbooks, and complete homework problems.
Classroom Powerpoint presentations will be used to reinforce concepts. Many sample problems will
be presented on overhead transparencies. Students will be led step-by-step through various thinking
and problem solving strategies to solve many kinds of problems. Students will be given ample
opportunity to practice solving problems through in-class assignments as well as through homework
assignments.
D. COURSE OUTLINE
Course Outline and Weekly Course Coverage Calendar
Week 1
Trigonometric Functions
1.1. Angles and Their Measurement
1.2. Right Triangle Trigonometry
1.3. Computing Values
Week 2
2.1. Trigonometric Functions of General Angles
2.2. Unit Circle
Week 3
3.1 Graphs of Sine and Cosine Functions
3.2 Graphs of Tangent, Cotangent, Secant, and Cosecant Functions
3.3 The Inverse Sine, Cosine and Tangent Functions
3.4 Inverse Functions Continued
Week 4
4 Trigonometric Identities
4.1 Sum and Difference Formulas
4.2 Double Angle and Half-angle Formulas
Week 5
Trigonometric Equations (I)
Week 6 Test #1
Week 7
Trigonometric Equations (II)
Week 8
8 Applications of Trigonometric Functions
8.1 Applications Involving Right Triangles
8.2 The Law of Sines
8.3 The law of Cosines
Week 9 & 10
Analytic Geometry
1 Equations of lines and planes
2 Conics
2.1 The Parabola
2.2 The Ellipse
2.3 The Hyperbola
Week 11
Revision
Week 12 & 13 (Final exam)
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Each student will be evaluated on the basis of performance in each of the following areas:
7. Attendance at class meetings, In-class work / group work (periodically), quizzes (some
quizzes may be unannounced), homework, collected and graded and solutions provided
(counting for 10% of the total course marks);
8. Two tests, 1-hour duration for each (counting for 20% total of the course marks) and
9. One (1) End-of-semester examination, 2 hours duration counting for 70% of the total
course marks.
G. GROUND RULES & REGULATIONS
Students would be required to maintain high level of discipline (which is the soul of an army) in the
following areas:






Regularity and punctuality at class meetings – Because regular participation enhances the
learning process, students are expected to adhere to the attendance policy set forth by the
University. Therefore, students are strongly encouraged to attend all classes to better prepare
them for assignments, tests and other course-related activities;
Regardless of the cause of absences, a student who is absent six or more days in a semester
is excessively absent, and will not receive credit unless there are verified extenuating
circumstances
Students will be given assignments periodically. Students may work together to understand
these assignments, but all work submitted must be the student’s original work. There is a
distinct difference between providing guidance and instruction to a fellow student and
allowing the direct copying of another’s answers or work.
Late homework assignments will NOT be accepted.
Modest dressing; and
Good composure.
H. TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITIES
Group projects will be assigned at the discretion of the course tutor/facilitator.
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS
Prayers are to be offered at the beginning of lectures. Presentation of the learning material will be
done in such a way that the knowledge acquired is useful and applicable. Efforts would be made to
address students on godliness, integrity and visionary leadership.
J. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
The course will lay a solid foundation for the students in applied Mathematics and
Engineering.
K. RECOMMENDED READING/TEXT
 R. T. Smith & R. B. Minton. Calculus (Multivariable), 2nd ed., McGraw-Hill. (2002).
 C. H. Edwards & D. E. Penney. Calculus, 6th ed., Prentice Hall: New Jersey. (2002).
 S. K. Stein & A. Barcellos. Calculus and Analytic Geometry, 5th ed., McGraw – Hill Inc.:
New Jersey. (1992).
 K. T. Tang. Mathematical Methods for Scientists and Engineers, Vol. II, Springer: New
York. (2007).
 R. Wrede & M. R. Spiegel. Schaum’s Outline of Theory and Problems of Advanced
Calculus, 2nd ed., Mc-Graw-Hill: New York. (2002).
CONVENANT UNIVERSITY
COURSE COMPACT
2013/2014 Academic session
COLLEGE:
College of Science and Technology
DEPARTMENT:
CIS/Mathematics
PROGRAMME:
Industrial Mathematics
COURSE CODE:
MAT 315
COURSE TITLE:
Probability Distributions
UNITS:
2
COURSE LECTURER: Dr. Bishop S. A. (Mrs.), Odetunmibi O. A.
SEMESTER:
Alpha
TIME:
Monday 8-10 am
LOCATION:
C S T Hall 306
A. BRIEF OVER VIEW: Probability distributions are taught to equip the student with a wild range of
tools for analyzing continuous and discrete random variables. Their properties such as
Expectation, Variance and Standard deviation. Moments and Central Limit Theorem will also
enable the students to appreciate how these distributions behave.
B. COURSE OBJECTIVES/GOALS
At the end of the course work, the students should be able to
i. Find the probability distribution for discrete and continuous variables
ii. Obtain some of their descriptive parameters
iii. Use moment generating function method to derive both mean and variance of all the
distributions
iv. Represent them graphically and in tabular form
v. Apply it where applicable
C. METHODS OF LECTURE DELIVERY
The lecture/Teaching/learning Method: with active student participation
White Board, lecture notes and Textbook
D. COURSE OUTLINES
MODULE 1: PROBABILITY DISTRIBUTIONS;
Week 1:
Basic definitions and concepts.
Weeks 2&3: Discrete probability distributions and their characteristics
Weeks 4&5: Continuous probability distributions and their characteristics
MODULE 2: GENERATING FUNCTIONS;
Weeks6&7: Moments and Moment generating functions of random
Variables
Weeks 8&9: Sums of independent random variables, The Central Limit
Theorem
MODULE 3: BIVARIATE DISTRIBUTIONS;
Weeks 10&11: Discrete and Continuous Bivariate distributions.
E. TUTORIALS
Tutorials will be given at the completion of the course work
F. Structure of the Programme/Method of Grading
Continuous assessment
Test 1 & 2
20marks
Assignments and Attendance
10marks
Examination
70marks
G. Ground rules & regulations
Students are to maintain high level of discipline in the following areas
-punctuality
-modest dressing
-quietness
H. Assignments
Students will be given Assignments at the end of each lecture
I. Alignment with Covenant University Vision/Goals
Prayers at the commencement of lectures
Students are encouraged to be responsible, like studying to excel,
Praying to God for understanding, etc
J. Recommended Reading/Text
1. Statistical Methods. By Freund Nelson
2. Probability and Statistics. W Mendenhall, R.J Beaver and B.M Beaver
3. Probability and Statistics. M.R Spiegel
4. A Course in Probability Theory. Kai Lai Chung
K. Contemporary issues/Industry Relevance
The course is relevant in production industries, for statisticians, etc
COVENANT UNIVERSITY
COURSE CONTENT
2013/2014 ACADEMIC SESSION
COLLEGE: SCIENCE AND TECHNOLOGY
DEPARTMENT: MATHEMATICS
PROGRAMME: INDUSTRIAL MATHEMATICS
COURSE CODE: MAT 311
COURSE TITLE: ABSTRACT ALGEBRA
UNITS: 3
COURSE LECTURER: PROFESSOR OLALERU
SEMESTER: ALPHA
TIME: 10am -11am
LOCATION: HALL 306
A.
BRIEF OVERVIEW OF COURSE.
For industries to grow, they need to plan and make budget each time.
This course is very useful because it involves imagination and logic. So,
the concepts of groups and rings are taught with proofs.
B.
COURSE OBJECTIVES / GOALS
At the end of the course, students should be able to:
i.) understand the axioms of a group and its types.
ii.) prove some theorems associated with groups and rings.
iii.) Apply the concepts of groups and rings in computational
applications.
C. METHOD OF DELIVERY / TEACHING AIDS
i.) Guided instructions.
ii.) Class activities.
iii.) Assignments.
iv.) White board and marker.
D.)
COURSE OUTLINE
MODULE 1: Group.
MODULE 2: Subgroup.
MODULE 3: Normal subgroup.
MODULE 4: Quotient group.
MODULE 5: Cyclic group.
MODULE 6: Symmetric groups and Cayley’s theorem.
MODULE 7: Sylow theorem and group acting on sets.
MODULE 8: Rings.
MODULE 9: Isomorphisms theorems.
MODULE 10: Prime and Maximal ideals.
MODULE 11: Principal Ideal Domain, Euclidean Domain and Unique
factorization domain.
MODULE 12: Revision.
MODULE 13 & 14: Examination.
E.
TUTORIALS
Tutorial will be given at the end of the course.
F.
STRUCTURE OF PROGRAMME / METHOD OF GRADING
Continuous assessment
Test 1 (15 marks)
Test 2 plus assignment (15 marks)
Examination 70 marks
Total 100 marks.
G.
GROUND RULES AND REGULATIONS.
i.) No eating in the class.
ii.) Punctuality to classes.
iii.)
No use of I-pods in the class.
iv.)
Dress code must be correctly adhered to
v.) 75% required for eligibility to semester exam.
vi.)
H. ASSIGNMENT AND STUDENTS ACTIVITIES
Assignment will be given at the end of each topic.
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION / GOALS
Classes are conducted in line with the university core values.
J. CONTEMPORARY ISSUES / INDUSTRY RELEVANCE
Course is relevant to planning and budgeting units in the industries.
K. RECOMMENDED TEXT
Ajala J. O., Introduction to Abstract algebra.
COVENANT UNIVERSITY
COURSE CONTENT
2013/2014 ACADEMIC SESSION
COLLEGE: SCIENCE AND TECHNOLOGY
DEPARTMENT: MATHEMATICS
PROGRAMME: INDUSTRIAL MATHEMATICS
COURSE CODE: MAT 214
COURSE TITLE: LINEAR ALGEBRA
UNITS: 3
COURSE LECTURER: DR. AGARANA M.C. / MRS K.S EKE
SEMESTER: ALPHA
TIME: 3 pm – 5 pm
LOCATION: HALL 306
D.
BRIEF OVERVIEW OF COURSE.
The basic concepts of linear algebra are introduced to the students. The
topics taught in this course are applicable to the industry. The course is a
foundation for higher pure mathematics courses such as topology,
algebraic topology, e.t.c.
E.
COURSE OBJECTIVES / GOALS
At the end of the course, students should be able to:
iv.) Understand the axioms of a vector space.
v.) Manipulate matrices.
vi.) Identify homogenous system, eigenvalues and eigenvectors.
F.
METHOD OF DELIVERY / TEACHING AIDS
v.) Guided instructions.
vi.) Class activities.
vii.) Assignments.
viii.)
White board and marker.
E.) COURSE OUTLINE
MODULE 1: Introduction to basic concepts of linear algebra.
MODULE 2: Vector spaces.
MODULE 3: Subspaces.
MODULE 4: Linear dependence & linear Independence.
MODULE 5: Basis and Dimension.
MODULE 6: Linear mapping.
MODULE 7: Elementary operations on matrices.
MODULE 8: Echelon forms, row/column rank of a matrix.
MODULE 9: Determinant and inverse of matrices.
MODULE 10: Homogenous and non-homogenous systems.
MODULE 11: Eigenvalues and eigenvectors.
MODULE 12: Revision.
MODULE 13 & 14: Examination.
G.
TUTORIALS
Tutorial will be given at the end of the course.
H.
STRUCTURE OF PROGRAMME / METHOD OF GRADING
Continuous assessment
Test 1 (15 marks)
Test 2 plus assignment (15 marks)
Examination 70 marks
Total 100 marks.
I.
GROUND RULES AND REGULATIONS.
vii.)
No eating in the class.
viii.)
Punctuality to classes.
ix.)
No use of I-pods in the class.
x.) Dress code must be correctly adhered to
xi.)
75% required for eligibility to semester exam.
H.) ASSIGNMENT AND STUDENTS ACTIVITIES
Assignment will be given at the end of each topic.
I.) ALLIGNMENT WITH COVENANT UNIVERSITY VISION / GOALS
Classes are conducted in line with the university core values.
J.) CONTEMPORARY ISSUES / INDUSTRY RELEVANCE
Course is relevant to calculating the input- output of resources in the
industry especially the productive company.
K.) RECOMMENDED TEXTs
Hoffman K. and Kunze R.(Second edition),
Linear algebra.
COVENANT UNIVERSITY
COURSE CONTENT
2013/2014 ACADEMIC SESSION
COLLEGE: SCIENCE AND TECHNOLOGY
DEPARTMENT: MATHEMATICS
PROGRAMME: INDUSTRIAL MATHEMATICS
COURSE CODE: MAT 114
COURSE TITLE: STATISTICS
UNITS: 2
COURSE LECTURER: MRS K.S EKE / MISS MOYO FAMEWO
SEMESTER: ALPHA
TIME: 8 am – 10 am
LOCATION: HALL 202
J.
BRIEF OVERVIEW OF COURSE.
The elementary nature of statistics is introduced to the students.
The topics cover the several methods of collecting data and the
analysis of data. The basic concepts of probability are taught. Statistics
cannot carry out any research without first having the data; hence the
topics are relevant to the industries.
K.
COURSE OBJECTIVES / GOALS
At the end of the course, students should be able to:
i.) Differentiate between discrete and inferential statistics.
ii.) Survey and establish the best method to collect data for a
specific research.
iii.) Analyze the data collected.
iv.) Predict the outcome of an event.
L.
METHOD OF DELIVERY / TEACHING AIDS
ix.) Guided instructions.
x.) Class activities.
xi.) Assignments.
xii.) White board and marker.
M.
COURSE OUTLINE
MODULE 1: Introduction to statistics.
MODULE 2: Diagrammatic representation of descriptive data.
MODULE 3: Measure of location for ungrouped data.
MODULE 4: Measure of dispersion for ungrouped data.
MODULE 5: Measure of location for grouped data.
MODULE 6: Measure of dispersion for grouped data.
MODULE 7: Associated graphs.
MODULE 8: Introduction to probability.
MODULE 9: Sample space and events.
MODULE 10: Addition law.
MODULE 11: Use of permutation in evaluating probability.
MODULE 12: Use of combination in evaluating probability.
N.
TUTORIALS
Tutorial will be given at the end of the course.
O.
STRUCTURE OF PROGRAMME / METHOD OF GRADING
Continuous assessment
Test 1 (15 marks)
Test 2 plus assignment (15 marks)
Examination 70 marks
Total 100 marks.
P.
GROUND RULES AND REGULATIONS.
xii.)
No eating in the class.
xiii.)
Punctuality to classes.
xiv.)
No use of I-pods in the class.
xv.)
Dress code must be correctly adhered to
xvi.)
75% required for eligibility to semester exam.
H.) ASSIGNMENT AND STUDENTS ACTIVITIES
Assignment will be given at the end of each topic.
II.)ALLIGNMENT WITH COVENANT UNIVERSITY VISION / GOALS
Classes are conducted in line with the university core values.
J.) CONTEMPORARY ISSUES / INDUSTRY RELEVANCE
Course is relevant to the industry since almost every day-to-day
activity require the use of data.
K.) RECOMMENDED TEXT
Egbe E., Odili G.A. and Ugbebor O.O (Second Edition), Further
mathematics.
COURSE COMPACT
COLLEGE:
College of Science and Technology
DEPARTMENT: Computer Science and Information Sciences
PROGRAMME: Computer Science
COURSE CODE: CSP 412
COURSE TITLE: Fuzzy Logic
UNITS:
2
COURSE LECTURERS: Dr. (Mrs.) Oladipupo, O.O. and Mr. OluRanti
SEMESTER:
TIME:
LOCATION:
Alpha 2013/2014
10-12am, Wednessday
CSC Hall 201
BRIEF OVERVIEW OF THE COURSE
Fuzzy logic is a tool that can be applied to ambiguous, complicated, complex or nonlinear systems or
problems, which cannot easily be solved by classical techniques. This course discusses the fundamental of
fuzzy set theory and fuzzy logic. In addition, this course also introduces applications of fuzzy logic in several
areas such as fuzzy control and fuzzy decision making.
COURSE OBJECTIVES/GOAL
In this course you will learn:
(a) How imprecision in concept can be discussed using the basic of fuzzy sets;
(b) The basic principles of organizing a fuzzy expert system;
(c) What is inside the rule-base of a fuzzy expert system;
(d) About methods of building a fuzzy expert system.
METHOD OF LECTURE DELIVERY/TEACHING AIDS
 Guided Instruction
 Interaction classroom session
 Students group assignment
 Chart and diagrams
 Multimedia projection
COURSE OUTLINES
Module 1: Introduction to Fuzzy set theory
Week 1 and 2:
Introduction to fuzzy set theory, knowledge base problem, objective and
subjective knowledge. Crips sets, fuzzy sets, linguistic variables, hedges or
modifiers of linguistic variables, Properties of fuzzy sets, fuzzy set operations.
Exercises
Module 2
Week 3 and 4:
Membership function Calibrations
Review of module1, Membership functions, Fuzzy extension principles, Law of
contraction and law of excluded Middle.
Assignment
Modules 3:
Fuzzy Relation
Week 5 and 6
Review of module 2, Fuzzy Relation, compositions on the same and different
product spaces, Max-min composition, max-product composition, fuzzy relational
matrix, sup-star composition.
Exercises
Module 4:
Week 7 and 8:
Fuzzy reasoning and implication
The fuzzy truth tables, traditional propositional logic, rule of inference, the Modus,
pones and Modus tollens.
Module 5
Week 9:
Fuzzy Expert system Modeling
If – Then Rules, fuzzy inference, Fuzzification and Defuzzification process
MID-SEMESTER EXAMINATION
Week 11:
Week 12 and 13
Week 14
Week 15
Building a fuzzy expert system (Fuzzy logic system applications)
Hand-on practical using MatLab Fuzzy engine tool box.
Group Presentations
Revision and evaluation
STRUCTURE OF THE PROGRAMME/METHOD OF GRADING
1. Continuous assessment 30%
(i)
Assignment (5%)
(ii)
Group Presentation (10%)
(iii)
Mid-semester Exam (15%)
2. End-Semester Exam
70%
GROUND RULES AND REGULATIONS
Please note the following:





Mandatory 75% class attendance
No eating in the classroom
Active participation in all activities
All class assignments to be submitted on time
Punctuality to classes to be observed
TOPIC FOR TERM PAPERS
Students will be grouped and each group will develop fuzzy expert system for different sectors of their
choice.
RECOMMENDED READING/TEXT




J-S.R Jang, C-T. Sun, E. Mizutani, Neuro-Fuzzy and SoftComputing . 1st edition New York, McGraw-Hill.
T.J.Ross, (1995) Fuzzy logic with Engineering applications
H-J. (1996) Zimmermann, Fuzzy set theory and its applications
T,Terano, K. Asai, and M. Surgeno (1992) Fuzzy systems theory and its applications
Online Book
 Passino, Kevin M. & Yurkovich, Stephen (1998). Fuzzy Control. Menlo Park
(California): Addison Wesley
http://www.ece.osu.edu/~passino/FCbook.pdf#search=%22fuzzy%20control%22)
Milestone Papers:
 Zadeh, L. (1965), "Fuzzy sets", Information and Control, Vol. 8, pp. 338-353.


Takagi, H., and Sugeno, M. (1985). ‘Fuzzy Identification of Systems and its
Applications to Modeling and Control’. IEEE Transactions on Systems, Man,
and Cybernetics. Volume 115, pages 116-132.
Covenant University, Ota
College:
Science and Technology
Department:
Computer & Information Sciences
Programme:


Course Code:
B. Sc. Computer Science
B.Sc. Management Information System
CSC 319/CSC 412
Course Title:
Operations Research
Units:
2 Units
Course Lecturer:
Dr. Akinyemi, I. O.; Dr. Oladipupo, O.O; Mrs. Okuboyejo, S. R; Mr. Eweoya, I
Semester/ Session:
Alpha Semester/ 2013-2014 Session
Time:
Monday/ 10 a.m-12noon
Venue:
Hall 313
a.
Brief overview of Course
The course enables students to know Operations Research Modeling approaches. Transportation
and Assignment Problems: Formulation and Solution. It also shows students the techniques for
Project planning and control with PERT-CPM. Deterministic Model; Economic order quality model
(EOQ); Production planning; Stochastic Models:
b.
Course Objectives
At the end of this course, students are expected to;
*
have mathematical foundations in linear programming, optimization models, and
algorithms
*
know the details of the resource management techniques
*
understand the applicability of linear programming, transportation problem and network
analysis to some real life problems – task
*
solve problems relative to minimization and maximization, using any solution method
*
be able to solve real life problems related to optimization, transportation and other related
problems.
c.
Method of Lecture delivery/Teaching Aids
Lecture Delivery:

Guided instruction

Interaction classroom session

Student group assignments

Lecture notes
Teaching Aid


d.
Overhead projection
Multimedia projection
Course Outline
Overview of the operation research Modeling approaches. Linear programming model; assumption of
linear programming; Simplex method; Two-phase Method; Artificial Variable Technique; Minimization and
maximization Two-Phase method. Transportation simplex method: tableau initialization, optimality test,
and iteration; Assignment Problems: Formulation and Solution. Directed network; Shortest-path problem:
Algorithm for minimum spanning tree problem; Maximum cost flow problem; Minimum cost flow problem;
Network simplex method; Project planning and control with PERT-CPM. Deterministic Model; Continuous
Review: Economic order quality model (EOQ); Periodic review: Production planning; Stochastic Models:
Single Period model; Two-period inventory model; Multi-period model. One-dimensional Search: Golden
section search derivations; Taylor series and conditions for local optima; Convex / Concave function and
global optimality; Gradient search; Newton's method; Quasi-Network method and BFGS search. Lagrange
multipliers method; Karush-Kuhu-Tucker optimality conditions; Penalty and barrier method..
Module 1:
Overview of the operations research modeling approaches
Weeks 1 - 2
*
Linear programming model
*
Assumption of LP
*
Solution methods – Simplex, two-phase, and artificial variable
*
Minimization and maximization
Module 2:
Transportation and Assignment problems
Week 3 - 5
*
Transportation simplex method
*
Tableau initialization
*
Optimality test and iteration
*
Formulation and solution of assignment problems
Module 3:
Network analysis
Week 6 - 7
Module 4:
*
Shortest-path problem
*
Algorithm for minimum spanning tree problem
*
Maximum and minimum cost flow problem
*
Network simplex method
*
Project planning and control with PER-CPM
Inventory theory
Week 8 - 9
Module 5:
*
Continuous reviews
*
Economic order quality model (EOQ)
*
Periodic review - production planning
Stochastic model
Week 10
Module 6
*
Single period model
*
Two-period inventory model
*
Multi-period model
Unconstrained nonlinear programming
Week 11 - 12
Week 13
*
One-dimensional search
*
Golden search derivations
*
Taylor series and conditions for local optima
*
Convex/concave function and global optimality
Revision
e.
Tutorial
f
Structure of the Programme/Method of Grading
1.
Continuous Assessment
*
2.
g.
Class Test
Semester examination
30 marks
70 marks
Ground rules & regulation





Recorded over 90 % average class attendance
Students displayed a good sense of responsibility and decorum
Class assignment are taken seriously
Students engaged actively in all class activities
Punctuality to class is expected of every student
h.
Topics for term papers/Assignment/Students activities
questions based on class work
i.
Structure
Alignment with Covenant University Vision/Goals
The delivery of the lecture aligns with the goals and vision of Covenant University to the raising
new generation of leaders.
j.
Contemporary issues/Industry relevance
The course is very relevance because we are in the era when optimization is very crucial in any
organization vis-a-vis areas human endeavour
k.
Recommended Reading/Text
1.
Introduction to Operations Research
2.
Operations Research in Decision analysis and Production Management
Adedayo et al (2006)
1st Edition
Hillier L.
8th Edition
COVENANT UNIVERSITY
College of Science and Technology
Department of Computer and Information Sciences
COURSE CODE:
CSC 317
COURSE TITLE:
Information System Analysis & Design
UNITS:
2
PROGRAMMES:
SEMESTER/ LEVEL:
Computer Science and Management Information System
ALPHA/300 Level
COURSE LECTURERS:
Okuboyejo S.R, Oni A.A, Anwansedo A.E, Majekodunmi F.
A.
Course Description: The course focuses on the principles, techniques, and methodologies of
analyzing existing operational systems with the aim of designing and implementing new automated
information systems.
B.
Course Objectives:
At the end of the course, students are expected to:
-
C.
Have an awareness of the various expertise involved in software development and the associated
career opportunities (System Analyst, Programmers, System Auditors, Project Managers etc.)
Have adequate knowledge of existing system development techniques and methodologies.
Acquire requisite practical skills in the use of modern software tools in system analysis and design.
Sufficiently equipped in theory and practice to participate in software development projects.
Method of Teaching: Lecture, Tutorial, Practical (Project)
Teaching Aids: Multimedia Projection and Covenant University E-Learning System (Moodle)
D.
Course Outline
Module 1 (Week 1-2)
Introduction: Information System, Components of IT Department, Organization chart of IT Department and
Personnel (Miss Majekodunmi)
Module 2
Week 3: System Development Life Cycle: Strategy and planning, system analysis, logical design, physical
design, implementation and maintenance (Mrs Okuboyejo)
Week 4: System Development Methodologies (Mrs Okuboyejo)
Continuous Assessment One (CA 1)
Module 3: System Development Techniques:
Week 5: Fact Gathering Techniques / Requirements Gathering (Mrs Anwansedo)
Week 6-7: Business Process modeling, data flow diagramming (Mrs Oni)
Week 8-9: Data Modeling, Entity-Relationship diagramming. (Mrs Oni)
Week 10: Practical Session with Visio (Miss Majekodunmi)
Continuous Assessment Two (CA 2)
Module 4 (Week 11):
Design and Layout of forms, screens, dialogues, and report (Mrs Anwansedo)
Revision (Week 12)
General revision and assessment of group term projects.
E.
Method of Grading:
Continuous Assessment tests
20
Assignments
10
End of Semester Examination 70
F.
Class Behaviour: Students are expected to be punctual, calm and responsive, in class, thereby,
creating a highly interactive atmosphere.
Course Project: System Analysis and Design of Information Systems for relevant departments in the
University (University Clinic, Library, University Bookshop, University Cafeteria, Student Affairs Unit,
Chaplaincy, Registry and Financial Services Unit).
The student groups are expected to carry out system analysis and design of these systems using 1)
structured development approach with the use of modern software design tools like Microsoft Visio,
Borland together, Rational rose etc.
Recommended Reading:
Text books:
1. Object-Oriented Systems Analysis and Design Using UML, Simon Bennett, Steve McRob and Ray
farmer, McGraw-Hill, Second Edition, 2002.
2. Software System Devlopment- A gentle Introduction, Carol Button and Jill Doake, Third Edition,
McGraw-Hill, 2003
3. Practical Object-Oriented Design with UML, Mark Priestley, Second Edition, McGraw-Hill, 2003.
4. System Analysis and Design Methods, Jeffery L. Whitten, Lonnie D. Bentley, Kevin C. Ditternam,5 th
Edition, McGraw-Hill- Irwin, 2001
5. System Analysis and Design, Kendall and Kendall,5th Edition, Prentice-Hall, 1998.
Covenant University
Course Compact
2013/2014 Academic Session
College:
Department:
Programme(s):
Science and Technology
Computer and Information Sciences Department
Computer Science
Course Code:
Course Title:
Unit:
Course Lecturers:
Semester:
CSC 216
Foundations of Sequential and Parallel Programming
2 Units
Dr. Oyelami and Mr. Oluranti Jonathan
Alpha
Time & Location:
a) Brief Overview of Course/Description
The relationships between H/L languages and the Computer Architecture that
underlies their implementation: basic machine architecture, assembles specification and
translation of P/L Block Structured Languages, parameter passing mechanisms.
b) Course Objectives/Goals
At the end of this course, students are expected to:

Have a good understanding of computer architecture.

Have a good understanding of the relationship between high level languages and
computer architecture.

Have good understanding of the concept of sequential and parallel programming
c) Method of Lecture Delivery/Teaching Aids
 PowerPoint Presentations of lecture notes
 Tutorials for students
 Assignments, Class work and good examples will also be used
d) Course Outlines
Week1 Introduction to the course
Module 1
Week 2-3

Basic Computer Architecture (basic machine architecture), assembles specification and
translation of P/L Block Structured Languages.
Week 4

H/L languages /C language
Module 2
Week 5

Sequential Programming
Week 6

Sequential Programming practical applications
Week7

Parallel Programming
Week 8

Mid Semester
Week 9

Parallel Programming practical applications
Week 10

Comparing sequential and parallel programming.
Module 3

Week 11 & 12
The relationships between H/L languages and the Computer Architecture as regards assembles
specification and translation of P/L Block Structured Languages, parameter passing,
e) Structure/Method of Grading
 Continuous Assessment (CA)
- Mid Semester Test - 15%
- 2 Assignments, 3 Classworks (3 marks each) – 15%
 Examination – 70%
f) Ground Rules/Class Behavior
 Interactive, Participatory
 Punctuality to class very important
 Mandatory 75% attendance
 All assignments must be submitted as required
g) Recommended Reading/Texts

World Wide Web (Internet)

Concurrent Programming, A. Burns and G.Davies, Addison-Wesley, 1993

Computer Architecture: A Quantitative Approach by John L. Hennessy, David A. et al

Programming with C, Second Edition by Schaum’s Outline

Andrews (2000), Foundations of Multithreaded, Parallel and Distributed Programming,
Addison Wesley.

Lea (2000), Concurrent Programming in Java: Design Principles and Patterns, (2nd Edition),
Addison Wesley.

Goetz et al. (2006), Java concurrency in practice, Addison-Wesley

Ben-Ari (1982), Principles of Concurrent Programming, Prentice Hall.

Andrews (1991), Concurrent Programming: Principles & Practice, Addison Wesley.

Burns & Davis (1993), Concurrent Programming, Addison Wesley.

Magee & Kramer (1999), Concurrency: State Models and Java
COURSE COMPACT
College:
Science and Technology
Department: Computer and Information Sciences
Programme(s):
o
B. Sc. Computer Science
Course Code: CSC314
Course Title: THEORY OF COMPUTING
Unit:
2
Course Lecturer(s): Dr. (Mrs) Oladipupo, O.O. and Mr. Adewole, O
Semester:
Alpha – 2013/2014
Time:
Friday , 12.00noon – 2.00pm
Location:
Hall 313.
A.
BRIEF OVERVIEW OF THE COURSE
Theory of computing is a scientific discipline concerned with the study of general properties of
computation. It provides computer science with concepts, models, and formalisms to help reason
about these concepts and models. It also addresses the question of what is and is not feasible
computable and creates algorithms for the intellectual processes that are being automated. The
aim of this course is all about the theories that enable computation, and computation is all about
modeling, designing, and programming the computer system to simulate our model.
B.
COURSE OBJECTIVES/GOALS
At the end of the course, students are expected to:



be exposed to the exciting aspects of computer theory
be exposed to how programming language is design with the use of Grammars.
be concern about the languages or in other words, formal languages that enable computation with
the computer possible.
C.
METHOD OF LECTURE DELIVERY/TEACHING AIDS
Lecture delivery
Guided instruction
Interaction classroom session
Transparencies
Overhead projection
Multimedia
-
D.
COURSE OUTLINES
Module 1 Introduction
Week 1 Alphabet and Strings , Languages, Language operation
Module 2
Finite Automata
Week 2 Deterministic and Non-deterministic finite automata
Week 3 Conversion automata to certain types of grammars and back again, using
non-deterministic automata
Week 4 Conversion of non-deterministic finite automata to deterministic finite
automata
Week 5 Regular expressions and their relationship to finite automata
Module 3
Grammars
Week 6 Definition, Regular Grammar
Week 7 Regular expression
Week 8 Relationship between regular grammar and regular expression
Types of Grammar (Chomsky hierarchy)
Module 4
Pushdown automata and context-free grammars
Week 9 Deterministic and non-deterministic pushdown automata Context-free
grammars
Week 10
Useless production and emptiness test Ambiguity
Week 11
Context-free grammars for pushdown automata and vice-versa
Module 5
Properties of Context-free languages
Week 12
Pumping lemma, Closure properties, Existence of non-context-free
languages
E.
Week 13
Turing languages, Decidability and Undecidability
Week 14
Revision
TUTORIALS
o
o
o
o
F.
Review the basic features of Grammars and Finite Automata
Identifying different types Chomsky hierarchy
Review the Context free grammar and Pushdown automata.
Etc.
STRUCTURE OF THE PROGRAMME/METHOD OF GRADING
1.
2.
G.
Continuous assessment
i.
Assignments/Term paper
10%
ii
Mid-semester exam
20%
Examination
GROUND RULES AND REGULATIONS
Please note the following:





30%
Mandatory 75% class attendance
No eating in the classroom
Active participation in all activities
All class assignments to be submitted on time
Punctuality to classes to be observed
70%
H.
TOPICS FOR TERM PAPER/ASSIGNMENT
Students are to be group into three and each group is expected their term paper on Finite
Automata, Push down automata and Turing language
I.
ALIGNMENT WITH COVENANT VISION/GOALS
Generally, Theory of computing is a scientific discipline that dealt with the study of computation
which provides the computer scientists with concepts, models, and formalisms to help reason
about these concepts and models. It also addresses the question of what is and is not feasible
computable and creates algorithms for the intellectual processes that are being automated.
Therefore, this will enhance the students’ thinking and reasoning by providing solutions to a wide
range of scientific problems into the real world.
J.
CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
This course has a wide range of applications most especially in the areas of construction of compiler
design and Software Engineering.
K.
RECOMMENDED READING
1.
2.
3.
Lawson, M.V. Finite Automata. Chapman and Hall/CRC, 2004
Brookshear, J.G. Theory of Computation: Formal languages, Automata, and Complexity. The
Benjamin/Cummings Publishing Company, Inc. 1989.
Carroll, J. and Long, D. Theory of Finite Automata (with an introduction to formal languages).
Prentice Hall, 2004.
COVENANT UNIVERSITY
COURSE COMPACT
2013/2014 Academic Session
College:
Science and Technology
Department:
Computer and Information Sciences
Programmes:
o
o
B.Sc. Computer Science
B.Sc. Management Information System
Course Code:
CSC 310
Course Title:
Internet Programming
Units:
2
Course Lecturers:
Dr. A. A. Azeta and Mrs A. A. Oni
Semester:
Alpha – 2013/2014
Time:
Tuesday 5 – 7 pm
Location:
Hall 307
a. Brief Overview of Course
The course is designed to introduce students to the art of web design, implementation, maintenance
and hosting. The totality of this is to develop manpower for the ever-green and promising field of
electronic and Internet business.
b. Course Objectives
 Introduce students to the Internet and transmission protocols.
 Teach students the fundamentals of web design.
 Teach students the use of HTML, CSS, PHP and Java scripts.
 Teach students Front-end and Back-end scripting Language.
 Teach the concept of managing and hosting web sites.
c. Methods of Lecture Delivery/Teaching Aids

Lecture Delivery Methods
 Interactive classroom session
 Group assignments
 Lecture notes

Teaching Aids
 Multimedia projection
 Computer Laboratory
d. Course Outline:
 Modules & Details of Topics
Module I
Overview of Internet and Web Basics
Week 1. Overview of Distributed Computing, Mobile & Wireless computing,
Mobile Web page Design Tools. Network Security; Client/Server Computing
(using the web). Overview of the Internet, Domain Names, Internet
Protocols. Browsers: Netscape Communicator, Internet Explorer, Browser
Plug-ins, Helper Applications, Web Authoring Tools, and Internet Hardware
Requirements.
Module II
Web Design using HTML
Week 2:Structure of Web Application, Browsers and Web Servers, Front-end, Middleware and
Back-end Scripting Languages. Introduction to Hypertext Markup Language, HTML
Standards, HTML Extensions and Types of WebPages.
Week 3: Web page Basics: HTML Tags, Text and Information, Links, Lists, Tables,
Multimedia: Graphics. Audio, Video, Enhanced Features: Image Maps.
Counters, User Interaction, Dynamic Web Pages.
Module III
Introduction to Cascading Style Sheets (CSS)
Week 4. Meaning of CSS, difference between CSS and HTML, benefits of CSS
Week 5. The Basic CSS Syntax, applying CSS to HTML Syntax, and properties of CSS
Module IV
Web Design using PHP and MySQL
Week 5 and 6:Introduction to PHP
Week 7.
Dynamic Web Pages, Database design and management using MySQL
Module V Web Design using Java script
Week 8.
Introduction to JavaScript
Week 9.
CGI, PERL, Java, Design Considerations, Active Server Page,
Module III
Managing and Hosting Web Sites
Week 10:
Designing and Managing Web sites, Connecting to the Web Provider,
Publishing WebPages,
Week 11:
Website Maintenance Tools, Factors Affecting Website Performance,
Interfacing with Other Information Servers.
e. Tutorials
 Review the basic features of some web sites.
 Identify basic features of e-Auction, e-Commerce, e-Government and e-Learning Web sites.
 Review of HTML, CSS, PHP and Java script syntax

f. Structure of the Programme/Method of Grading


Continuous Assessment
o Class test/Assignments
o Mid Semester test
20 Marks
10 Marks
Examination
70 Marks
g. Ground Rules & Regulations
o 70% Attendance is required to seat for the examination.
o Assignments must be submitted as at when due.
o Contributions to group discussion and class work are noted.
o Punctuality to classes to be observed
h. Topics of Term Papers/Assignment/Student Activities

Practical Web Design Assignments:
o Development of an e-Commerce site
o Development of an m-Commerce site
o Development of a shopping Cart
o Development of an e-Learning Site
etc.
i.
Alignment with Covenant University Vision/Goals
The Internet has remained a dominant platform upon which businesses are transacted as well as a
medium for information is transmission globally. The students are groomed to provide solutions to
a wide array of technical and business problems on this platform through the skills acquired in the
course.
j.
Contemporary Issues/Industry Relevance
Web site is a dominant feature of most organizations and virtually all business enterprises strive to
maintain this status quo. By implication, Internet programmers will continue to be in high demand.
k.
1.
2.
3.
4.
5.
6.
Recommended Reading/Texts
Programming the web using XHTML and JavaScript by Larry Randles. McGraw -Hill publisher
MySQL/Php database Applications by Jay Greenspan and Bradbulger
JavaScript -the definite guide by David Flannagan
PHP cookbook by David Sklar, Adam Trachtenbeg
PHP and MySQL Web Development By Luke Welling and Luara Thomson, SAMS, USA
Learning WML & WMLScript O Reilly (Martin Frost)
COVENANT UNIVERSITY
COURSE COMPACT
2013/2014 Academic Session
College: College of Science and Technology
Department: Mathematics
Programme: Industrial Mathematics
Course Code: GEC 410
Course Title: Probability & Statistics.
Units: 2
Course Lecturer: Oghonyon J. Godwin/ Dr Agarana, M. C.
Semester: Alpha
Time: Wednesday; 10-12pm
Location: Lecture theater two
a.
Brief Overview of Course
Probability and Statistics: Probability space, theorems. Conditional probability and independence. random
variables, discrete and continuous distributions, mean and variance. Bernoulli, Binomial, Poisson,
hypergeometric, exponential, normal distributions and their characteristics. Examples of experimental
measurement and reliability. Elementary sampling theory for normal population. Central limit theorem.
Statistical inference (point and interval estimation and hypothesis testing) on means, proportions and
variances. Power and operating characteristics of tests. Chi-squares test of goodness of fit. Simple linear
regressions.
b.
Course Objectives
At the end of the course, student should be able to:
 define probability with various examples.
 understand probability space and theorems.
 define and understand conditional and independence probabilities with
worked examples.
 define random variables, discrete and continuous distribution with worked
examples.
 understand Bernoulli , Binomial and normal distribution.
 define statistical inference( point and interval estimation)
 determine hypothesis testing and their test methods on means proportion
and variance.
 understand Chi-square test of goodness fits.
 determine simple linear regression.
c.
Methods of Lecturer delivery/Teaching Aids.
-
d.
Guided instructions
Active student participation and interaction
Solution of guided and related problems.
Assignments.
White board and marker
Lecture notes and textbooks
Course Outlines
Module 1:
Probability.
Week One:
Introduction to probability with examples and their properties.
Week Two:
Conditional and independence probability.
Week Three:
tutorials.
Week Four:
Discrete and continuous distribution with worked examples.
Week Five:
Tutorials
Module 2:
Probability Distribution.
Week Six:
Bernoulli, Binomial and normal distribution.
Week Seven:
Statistical inference(point and interval estimation).
Week Eight:
Hypothesis testing and their test criterion.
Week Nine
Tutorials
Module Three
Continuation on Statistical Inference
Week Nine:
Chi-square test of goodness fits.
Week Ten:
Simple linear regression.
Week Eleven:
Tutorials.
Week Twelve:
Tutorials.
Week Thirteen:
Tutorials.
Week Fourteen:
Tutorials.
e.
Structure of the Programme/Method of Grading
Continuous Assessment:
Test 1
10 marks
Test 2
10 marks
Assignment
10 marks
Examination
70 marks
Total
100 marks
f.
Ground Rules & Regulations
Students are to maintain high level of discipline in the following areas.




g.
Punctuality
Modest Dressing
Quietness
75% lecture attendance for eligibility to semester examination.
Assignment
Students are given assignments at the end of the lecture.
h.
Alignment with Covenant University Vision/Goals
*
Prayers at the commencement of lectures and commitment to God.
*
Classes are conducted with total compliance to the university core values.
*
Course is delivered in a manner that the knowledge acquired is useful and
applicable.
i.
Industry Relevance
This course is useful for :
 decision making and quality control in establishment.
j.
Recommended Reading/Text
3. Schaum's Outlines on Probability and Statistics.
Schaum's Outlines on Probability random variables and random processes.
COVENANT UNIVERSITY
COURSE COMPACT
2013/2014 Academic Session
College: College of Science and Technology
Department: CIS/Mathematics
Programme: Industrial Mathematics
Course Code: MAT317
Course Title: Mathematical Methods III
Units: 2
Course Lecturer: Oghonyon, J. Godwin and Mrs Eke S. Kanayo
Semester: Alpha
Time: Mondays; 5-7pm
Location: Hall 313
a.
Brief Overview of Course
This course is a continuation of mathematical methods one and two.
However, this
course provides a higher dimension for solving higher order
ordinary differential
equations with various methods for diffusing the ordinary
differential equations.
b.
Course Objectives
At the end of the course, student should be able to:





understand the essence of higher order ODEs
provide solutions to singular points
determine the linear dependence and Wronkians method of ODEs
solve the classical orthogonal polynomials
resolve gamma and beta functions.
c.
Methods of Lecture delivery/Teaching Aids.
-
d.
Guided instructions
Active student participation and interaction
Solution of guided and related problems.
Assignments.
White board and marker
Lecture notes and textbooks
Multimedia facilities
Course Outlines
Module 1:
Introduction linear dependence and the Wronskian
Week One:
Linear dependence
Week Two:
Wronskian method for solving higher order ODEs
Week Three:
Equation in
Series representation of solution of an Ordinary Differential
the neighborhood of an ordinary point.
Week Four:
Series Solution near a regular singular point
Week Five:
Tutorials.
Week Six:
Continuous Assessment.
Module 2:
Introduction to Classical Orthogonal Polynomials
Week Seven:
Legendre Polynomial
Week Eight:
Hermite polynomial
Week Nine:
Laguerre polynomial
Week Ten:
Tutorials.
Week Eleven:
Continuous Assessment.
Module Three:
Special Functions
Week Twelve:
Gamma and Beta functions
Week Thirteen:
Revision
Week Fourteen:
End of semester examination.
e.
Structure of the Programme/Method of Grading
Continuous Assessment:
Test 1
10 marks
Test 2
10 marks
Assignment and attendance
10 marks
Examination
70 marks
Total
100 marks
f.
Ground Rules & Regulations
Students are to maintain high level of discipline in the following areas.




g.
Punctuality
Modest Dressing
Quietness
75% lecture attendance for eligibility to semester examination.
Assignment
Students are given assignments at the end of the lecture.
h.
Alignment with Covenant University Vision/Goals
*
Prayers at the commencement of lectures and commitment to God.
*
Classes are conducted with total compliance to the university core values.
*
Course is delivered in a manner that the knowledge acquired is useful and
applicable.
i.
Industry Relevance
This course is useful for demonstrating:
 the various method for solving real life application problems in ODEs form.
j.
Recommended Reading/Text
4. Schaum's outline on differential equations
5. Advanced Calculus by Schaum's Outline (Second Edition)
COVENANT UNIVERSITY
COURSE COMPACT
2013/2014 Academic Session
College: Science and Technology
Department: Computer and Information Sciences
Programme: B.Sc. Computer Science
Course Code: CSC 315
Course Title: Computer Architecture and Organization
Units: 2
Course Lecturers: Dr. Azeta A. A. & Mr. Oluranti
Semester: Alpha, 2013/2014
Time: Tuesday 10 – 11 am.
Location: Hall 308 (Tuesday)
l.
Brief Overview of the Course
This course involves teaching of number systems, organization and architecture of modern computer systems as well as
writing of assembly language programs.
The aim is to expose students to the design and internal working of computer systems.
m.
Course Objectives/Goals
At the end of this course, students are expected to:



n.
be able to explain how numbers are represented in the computer memory;
be able to explain the architecture and organization of modern computer systems;
be able to program the computer system using Assembly Language.
Methods of Lecture Delivery/Teaching Aids
Lecture Delivery



Interactive classroom session
Group assignments
Lecture notes
 Charts and diagrams
Teaching Aids

Use of Computer laboratory to provide a practical understanding of computer architecture.
 Microsoft PowerPoint slides
 Transparences

Multimedia projector
d. Course Description
Data representation and Number bases. Binary/Octal/Hex Number Systems. Binary Arithmetic.
Other Codes: BCD, Excess-3, Gray, ASCII, EBCDIC. Signed numbers. 2's complement Addition &
subtraction. Multiplications and Division. BCD addition. Integer representation, Integer arithmetic,
Fixed and Floating-Point systems. Boolean Algebra: Basic circuits and theorems; Boolean
expressions; Truth tables, Logic gates and realization of Boolean functions. Fundamental building
blocks, logic expressive immunization, sum of product forms. Register transfer notation. Physical
considerations. Representation of memory systems organization and architecture. The Instruction
Cycle, Instruction Pipelining, The Intel Pentium and Motorola PowerPC processors, Microoperations. Advanced Computer Architecture: Reduced Instruction Set Architecture, RISC
Pipelining, The RISC versus CISC Controversy, Assembly language programming of 32 bit
INTEL and 32 bit MOTOROLA processors, programming model, addressing modes, instruction
set, data types, operation types, instruction formats, instruction groups.
e. Course Outlines
 Modules & Details of Topics
Module 1: Introduction
Week 1 An Introduction to the following:
Course Outline, a general review.
The course lecturers.
Textbooks and reference materials.
Number Systems
Module 2:
Module 3:
Number Systems
Week 2
Data representation and Number bases. Binary/Octal/Hex Number
Systems. Binary Arithmetic. Other Codes: BCD, Excess-3, Gray, ASCII,
EBCDIC. Signed numbers. 2's complement .Addition & subtraction.
Multiplications and Division
Week 3
BCD addition. Integer representation, Integer arithmetic, Fixed and
Floating-Point systems
Boolean Expression & Logic Gate
Week 4 Boolean Algebra: Basic circuits and theorems; Boolean expressions;
Truth tables, Logic gates and realization of Boolean functions.
Week 5 Fundamental building blocks, logic expressive immunization,
sum of product forms.
Module 4:
Processor Organisation
Week 6 Register transfer notation. Physical considerations. Pentium
and PowerPC Evolution.
Week 7 Representation of memory systems organization and architecture.
Module 5:
Instruction Circle
Week 8 The instruction circle, Instruction Pipelining.
The Intel Pentium and Motorola PowerPC processors.
Week 9 Micro Operations
Module 6:
Advanced Computer Architecture
Week 10
Reduced Instruction Set Architecture, RISC Pipelining.
The RISC versus CISC Controversy.
Module 7:
Assembly Language
Week 11
Assembly language programming of 32 bit INTEL and 32 bit
MOTOROLA processors, programming model.
Week 12
Addressing modes, instruction set, data types, operation types,
instruction formats, Instruction group
Module 8
Week 13
Tutorial/Revision
f.
Tutorials
o Review of Number systems
o Boolean expression & logic gate
o Processor organization
o RISC and CISC Pipelining
o Assembly language Programming
g.
Structure of the Programme/Method of Grading
(1)
(2)
Continuous assessment
30 marks
(i)
Assignments
10%
(ii)
Mid Semester Exam
20%
Examination
70%
====
TOTAL
100%
====
h.
Ground Rules & Regulations
o To seat for the examination, 75% Attendance is required.
o Assignments must be submitted as at when due.
o Contributions to group discussion and class work are noted.
i.
Topics of Term Papers/Assignment/Student Activities
o
o
o
o
Representation of data in the computer memory
Development of theorems of Logic gates
Compare and contrast RISC and CISC processor
Programming in Assembly language
j.
Alignment with Covenant University Vision/Goals
Understanding the principles behind the design of a computer system is a major step in building a
computer system. This course will expose the students to the computer hardware so as for them to
know how software and hardware work together and most importantly, it will give them a
foundation to build on in case they want to specialize in hardware in the future, which can make
them self-employed.
k.
Contemporary Issues/Industry Relevance
As a result of the competitive nature of most businesses, organizations require competent IT
personnel with an understanding of the internal working of computer systems to provide effective
IT support services. Consequently, skilled programmers that have adequate hardware skills will be
at an advantage.
l.
Recommended Reading/Texts
Chalk B. S. (2004), Computer Organisation and Architechure An Introduction
Bartee, T. C. (1991), Computer Architecture and Logic Design
(McGraw-Hill International editions).
Dowsing R. D. et al (2000), Computers from logic to architecture
2nd Edition, (Mcgraw-Hill Companies)
Stallings W. (2003), Computer Organisation and Architecture
(Designing for performance) Sixth Edition.
Tanenbaum A. S. (2006), Structured Computer Organisation, fifth edition, Pearson Prentice Hall.
John P. Hayes (1998), Computer Architecture and organization
Mcgraw-hill international edition.
Mark D. Hill, Norman P. Jouppi Gurindar S. Sohl (2000), Readings in computer architecture.
M. Morris Mano, Computer System Architecture 3rd edition, Prentice Hall.
John L. Hennessy & David A. Patterson (2003), Computer Architecture, A Quantitative Approach. 3rd edition,
Morgan Kaufmann Publishers.
Miles J. Murdocca & Vincent P. Heuring (2000), Principles of Computer Architecture, Prentice-Hall, Inc.
R. D. Dowsing, F. W. D. Woodhams & I. Marchall (2000), 2nd edition, Computers from Logic to Architecture.
The McGraw-Hill Companies.
Dezso Sima, Terence Fountain & Peter Kacsuk, (1997) Pearson Education, Advanced Computer
Architectures, A design space Approach. Pearson Education.
COVENANT UNIVERSITY, OTA.
MAT 414 COURSE COMPACT
2013/2014 ACADEMIC SESSION
College:
Science and Technology
Department:
CIS/Mathematics
Course Code:
MAT 414
Course Title:
Advanced Numerical Analysis
Unit:
3
Course Lecturers:
Mr. G. J. Oghonyon and Mr. O. J. Adeleke
Semester:
Alpha
Lecture venue:
Hall 313 and Hall 102(CST)
Time:
12-1pm(Wednesdays) and 8-10am(Thursdays)
A. BRIEF OVERVIEW OF COURSE
This course is an introduction to numerical method for solvingo partial differential equations. The
idea of finite difference scheme and taylor's series expansion will be used to derive the parabolic,
hyperbolic and elliptic PDEs as well as practical engineering problems will be treated.
B. COURSE OBJECTIVES/GOALS
At the end of the course, students should be able to
1. Differentiate between the various classes of partial differential equations.
2. Apply numerical scheme to the parabolic, hyperbolic and elliptic PDEs
3. Establish the stability and convergence criteria for each scheme in (2) above.
C. METHOD OF TEACHING
1. Guided instruction
2. Class activities
3. Assignments
4. Use of white board and marker
D. COURSE OUTLINE
Introduction to numerical partial differential equations. Parabolic Equations: One space dimension, Two space
dimension. Hyperbolic Equations: One space dimension, Two space dimensions, Elliptic Equations.
Convergence and stability analysis.
MODULE ONE:
Introduction to Numerical Partial Differential Equations.
WEEK ONE:
Review on Numerical Partial Differential Equations
WEEK TWO:
Types of Partial Differential Differential Equations and their
classifications
Parabolic Equations: One space dimension, Convergence
MODULE 2:
and
stability analysis.
WEEK THREE:
Derivation of Parabolic equations
of one
space and two
dimension using finite difference scheme.
WEEK FOUR:
Investigation of some selected properties of partial differential
equations
WEEK FIVE:
Tutorials
WEEK SIX:
First Continuous Assessment Test
MODULE 3:
Hyperbolic Equations: One space dimension.
WEEK SEVEN:
Derivation of Hyperbolic Equations of one space and two space
dimension.
WEEK EIGHT:
Investigation of some selected properties of partial differential
equations
WEEK NINE:
WEEK TEN:
Tutorials.
Derivation of Elliptic Partial differential Equations using
finite
difference scheme
WEEK ELEVEN:
Investigation of some theoretical properties of the various partial
differential equations
WEEK TWELVE: Second Continuous Assessment Test
WEEK THIRTEEN: Revision
WEEK FOURTEEN: End of semester examination
E. TUTORIALS
Tutorials will be given at the end of each module.
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Continuous Assessment:
Test 1
10 marks
Test 2
10 marks
Attendance and assignment:
10 Marks
Examination:
70 marks
Total:
100 marks
G. GROUND RULES AND REGULATIONS
1. No eating in the class
2. Punctuality to classes
3. No use of i-pods in the class
4. Dress code must be correctly adhere to
5. 75% attendance required for eligibility to write semester examination
H. ALIGNMENT WITH COVENANT UNIVERSITY VISION AND GOALS
•
Classes are conducted in such a way that the university core values are observed and respected
•
Course is delivered in a manner that the knowledge acquired is useful and applicable
I. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
Course is relevant for preparing the student for endeavour in the engineering field.
J. RECOMMENDED READING TEXT
1.
Advance Engineering Mathematics: Erwin Kreyszig
2.
Numerical Methods: S. .R. K Iyengar and R. K. Jain.
COVENANT UNIVERSITY
COURSE COMPACT
2013/2014 Academic Session
College: Science and Technology
Department: Mathematics
Programme: Industrial Mathematics
Course Code: MAT111
Course Title: Algebra
Units: 3
Course Lecturer: Owoloko, A.E. & Dr. Agarana, M.C
Semester: Alpha
Time: Tuesday, 12-2pm and Thursday, 5-6pm
Location: LT 1
A. BRIEF OVERVIEW OF COURSE
The fundamental concepts of algebra are introduced to the students. The topics
taught in this course are topics expected to be mastered by students in the
Sciences, Engineering and the Social Sciences. This course is the ‘building blocks’
on which other higher mathematical concepts are built upon.
B. COURSE OBJECTIVES/GOALS
At the end of the course, students should be able to:

Identify special sets ( N  Z  Q  R  C ) and their meanings as it applies to
other mathematical concepts.

State the various laws of topics to be taught and solve problems related to
these topics.

Relate their understanding of topics taught in this course to other
mathematical related courses.
C. METHOD OF DELIVERY /TEACHING AIDS

Guided Instructions

Class Activity

Assignments

Electronic White Board
D. COURSE OUTLINE
Module 1: Basic Algebra
Week 1: Basic definition of set and concept and set properties.
Week 2: Special set; Theory of indices and properties of indices, indicial equations.
Week 3: Law of logarithm. Definition and Concepts. Surdic equation.
Week 4 &5:Inequalities. Definitions and concept. Solving quadratic and cubic
inequalities.
Week 6&7: Polynomials, the remainder and factor theorems. Quadratic equation, domain
and roots of rational functions and partial fraction.
Module 2: Applied Algebra
Week 8&9: Introduction to MxN matrices; elementary properties on matrices and
application to solution of linear equations. Elementary properties of determinants of at
most 3x3 matrices. The rule of Sarrus.
Week 10: Permutation & Combination; The binomial theorem for any index and
applications.
WeeK 11: Sequences and Series of real numbers.
Week 12: Algebra of complex numbers.
Week 13: Revision / Tutorials
Week 14: Examination.
E. TUTORIALS
Tutorials will be given at the end of the course.
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Continuous Assessment:
Assignment
10 marks
Mid-Semester test
20 marks
Examination
70 marks
Total
100 marks
G. GROUND RULES & REGULATIONS

Punctuality to Class.

No use of laptop, i-pods and other electronic devices in the class.

Dress code must be correctly adhered to.

75% attendance required for eligibility to semester examination.

No eating in the class.
H. TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITY
Assignment will given as the course progresses
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS

Classes are conducted in such away that the university core values are
observed and respected.

Course is delivered in a manner that the knowledge acquired is useful and
applicable.
J. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
The importance of basic mathematics in industry cannot be over emphasized.
K. RECOMMENDED READING/TEXT
1. Bunday, B.D. and Mulholand, H. (1983). Pure Mathematics for Advanced level.
2. Blakey, J. (1983). Intermediate Pure Mathematics.
3. Ho Soo Thong et al. (2002). College Mathematics. Nigeria.
4. Backhouse et al (2002). Pure Mathematics.
COVENANT UNIVERSITY, OTA.
MAT 113 COURSE COMPACT
2012/2013 ACADEMIC SESSION
College:
Science and Technology
Department:
CIS/Mathematics
Course code:
MAT 113
Course title:
Elementary Mechanics
Unit:
3
Course lecturer:
Dr T. A. Anake and Mr. O. J. Adeleke
Semester:
Alpha
Lecture venue:
Time:
K. BRIEF OVERVIEW OF COURSE
This course is on introduction to elementary mechanics. It introduces the students to the a
fundamental topics in applied Mathematics, that is, vector analysis. The application of vector is
used to explain some physical terms such as the Newton’s laws of motion.
L. COURSE OBJECTIVES/GOALS
At the end of the course, students should be able to
4. Understand the concept of vector.
5. Apply the concept of vector to elementary mechanics
6. Understand elementary principles of mechanics.
M. METHOD OF TEACHING
5. Guided instruction
6. Class activities
7. Assignments
8. Use of white board and marker
N. COURSE OUTLINE
MODULE 1:
Elementary vector analysis
MODULE 2:
The notions of displacement, speed, velocity and acceleration of a particle
MODULE 3:
Newton’s laws of motion and applications to simple problems.
MODULE 4:
Work, power, conservation of energy to motion of particles and those
involving elastic and spring.
MODULE 5:
Collision of smooth spheres.
MODULE 6:
Simple problems of projections.
MODULE 7:
Conical pendulum. Simple harmonic motion.
MODULE 8:
Resultant of any number of forces acting on a particle.
MODULE 9:
Reduction of coplanar forces acting on a rigid body to a force and a couple.
MODULE 10:
Equilibrium of coplanar forces, parallel forces, couples laws of function.
MODULE 11:
Applications of the principle of moments. Moments of inertia of simple
bodies.
O. TUTORIALS
Tutorials will be given at the end of each module.
P. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Continuous Assessment:
Test 1
15 marks
Test 2
15 marks
Examination:
70 marks
Total:
100 marks
Q. GROUND RULES AND REGULATIONS
6. No eating in the class
7. Punctuality to classes
8. No use of i-pods in the class
9. Dress code must be correctly adhere to
10. 75% attendance required for eligibility to write semester examination
R. ALIGNMENT WITH COVENANT UNIVERSITY VISION AND GOALS
•
Classes are conducted in such a way that the university core values are observed and respected
•
Course is delivered in a manner that the knowledge acquired is useful and applicable
S. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
Course is relevant for preparing the student for endeavour in the engineering field.
T. RECOMMENDED READING TEXT
Covenant University
College Science and Technology
Department Of Mathematics
2013/2014 Session
PROGRAMME:
Industrial Mathematics
COURSE CODE:
MAT 413
COURSE TITLE:
Introduction to Probability Theory and Stochastic Processes
UNITS:
3 Units
COURSE LECTURER:
Dr.(Mrs.) S. Bishop & Mr A. E. Owoloko
SEMESTER:
Alpha
TIME:
Monday, 10 -12 am and Wednesday, 9 - 10 am
LOCATION:
CST Building.
COURSE OVERVIEW
In this course the notion of probability is studied from a set theoretic approach. In particular,
probability is considered to be a special measure which has the additional property that P    1.
We describe an entire experiment by the probability space  , G, P  , where  is the set of
outcomes, G is the set of events, and P is the probability measure. This probability models is useful
in the measurement of uncertainty in different human endeavours.
COURSE OBJECTIVES/GOALS
At the end of the course, students should be able to:
i.
Define probability as a measure
ii.
Define random variables as measurable functions
iii.
Define independence of random variables
iv.
Characterize random variables using moments
v.
Describe and compare convergence methods in probability theory
vi.
Identify stochastic processes
METHOD OF DELIVERY /TEACHING AIDS
 Guided Instructions
 Class Activity
 Assignments
 White board and marker
COURSE OUTLINE
Module 1: Probability Space
 Review of Set theory and elementary probability
 Probability as a measure, Probability space and Conditional probability
Module 2: Random Variables as measurable functions
 Definition and properties of random variables; examples of random variables
 Functions of random variables and Measurable function
 Sums and products of random variables
Module 3: Independence
 Independence of random variables
 Convolution of the sum of random variable
 Borel – Cantelli Lemma
 Zero – one law and Kolmogorov inequality
Module 3: Types of distribution of random variables
 Discrete distributions
 Continuous distributions
Module 4: Expectation
 Expectation and conditional expectation of measurable random variables
 Moments and inequalities associated with moments
 Generating functions and Characteristic functions
Module 5: Convergence of random variables
 Convergence in probability and convergence almost surely
 Convergence in mean square and convergence in distribution
 Relationships between methods of convergence and Laws of large numbers
Module 6: Stochastic Processes
 Renewal and branching processes
 Random walks and Markov chains
 Queuing processes
TUTORIALS:
Tutorials will be given at the end of the course.
STRUCTURE OF PROGRAMME/METHOD OF GRADING
 Continuous Assessment:
Test 1
10 marks
Mid semester exam
10 marks
Assignments
10 marks
 Examination
70 marks
GROUND RULES & REGUKATIONS
 No eating in the class
 Punctuality to classes
 No use of i-pods in the class
 Dress code must be correctly adhered to
 75% required for eligibility to semester examination.
TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITY
Assignment and term papers will be given as the course progresses.
ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS
 Classes are conducted in such a way that the university core values are observed and
respected.
 Course is delivered in a manner that the knowledge acquired is useful and applicable.
CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
Knowledge of probability and stochastic processes is applicable in banking, finance
and risk management, engineering, telecommunication, biology, etc.
RECOMMENDED READING/TEXT
Cox, D. R. and Miller, H. D. (1992). The Theory of Stochastic Processes. London:
Chapman & Hall.
Kannan, D. (1978). An Introduction to Stochastic Processes. New York: North Holland.
Karlin, S. and Taylor, H. M. (1975). A First Course in Stochastic Processes, (2nd ed). New York:
Academic Press
Kingman, J.F.C. and Taylor, S.J. (1973). Introduction to Measure and Probability. Great Britain:
Cambridge University Press,
Papoulis, A. (1965). Probability, Random Variables and Stochastic Processes. New York.
McGraw-
Hill Publishing Company Inc.
Taylor, H. M. and Karlin, S. (1998). An Introduction to Stochastic Modeling, (3rd ed.). San Diego,
California: Academic Press.
COVENANT UNIVERSITY
COURSE COMPACT
2013/2014 Academic Session
College: Science and Technology
Department: Mathematics
Programme: Industrial Mathematics
Course Code: MAT 314
Course Title: Operation Research
Units: 2
Course Lecturer: Owoloko, E.A. (Mr.) and Adeleke, O. J
Semester: Alpha
Time: Wednesday, 8am – 10am.
Location: C35 Chemical Building.
A. BRIEF OVERVIEW OF COURSE
The relevance of OR in present day dynamic environment cannot be over
emphasized. Scientific methods are required to investigate and solve its complex
problems in order to make rightful decisions. This course is to bring to fore the
various decision techniques needed by the students in today’s dynamic
environment.
B. COURSE OBJECTIVES/GOALS
At the end of the course, students should be able to:
i.
Know the relevance of operation research to present day society.
ii.
Formulate and classify the various operation research models.
iii.
Use the simplex algorithm in solving linear programming problems.
C. METHOD OF DELIVERY /TEACHING AIDS

Guided Instructions

Class Activity

Assignments

White board and marker
D. COURSE OUTLINE
Module 1: Linear programming
Week 1: Phases of operations research study.
Week 2&3: Linear programming model. Formulation of model from word problems.
Week 4: Graphical solution to linear programming model.
Week 5: Introduction to the simplex algorithm
Week 6&7: Solving problems using the simplex algorithm – maximization and minimization
cases.
Week 8&9: Inventory Model
Week 9&10: Decision Theory
Module Other OR models
Week 10: Integer programming
Week 11: Dynamic programming
Week 12: Critical path analysis and project control.
Week 13: Revision.
Week 14: Examination.
E. TUTORIALS
Tutorials will be given at the end of the course.
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Continuous Assessment:
Mid-semester test
20 marks
Assignment
10 marks
Examination
70 marks
Total
100 marks
G. GROUND RULES & REGULATIONS

No eating in the class

Punctuality to classes

No use of i-pods in the class

Dress code must be correctly adhered to

75% required for eligibility to semester examination.
H. TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITY
Assignment and term papers will be given as the course progresses.
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS

Classes are conducted in such away that the university core values are
observed and respected.

Course is delivered in a manner that the knowledge acquired is useful and
applicable.
J. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
Course is relevant for planning, allocation of scarce resources.
K. RECOMMENDED READING/TEXT

Principles of Operations Research with Application to Managerial Decisions. By
Harvey M. Wagner.

Operations Research. By Taha.
COVENANT UNIVERSITY
COURSE COMPACT
2013/2014 Academic Session
College: College of Science and Technology
Department: CIS/Mathematics
Programme: Industrial Mathematics
Course Code: MAT412
Course Title: Differential Equations II
Units: 3
Course Lecturer: Dr T. A. Anake & Mr. Agoola
Semester: Alpha
Time: Tuesday10-12pm & Thursday 10-11am
Location: Hall 102 /Hall 306
a.
Brief Overview of Course
This course is a continuation of differential equation I. Differential equations II
provides
a higher dimension on our differential equations is applied in the
concept as well as providing a solid insight on various method of solving second
order ODEs and its
applications.
b.
Course Objectives
At the end of the course, student should be able to:
 Find the general solution for homogeneous and non homogeneous
differential equation of second order ODEs.
 Using Laplace to find the general solution of second order ODEs.
 Find the Fourier transforms and its applications.
 Determine the Hankel transforms and its applications.
 Find the general theory of operators.
c.
Methods of Lecturer delivery/Teaching Aids.
-
d.
Guided instructions
Active student participation and interaction
Solution of guided and related problems.
Assignments.
White board and marker
Lecture notes and textbooks
Course Outlines
Module 1:
General Linear ODEs with IVP and BVP
Week One:
Detail treatment of Laplace transforms
Week Two:
Fourier transforms
Week Three:
Tutorials.
Week Four:
Hankel transforms for general solution of IVPs and BVPs
Week Five:
Continuous Assessment
Module 2:
General Theory of operators
Week Six:
Finite dimensional representation of operators
Week Seven:
Diagonalization of operators
Week Eight:
Special theory of function of operators.
Week Nine:
Tutorials
Week Ten:
Continuous Assessment
Module Three:
Continuation of Module Two
Week Eleven:
Differential operators
Week Twelve:
Integral operators
Week Thirteen:
Tutorials.
Week Fourteen:
Tutorials.
e.
Structure of the Programme/Method of Grading
Continuous Assessment:
Test 1
10 marks
Test 2
10 marks
Assignment
10 marks
Examination
70 marks
Total
100 marks
f.
Ground Rules & Regulations
Students are to maintain high level of discipline in the following areas.




g.
Punctuality
Modest Dressing
Quietness
75% lecture attendance for eligibility to semester examination.
Assignment
Students are given assignments at the end of the lecture.
h.
Alignment with Covenant University Vision/Goals
*
Prayers at the commencement of lectures and commitment to God.
*
Classes are conducted with total compliance to the university core values.
*
Course is delivered in a manner that the knowledge acquired is useful and
applicable.
i.
Industry Relevance
Modeled problems in various fields of engineering and some aspect of
sciences require the tool of differential equation to achieve result. Thus, the
relevance cannot be
overemphasize.
 modeling and solving real life problems.
j.
Recommended Reading/Text
6. Advanced Engineering Mathematics by Erwin Kreyszig. (8th Edition)
7. Differential Equations by Schaum. Second Ed.
8. Engineering Mathematics by V. Sundaram, R. Balasubramanian and K. A.
Lakshminarayanan. Volume 2 and Volume 3.
CSC313 COMPUTER PROGRAMMING IV (JAVA) COURSE COMPACT
2013/2014 Academic Session
College: Science and Technology
Department: Computer and Information Sciences
Programmes:
o
B.Sc. Computer Science
o B.Sc. Management Information System
Course Code: CSC 313
Course Title: Computer Programming IV (JAVA)
Units: 3
Course Lecturers: Dr. Omoregbe N. A., Dr. (Mrs) Afolabi & Mrs Oladimeji
Semester: Alpha
o.
Brief Overview of Course
`
p.
Course Objectives/Goals
To understand the relationship between Java and the World Wide Web.
To create, compile, and run Java programs to perform simple calculations.
To understand the Java runtime environment.
To become familiar with Java documentation, programming style, and naming conventions.
To know the rules governing operand evaluation order, operator precedence, and operator
associativity
To learn the concept of method abstraction.
To design and implement methods using stepwise refinement.
To understand Java coordinate systems.
To develop reusable GUI components FigurePanel, MessagePanel, StillClock, and ImageViewer .
To comprehend socket-based communication in Java .
To understand client/server computing and implement Java networking programs using stream
sockets .
To develop servers for multiple clients, and develop applets that communicate with the server
To create applications or applets to retrieve files from the network, and implement Java
networking programs using datagram sockets
o
o
o
o
o
o
o
o
o
o
o
o
o
q.
Methods of Lecture Delivery/Teaching Aids
Lecture Delivery




Interactive classroom session
Group assignments
Lecture notes
Charts and diagrams
Teaching Aids



r.
Use of Computer laboratory to provide a practical understanding of JAVA programming system.
PowerPoint slides
The multimedia projectors
Course Outlines
 Modules & Details of Topics
Module 1: Course Overview
Dr Omoregbe
Week 1: Introduction to JAVA Programming



Review of Object-Oriented programming and software development.
Java programming basics
Anatomy of a Java Program
Module 2: Primitive Data Types and Operations
Selection Statements, Loops & Methods Dr. Afolabi
Week 2 :




,
Data types, Identifiers, Operators and expressions.
Creating Objects and classes
Control Statement: Selection and Repetition;
While, do-while, and for loop statements to control the repetition of statements
Module 3: String processing & Arrays
Week 3:

Declaring Array Variables
Dr Afolabi





Creating Arrays
Indexed Variables
Processing Arrays
Subscripted Variables;
Characters and string processing;
Module 4: Methods
& file processing
Dr Afolabi
Week 4: Methods






Introducing Methods
Calling Methods
Reuse Methods from Other Classes
Call Stacks
Passing Parameters
Overloading Methods
Week 5: File processing


Dr Afolabi
Exception handling
File processing;
Module 5:
Inheritance and Polymorphism
Week 6:





Java classes
Object references
Inheritance.
Polymorphism
Data Abstraction
Module 6:
GUI & Event-Driven Programming Dr Afolabi
Week 7&8





GUI Basics
GUI Objects and event-driven programming;
Handling events:
Event Classes,
The Delegation Model,
Dr Afolabi





Java.awt.event.ActionEvent
Inner Class Listeners
Handling Mouse and Keyboard Events
Document-view architecture, dialog based applications
Database connections
Module 7:
Creating User Interfaces and Applets Dr Omoregbe
Week 9:



Applet wizard,
Combining scripts and Applets,
Applets over webs.
Week 10




Dr Omoregbe
JavaScript ,
Developing Web Applications
HTML pages, Applets and HTML ,
Developing simple web applications.
Module 8:
Multimedia
Dr Omoregbe
Week 11:



Multithreading
Animation techniques
Animating images
Week 12

Project presentations
Week 13.
Revision & Exams
s.
Tutorials
o 2 hours tutorial classes every week.
t.
Structure of the Programme/Method of Grading
(1)
Continuous assessment
(i)
Project & Assignment
30 marks
15%
(ii)
Mid Semester Exam
15%
to
(2)
Examination
70%
====
TOTAL
100%
====
u.
Ground Rules & Regulations
o To seat for the examination, 75% Attendance is required.
o Assignments must be submitted as at when due.
o Contributions to group discussion and class work are noted.
v.
Alignment with Covenant University Vision/Goals
JAVA Programming develops talents to solve industrial problems irrespective of the
implementation platform and location as it works on internet. This impact very many industries
with one single solution developed and deployed without reinventing the will. The “compile once
and run anywhere” attribute of JAVA’s internationalization features provides ease of industry’s
expansion. The students are taught on how to develop applications for international audiences
using resource bundles that could be integrated seamlessly in any environment from world class
students of Covenant University.
w.
Contemporary Issues/Industry Relevance
As organizations worldwide are now over-dependent on Information Technology for their
operations, they require correct software systems in place for reliable performance to remain
competitive. Software systems developed and deployed seamlessly and platform-independently
provide the required comfort. JAVA programming language has become the favourite among other
object-oriented programming languages to make organizations realize their goals. These services
provided by competent programmers with deep understanding of the platform-independent
application development make problem-solving easy. The ability of any student therefore to
comprehend socket-based communication in Java, understand client/server computing, and
implement Java networking programs using stream sockets would put such a student above his/her
peers to remain relevant.
x.
Recommended Reading/Texts
 Liang, Y. Daniel (2007). Introduction to JAVA Programming, 7th Edn (Comprehensive Edn),
Pearson Prentice Hall, ISBN 0131857215 – Main text.
 Deitel & Deitel (2007),. JAVA: How to Program, 7th Edn.
 Morelli, Ralph (2007). JAVA, JAVA, JAVA! Object-Oriented Problem-Solving, 4th Edn, Prentice
Hall, ISBN 0130333700
 Other books on JAVA programming and Web resources are useful.
CSC214 HIGH PERFORMANCE COMPUTING & DATABASE MANAGEMENT COURSE COMPACT
2013/2014 Academic Session
College: Science and Technology
Department: Computer and Information Sciences
Programmes:
o
B.Sc. Computer Science
o B.Sc. Management Information System
Course Code: CSC 214
Course Title: High Performance Computing & Database Management I
Units: 3
Course Lecturers: Dr. (Mrs) Afolabi & Miss Majekodunmi
Semester: Alpha
y.
Brief Overview of Course
This course introduces students to the concept of database management.
z.
o
o
o
aa.
Course Objectives/Goals
To understand high performance computing.
To understand the concept of database management.
To understand how to capture real life information to a standard and efficient database.
Methods of Lecture Delivery/Teaching Aids
Lecture Delivery




Interactive classroom session
Group assignments
Lecture notes
Charts and diagrams
Teaching Aids



bb.
Use of Computer laboratory to provide a practical understanding of database management.
PowerPoint slides
The multimedia projectors
Course Outlines
 Modules & Details of Topics
Module 1: Course Overview
Week 1: Information storage & retrieval





Information management applications
Information capture and representation
Analysis & indexing, search, retrieval.
Information privacy; integrity, security, efficiency and effectiveness.
Module 2: Introduction to database systems
Week 2 :






Overview of Database Systems: model, schema, instance.
System architecture
Database Systems vs. File Systems.
Data abstraction levels, data independence
Database languages
Classification of DBMS and DBMS functions
Module 3: Data modeling: Entity-Relationship(ER) Model
Week 3:






Requirement analysis
Entities and Entity types
Relationship and Relationship type
Constraints.
Weak Entity Types.
ER Diagrams
Week 4:


Semantic object model.
Conceptual database design

Database schema design.
Week 5:

Database normalization
Week 6:

Database normalization
Module 4: Query language and applications
Week 7:

Database query language
Week 8:

Database query language
Week 9:

Database query language
Week 10:

Database application design.
Week 11:


Database application design.
Projects
Week 12:

Project presentations
Week 13.
Revision & Exams
cc.
Structure of the Programme/Method of Grading
(1)
(2)
Continuous assessment
30 marks
(i)
Assignments
& Projects
(ii)
Mid Semester Exam
15%
15%
Examination
70%
====
TOTAL
100%
====
dd.
Ground Rules & Regulations
o To seat for the examination, 75% Attendance is required.
o Assignments must be submitted as at when due.
o Contributions to group discussion and class work are noted.
ee.
Alignment with Covenant University Vision/Goals
Database management develops talents to solve industrial problems irrespective of the
implementation platform and location as it works on internet. This impact very many industries
with one single solution developed and deployed without reinventing the will.
ff.
Contemporary Issues/Industry Relevance
As organizations worldwide are now over-dependent on Information Technology for their
operations, they require correct software systems in place for reliable performance to remain
competitive.
gg.
Recommended Reading/Texts
1. Connolly, T. and C. Begg, “Database Systems: A Practical Approach to Design,
2. Implementation, and Management,” 3rd edition, Addison-Wesley, 2002
3. Philip J. Pratt, “A Guide to SQL,” Sixth Edition, Course Technology, 2003.
4. Rob, P. and C. Coronel, “Database Systems: Design, Implementation, &
5. Management,” 5th edition, Course Technologies, 2002
6. Jeffrey A. Hoffer, Mary B. Prescott, and Fred R. McFadden, (2004). Modern Database
Management, 7th ed., Upper Saddle River, NJ: Prentice Hall. ISBN: 0-13-033969-5
nd
7. Elmasri, Ramez and Navathe B. Shamkant (2000). Fundamentals of Database Systems, 3 ed.,
Addison-Wesley. ISBN: 0-8053-1755-4.
th
8. Date, C. J. (2000). An Introduction to Database Systems, 7 ed., Reading, MA: Addison-Wesley.
ISBN: 0-201-38590-2.
COURSE COMPACT FOR CSC417
College:
Science and Technology
Department: Computer and Information Sciences
Programme(s):
o
B. Sc. Computer Science
CourseCode: CSC417
Course Title:COMPILER DESIGN
Unit:
2
Course Lecturer(s): Dr. O. J. Oyelade
Semester:
Alpha – 2013/2014
Time:
Location:
A.
Hall: Computer Lab
BRIEF OVERVIEW OF THE COURSE
The aim of this course is to build on the introductory material on compiler design presented
in the Languages and Compilers course, dealing with more advanced topics and showing
how the techniques can be used to implement ``real'' compilers. The course assumes some
introductory knowledge of basic programming skills in Java or C and a rudimentary
knowledge of computer architecture.
B.
COURSE OBJECTIVES/GOALS
At the end of the course, students are expected to:



C.
use compiler construction tools to generate lexical and syntax analyzers
understand the key issues in the construction of production of compilers for real high-level
languages and real target machines
understand how a compiler can generate code to make good use of some particular target
machine characteristics
METHOD OF LECTURE DELIVERY/TEACHING AIDS
Lecture delivery
-
D.
Guided instruction
Interaction classroom session
Transparencies
Overhead projection
Multimedia
COURSE OUTLINE
Module 1 Introduction
Week 1 Languages and Translators
Types and role of grammars
Module 2
Compiler structure and design issues
Week 2
Phases of compiler
Compile-time and run time diagnostics
Week 3
Symbol tables and their data structures
Week 4
Symbol tables continue
Module 3
Lexical analysis
Week 5
Token, Pattern and lexemes
Week 6
Operations on language
Regular expression
Week 7
Lexical analysis - review
Mid Term test
Module 4
Systax analysis
Week 8
Introduction
Week 9
Top down methods
LL parser
Week 10
LR parsers
Precedence parsers
Module 5
Intermediate Languages
Week 11
Syntax trees
Quadruples and Post fix notations
Week 12
Intermediate code generation
Instruction selection
Week 13
Revision
E.
TUTORIALS
o
o
o
F.
Review the Lexical analysis such as lexeme, tokens etc.
Review the Syntax analysis such parsing, First and Follow sets etc.
Reviewing of some past questions.
STRUCTURE OF THE PROGRAMME/METHOD OF GRADING
1.
2.
G.
Continuous assessment
40 marks
i.
Assignments/Term paper
10 marks
ii.
Mid-semester exam
20 marks
Examination
70 marks
GROUND RULES AND REGULATIONS
Please note the following:





H.
Mandatory 90% class attendance
No eating in the classroom
Active participation in all activities
All class assignments to be submitted on time
Punctuality to classes to be observed.
TOPICS FOR TERM PAPER/ASSIGNMENT
Students are to be group and each group is expected their term paper on their topic given in the
class.
I.
ALIGNMENT WITH COVENANT VISION/GOALS
Compiler is an intermediary language between the High-level language and the computer.
Therefore,this course is to prepare students on how to build a compiler design and showing
how this technique can be used to implement “real” compiler.
J.
CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
Compiler construction is one of the application courses in the field of Computer Science, especially
in Software development which is an industry based application. It is very relevance and well
applicable in industry because it serves as an intermediary between High-level language and the
computer.
K.
RECOMMENDED READING



Thomas Pittman and James Peters, "The art of compiler design", Prentice-Hall, 1992.
J. Elder, "Compiler Construction: A Recursive Decent Model", Prentice-Hall, 1994.
Aho, Sethi and Ullman, “Compiler: Principles, Techniques and Tools”
Covenant University
College of Science and Technology
Department of Computer and Information Sciences
COURSE CODE:
CSC 312
COURSE TITLE:
Data Structures and Algorithms/ Fundamental of Data
Structure (3 Units)
UNITS:
3
SEMESTER:
COURSE LECTURERS:
A.
Alpha
Dr. Oyelade, O. J. and Mr. Emebo O.
COURSE DESCRIPTION
This course introduces the students to data structures and the designing and analysis of algorithms.
B.
COURSE OBJECTIVES:
At the end of the course, the students should be able to:






C.
Explain what ADTs are and identify the various ADTs;
Implement the various ADTs to be taught;
Identify the various data types that can be used in an application;
Explain what recursion is and implement any recursive function;
Explain how the different searching and sorting algorithms work and implement them;
Analyze any given algorithm.
METHOD OF TEACHING/TEACHING AIDS:
Lecture Delivery
 The use of overhead projector for teaching
Teaching Aids:

Use of computer to show how the various algorithms can be implemented.
D.
COURSE OUTLINE
Module 1:
Data Types
Week 1: Bits, Bytes, Word, Integer, Floating Point Numbers, Characters, Boolean type, Pointer, Array,
Record, String, Class & Objects.
Module 2:
Trees
Weeks 2-3: Binary Trees, Binary Tree Traversal, Binary Search Tree, Insertion and Deletion, Building Binary
Trees. Height Balance, Multiway Trees, Polish Notation. Comparison Trees.
Module 3:
Stacks, Queues and List
Weeks 4 – 5: Stacks, Queues, List and Implementation.
Module 4:
Recursion and Polynomial Arithmetic
Week 6: Recursion and its implementation. Polynomial Arithmetic
Mid-Semester Examination
Module 5:
Searching and Sorting
Weeks 7-10: Sequential Search, Binary Search, Insertion Sort, Selection Sort, Shell Sort, Quicksort,
Mergesort, radix Sort and Heapsort. Big O notation, Analysis of the sorting and searching techniques.
Module 6:
Graphs and Polynomial Arithmetic
Weeks 11 – 12: Graph ADT, Graph Traversal: Depth-First and Breadth-First. Shortest Paths, Best-first,
uniform cost traversal. Polynomial Arithmetic
E.
METHOD OF GRADING:
Assignment – 10marks
Test – 10 marks
Mid-Semester Exam. – 20 marks
Semester Exam. – 60 marks.
F.
CLASS BEHAVIOUR:





G.
90% attendance compulsory
Eating in the class will not be tolerated
Students are expected to ask questions in class, consult the recommended textbooks and write
programs in any language of their choice to implement assignments
Late coming to the class will not be tolerated
Programming assignments must be done and submitted when due.
TOPICS FOR ASSIGNMENTS
The students will be expected to write, run and defend programs to solve problems on the following topics:



Recursion
Insertion Sort, Selection Sort
List, Queue and Stack
Note: Plagiarism is a serious offence. If in doubt, consult your lecturer.
RECOMMENDED READING:



Thomas H. Cormen, Charles E. Laiserson, Ronald I. Rivest and Clifford Stein (2003), Introduction to
Algorithms, MIT Press.
Sartaj Sahni (2000), Data Structures, Algorithms and Application in Java, McGrawHill.
C. Thomas Wu (2004), An Introduction to Object-Oriented Programming with Java, McGrawHill
COVENANT UNIVERSITY
COURSE COMPACT
2012/2013 Academic Session
College:
Science & Technology
Department:
Computer & Information Sciences
Course Code:
CSC 413
Course Title:
Algorithm Analysis
Units:
2 units
Course Lecturer(s): Dr. Oyelade, O. J. and Dr. Oluwagbemi, O. O.
Semester:
Alpha
Time:
Location:
A. Brief overview of course
This course is designed to expose the students to analyzing and designing efficient computer
algorithms, subsequently various approaches of achieving this will be taught.
B. Course Objectives/Goals
At the end of this course, students are expected to:
o
o
o
Understand the basic approaches to analyzing algorithms.
Exposed to mathematical tools for analyzing algorithms.
Able to design efficient and optimal algorithms.
C. Methods of Lecture delivery/Teaching Aids
Lecture Delivery
o Guided instruction
o Classroom interactive sessions
o Students’ practical work
o Seminar presentations
Teaching Aids
o Transparences
o Public Address System
o Multi-media projector
o Software tools
D. Course Outlines
Module 1: Introduction
Week 1: Time and space complexity; algorithmic paradigms; problem classes.
Module 2: Mathematical Tools
Week 2: Growth rates of sample functions; o, w, q- notation; properties of logarithms;
summing sequences; binomial coefficients; factorials; harmonic numbers; generation functions.
Module 3: Recurrence Equations
(Oyelade, O. J.)
Week3: linear first order recurrence equations; linear second order recurrence equations.
Week4: The Tower of Hanoi; Fibonacci numbers; and other applications of recurrence
equations
Module 4: Divide and Conquer Algorithms
Week 5: Binary search; max-min problem; fast integer multiplication; strassen's matrix
multiplication; common general form for recurrence equations.
Module 5: Sorting Algorithms
(Oluwagbemi, O.O.)
Week 6: Insertion sort, selection sort, bubble sort; merge sort, quick sort, heapsort;
shellsort; counting sort; radix sort; bin sort.
Module 6: Searching Algorithms
Week 7 :Sequential searching; Aho-Corasick algorithm; Knuth-Morris-Prat
algorithm; Rabin-Karp algorithm; Boyer-Moore algorithm; hash tables.
Module 7: Graph Algorithms
(Oyelade, O. J.)
Week 8: Depth-first and breadth-first search;
Week 9: Kruskal's and Prim's algorithms (minimal spanning tress); Dijkstra's
algorithm; euler circuits; hamiltonian circuits;
Week 10: topological sorting; connectivity; colouring.
Module 8: Greedy Algorithms
Week 11: Knapsack problem, Huffman codes
Module 9: Linear/Dynamic Programming
(Oluwagbemi O. O.)
Week 12: Simplex Algorithm, Matrix Chain Mult., Optimal Binary Search
Week 13: Revision and Evaluation
Tutorials
-
Review of features of an efficient algorithm.
Practicals on analyzing algorithms (Time and space complexity)
Applications of searching and sorting algorithms to real life problems
E. Structure of the Programme/Method of Grading
- Continuous Assesment
o Class test/Quiz/Assignments
10 Marks
-
o Mid Semester test
Examination
20 Marks
70 Marks
F. Ground Rules & Regulations
- 80% Attendance is required to seat for the examination.
- Assignments must be submitted at deadlines.
- Contributions to group discussion and class work are noted and graded
G. Topics for term papers/Assignments/Students Activities
This will be given during the lecture: implementation in C++
H. Alignment with Covenant University Vision/Goals
I.
Contemporary issues/Industry Relevance
J.
Recommended Reading/Text
i.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein –
“Introduction to Algorithms” 2nd Edition MIT Press ISBN0-262-03293-7, McGrawHill Book Company ISBN 0-07-013151-1
ii.
AHQ, KOPCROFT,ULLMAN – “The Design and Analysis of Computer Algorithms”
Addison-Wesley Publishing Company ISBN 0-201-00029-6
iii.
Donald E. Knuth – “The Art of Computer Programming vol 1 Fundamental
Algorithms” 3rd Edition ISBN 0-201-89683-4
COVENANT UNIVERSITY
COURSE COMPACT
2013/2014 Academic Session
College: Science and Technology
Department: Mathematics
Programme: Industrial Mathematics
Course Code: MAT 413
Course Title: Introduction to Probability theory and Stochastic Processes
Units: 3
Course Lecturer: Dr. (Mrs) S. Bishop and Mr. E.A. Owoloko
Semester: Alpha
Time: Monday, 8 am – 10 am and Wednesday, 3pm -4pm
Location: Room 306 & 208, CST Building.
A. BRIEF OVERVIEW OF COURSE
Probability theory is introduced in this course as a foundation and tool for analysing
and measuring random events. The theory and application of stochastic processes
is discussed in the way that students can quantify the dynamics relationships of
random events
B. COURSE OBJECTIVES/GOALS
At the end of the course, students should be able to:
i.
Understand the concept of probability as a measure
ii.
Identify convergence methods in probability theory
iii.
Recognize and classify Stochastic Processes in the sciences
iv.
Illustrate the rich diversity of applications of stochastic processes
C. METHOD OF DELIVERY /TEACHING AIDS

Guided Instructions

Class Activity

Assignments

White board and marker
D. COURSE OUTLINE
Module 1: Introduction to Probability theory
Review of elementary probability, random variables, probability measure, probability
spaces and probability distributions.
Module 2: Probability theory
Expectation, moments, generating functions, methods of convergence, convolutions
and compound distributions.
Module 3: Introduction to stochastic processes
Definition of stochastic processes, types of stochastic processes.
Module 4: Some stochastic processes and their applications
Markov chains, random walk, branching processes and their applications.
E. TUTORIALS
Tutorials will be given at the end of the course.
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Continuous Assessment:
Test 1
10 marks
Test 2
20 marks
Assignment
10 marks
Examination
60 marks
Total
100 marks
G. GROUND RULES & REGUKATIONS

No eating in the class

Punctuality to classes

No use of i-pods in the class

Dress code must be correctly adhered to

75% required for eligibility to semester examination.
H. TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITY
Assignment and term papers will be given as the course progresses..
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS

Classes are conducted in such away that the university core values are
observed and respected.

Course is delivered in a manner that the knowledge acquired is useful and
applicable.
J. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
Course is relevant for modelling in banking, finance and risk management,
engineering, telecommunication, biology, etc.
K. RECOMMENDED READING/TEXT
Cox, D. R. and Miller, H. D. (1992). The Theory of Stochastic Processes.
London.Chapman & Hall.
Kannan, D. (1978 ). An introduction to Stochastic processes. New York.
North Holland.
Karlin, S. and Taylor, H. M. (1975). A First Course in Stochastic Processes,
(2nd ed). New York. Academic Press
Papoulis, A. (1965). Probability, Random variables and Stochastic processes.
New York. McGraw-Hill Publishing Company Inc.
Taylor, H. M. and Karlin, S. (1998). An Introduction to Stochastic Modelling, (3rd ed).
San Diego, California. Academic Press.
COVENANT UNIVERSITY
COURSE COMPACT
2012/2013 Academic Session
College: Science and Technology
Department: Mathematics
Programme: Industrial Mathematics
Course Code: MAT 318
Course Title: Statistical Inference
Units: 2
Course Lecturer: Owoloko, E.A. (Mr.)
Semester: Alpha
Time: Thursday, 8am – 10am.
Location: Room 313 CST Building.
A. BRIEF OVERVIEW OF COURSE
Scientific methods require investigations and daily experiments and inference taken
about a population from a sample space. This course is designed to teach the
process of conducting meaningful and unbiased methods of conducting
experiments and the best way to take a decision about a population based on the
decision taken on a sample space.
B. COURSE OBJECTIVES/GOALS
At the end of the course, students should be able to:
i.
Use various statistical tests.
ii.
Differentiate between parametric and non-parametric test
iii.
Apply statistical analysis to real life problems.
C. METHOD OF DELIVERY /TEACHING AIDS

Guided Instructions

Class Activity

Assignments

White board and marker
D. COURSE OUTLINE
Module 1: Parametric statistics
Week 1: principle and methods of estimation.
Week 2&3: Point estimations; methods of moments.
Week 4: Maximum likelihood method.
Week 5: Interval Estimation.
Week 6&7: Principle of hypothesis testing.
Week 8: Introducing the various parametric tests- chi, t, F
Week 9: Analysis of variance.
Module 2: Non-parametric Statistics
Week 10: Introducing the non – parametric test. Definition and concepts.
Week 11: The Sign and median test.
Week 12: Walcoxon two sample rank and the Kruskal – wallis tests.
Week 13: Revision.
Week 14: Examination.
E. TUTORIALS
Tutorials will be given at the end of the course.
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Continuous Assessment:
Mid-semester test
20 marks
Assignment
10 marks
Examination
70 marks
Total
100 marks
G. GROUND RULES & REGULATIONS

No eating in the class

Punctuality to classes

No use of i-pods in the class

Dress code must be correctly adhered to

75% required for eligibility to semester examination.
H. TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITY
Assignment and term papers will be given as the course progresses.
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS

Classes are conducted in such away that the university core values are
observed and respected.

Course is delivered in a manner that the knowledge acquired is useful and
applicable.
J. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
Course is relevant for planning, allocation of resources and predictions.
K. RECOMMENDED READING/TEXT
Mood, A.M., Graybill, F.A., and Boes D.C. (2004). Introduction to the theory of
statistics .
Spiegel, M. R. and Stephens, L. J. (2004). Schaum’s Outline Series of Theory and
Problems of Statistics.
COVENANT UNIVERSITY
COURSE COMPACT
2009/2010 Academic Session
College: Science and Technology
Department: Mathematics
Programme: Industrial Mathematics
Course Code: MAT 314
Course Title: Operation Research
Units: 2
Course Lecturer: Owoloko, E.A. (Mr.) and Adeleke, O. J
Semester: Alpha
Time: Wednesday, 8am – 10am.
Location: C35 Chemical Building.
A. BRIEF OVERVIEW OF COURSE
The relevance of OR in present day dynamic environment cannot be over
emphasized. Scientific methods are required to investigate and solve its complex
problems in order to make rightful decisions. This course is to bring to fore the
various decision techniques needed by the students in today’s dynamic
environment.
B. COURSE OBJECTIVES/GOALS
At the end of the course, students should be able to:
ii.
Know the relevance of operation research to present day society.
ii.
Formulate and classify the various operation research models.
iii.
Use the simplex algorithm in solving linear programming problems.
C. METHOD OF DELIVERY /TEACHING AIDS

Guided Instructions

Class Activity

Assignments

White board and marker
D. COURSE OUTLINE
Module 1: Linear programming
Week 1: Phases of operations research study.
Week 2&3: Linear programming model. Formulation of model from word problems.
Week 4: Graphical solution to linear programming model.
Week 5: Introduction to the simplex algorithm
Week 6&7: Solving problems using the simplex algorithm – maximization and minimization
cases.
Week 8&9: Inventory Model
Week 9&10: Decision Theory
Module Other OR models
Week 10: Integer programming
Week 11: Dynamic programming
Week 12: Critical path analysis and project control.
Week 13: Revision.
Week 14: Examination.
E. TUTORIALS
Tutorials will be given at the end of the course.
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Continuous Assessment:
Mid-semester test
20 marks
Assignment
10 marks
Examination
70 marks
Total
100 marks
G. GROUND RULES & REGULATIONS

No eating in the class

Punctuality to classes

No use of i-pods in the class

Dress code must be correctly adhered to

75% required for eligibility to semester examination.
H. TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITY
Assignment and term papers will be given as the course progresses.
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS

Classes are conducted in such away that the university core values are
observed and respected.

Course is delivered in a manner that the knowledge acquired is useful and
applicable.
J. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
Course is relevant for planning, allocation of scarce resources.
K. RECOMMENDED READING/TEXT

Principles of Operations Research with Application to Managerial Decisions. By
Harvey M. Wagner.

Operations Research. By Taha.
COVENANT UNIVERSITY
COURSE COMPACT
2013/2014 Academic Session
College: Science and Technology
Department: Mathematics
Programme: Industrial Mathematics
Course Code: MAT111
Course Title: Algebra
Units: 3
Course Lecturer: Owoloko, A.E. & Dr. Agarana, M.C
Semester: Alpha
Time: Tuesday, 12-2pm and Thursday, 5-6pm
Location: LT 1
A. BRIEF OVERVIEW OF COURSE
The fundamental concepts of algebra are introduced to the students. The topics
taught in this course are topics expected to be mastered by students in the
Sciences, Engineering and the Social Sciences. This course is the ‘building blocks’
on which other higher mathematical concepts are built upon.
B. COURSE OBJECTIVES/GOALS
At the end of the course, students should be able to:

Identify special sets ( N  Z  Q  R  C ) and their meanings as it applies to
other mathematical concepts.

State the various laws of topics to be taught and solve problems related to
these topics.

Relate their understanding of topics taught in this course to other
mathematical related courses.
C. METHOD OF DELIVERY /TEACHING AIDS

Guided Instructions

Class Activity

Assignments

Electronic White Board
D. COURSE OUTLINE
Module 1: Basic Algebra
Week 1: Basic definition of set and concept and set properties.
Week 2: Special set; Theory of indices and properties of indices, indicial equations.
Week 3: Law of logarithm. Definition and Concepts. Surdic equation.
Week 4 &5:Inequalities. Definitions and concept. Solving quadratic and cubic
inequalities.
Week 6&7: Polynomials, the remainder and factor theorems. Quadratic equation, domain
and roots of rational functions and partial fraction.
Module 2: Applied Algebra
Week 8&9: Introduction to MxN matrices; elementary properties on matrices and
application to solution of linear equations. Elementary properties of determinants of at
most 3x3 matrices. The rule of Sarrus.
Week 10: Permutation & Combination; The binomial theorem for any index and
applications.
WeeK 11: Sequences and Series of real numbers.
Week 12: Algebra of complex numbers.
Week 13: Revision / Tutorials
Week 14: Examination.
E. TUTORIALS
Tutorials will be given at the end of the course.
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Continuous Assessment:
Assignment
10 marks
Mid-Semester test
20 marks
Examination
70 marks
Total
100 marks
G. GROUND RULES & REGULATIONS

Punctuality to Class.

No use of laptop, i-pods and other electronic devices in the class.

Dress code must be correctly adhered to.

75% attendance required for eligibility to semester examination.

No eating in the class.
H. TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITY
Assignment will given as the course progresses
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS

Classes are conducted in such away that the university core values are
observed and respected.

Course is delivered in a manner that the knowledge acquired is useful and
applicable.
J. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
The importance of basic mathematics in industry cannot be over emphasized.
K. RECOMMENDED READING/TEXT
1. Bunday, B.D. and Mulholand, H. (1983). Pure Mathematics for Advanced level.
2. Blakey, J. (1983). Intermediate Pure Mathematics.
3. Ho Soo Thong et al. (2002). College Mathematics. Nigeria.
4. Backhouse et al (2002). Pure Mathematics.
CONVENANT UNIVERSITY
FOMAT FOR COURSE COMPACT
2013/2014 ACEDEMIC SECTION.
2013/2014 Alpha Semesters
CST 111: Computer Application I
(2 Unit)
(L10: T0: P15)
Identification of PC parts and peripheral devices: functions, applications, and how to use them. Safety precautions.
Procedure for booting a PC. Filing system: directory, sub-directory, file, path, and how to locate them. Word
processing: principle of operation, application, demonstration and practical hand-on exercises in word processing
using a popular word processing package. Internet: services available, principle of operation, application,
demonstration and hand-on practical exercises on e-mail and www using popular browsers.
College: College of Science and Technology.
Department: Computer and Information Science
Programme: All Programme-college wide
Course: CST 111
Course Title:
Unit: 2 units
Course Lecture(s): Dr. N. A. Omoregbe, Mrs. M.O Adebiyi, Mr. Eweoya, Miss Marcus and
Mr. Ajieh
Time: 1pm-3pm (Monday)
Location: LT 1
1. Brief overview of course
Identification of PC parts and peripheral devices, functions, application and how to use them, safety
precaution, procedures for booting a PC. Filing system, directory, sub directory, file, path, and how to
locate them, word processing, principal of operation, application, demonstration and practical exercise
on e-mail and www. Using popular browsers.
2. Course objectives/ goals
At the end of this course the student should be able to identify all PC parts and
peripherals, observe safety precautions, differentiate between system and application
software with window XP, Microsoft DOS, Microsoft office package.
3. Method of lecture delivery/ teaching aids.
 Lecture delivery methods
a. Very interactive class section
b. Discussion method
 Teaching aids
a. Parts of computer (hardware/ mouse, printer, keyboard, monitor, CPU e.g.
4. Course outlines.
 Modules and details of topic.
No
Lecturer
Topic
Week
1.
Dr. N. Omoregbe
Identification of PC parts and
peripheral devices: functions,
applications, and how to use
them; Safety precautions.
Procedure for booting a PC
2
2.
Mrs. M. Adebiyi
Filing system: directory, subdirectory, file, path, and how to
locate them.
3
Internet: services available,
principle of operation, application,
demonstration and hand-on
practical exercises on e-mail and
www using popular browsers.
3.
Mrs. Adebiyi
MS Windows: Components of a
window, Menus, Mouse basics,
Start menu, Customizing windows
desktop
4
4.
Mr. Ajieh
Working with programs,
organizing files and folders in
windows, Windows keyboard
shortcuts
5
5.
Mr. Eweoya
Word processing: features of word
processing packages: Microsoft
Word (MS Word) and its principle
of operation. MS Word: using the
File, Edit and View menu; using
the Insert, Format, and Tools
commands; using the Table,
6
Window, and Help commands.
6.
Miss. Marcus, Mr.
Ajieh & Mr. Eweoya
Practical hands-on exercises in
word processing using a popular
word processing package (MS
Word)
Mid-Semester Exam
Hand over to Library
Semester Exam
7
9
8 – 14
15
5. Tutorials.
6. Structure of the Programme / method of grading
 Continuous assessment
a. Attendance-100
b. Mid Semester/ Practical-20
c. Assignment-10
 Examination-60 mark
7. Ground rules and regulations




No late coming (10 minute of grace after class begins)
Most abide by school dressing code
Most sit with your mate at the allocated sit
Most respond promptly to questions in class
8. Topics for term papers/ assignment/student activities
9. Alignment with covenant university vision/goal
10. Contemporary issues/ industry relevance
 Use of computer skills both soft ware and hard ware cannot be over emphasized in the
Nigerian industry.
11. Recommended reading/text
 Fundamental of Computer Application by c.k Ayo, Ikhu omoregbe, Osamor and Marion
Adebiyi
 Computer application packages by c.k Ayo, Ikhu omoregbe, Osamor and Ekong
CSC313 COMPUTER PROGRAMMING IV (JAVA) COURSE COMPACT
2013/2014 Academic Session
College: Science and Technology
Department: Computer and Information Sciences
Programmes:
o
B.Sc. Computer Science
o B.Sc. Management Information System
Course Code: CSC 311
Course Title: Computer Programming IV (JAVA)
Units: 3
Course Lecturers: Dr. Omoregbe N. A., Dr. (Mrs) Afolabi & Mrs Oladimeji
Semester: Alpha
hh.
Brief Overview of Course
This course introduces students to object-oriented programming paradigm with JAVA programming
language.
ii.
Course Objectives/Goals
To understand the relationship between Java and the World Wide Web.
To create, compile, and run Java programs to perform simple calculations.
To understand the Java runtime environment.
To become familiar with Java documentation, programming style, and naming conventions.
To know the rules governing operand evaluation order, operator precedence, and operator
associativity
To learn the concept of method abstraction.
To design and implement methods using stepwise refinement.
To understand Java coordinate systems.
To develop reusable GUI components FigurePanel, MessagePanel, StillClock, and ImageViewer .
To comprehend socket-based communication in Java .
To understand client/server computing and implement Java networking programs using stream
sockets .
To develop servers for multiple clients, and develop applets that communicate with the server
To create applications or applets to retrieve files from the network, and implement Java
networking programs using datagram sockets
o
o
o
o
o
o
o
o
o
o
o
o
o
jj.
Methods of Lecture Delivery/Teaching Aids
Lecture Delivery




Interactive classroom session
Group assignments
Lecture notes
Charts and diagrams
Teaching Aids



kk.
Use of Computer laboratory to provide a practical understanding of JAVA programming system.
PowerPoint slides
The multimedia projectors
Course Outlines
 Modules & Details of Topics
Module 1: Course Overview
Dr Omoregbe
Week 1: Introduction to JAVA Programming



Review of Object-Oriented programming and software development.
Java programming basics
Anatomy of a Java Program
Module 2: Primitive Data Types and Operations
Selection Statements, Loops & Methods Dr. Afolabi
Week 2 :




,
Data types, Identifiers, Operators and expressions.
Creating Objects and classes
Control Statement: Selection and Repetition;
While, do-while, and for loop statements to control the repetition of statements
Module 3: String processing & Arrays
Week 3:




Declaring Array Variables
Creating Arrays
Indexed Variables
Processing Arrays
Dr Afolabi


Subscripted Variables;
Characters and string processing;
Module 4: Methods
& file processing
Dr Afolabi
Week 4: Methods






Introducing Methods
Calling Methods
Reuse Methods from Other Classes
Call Stacks
Passing Parameters
Overloading Methods
Week 5: File processing


Dr Afolabi
Exception handling
File processing;
Module 5:
Inheritance and Polymorphism
Week 6:





Java classes
Object references
Inheritance.
Polymorphism
Data Abstraction
Module 6:
GUI & Event-Driven Programming Dr Afolabi
Week 7&8








GUI Basics
GUI Objects and event-driven programming;
Handling events:
Event Classes,
The Delegation Model,
Java.awt.event.ActionEvent
Inner Class Listeners
Handling Mouse and Keyboard Events
Dr Afolabi


Document-view architecture, dialog based applications
Database connections
Module 7:
Creating User Interfaces and Applets Dr Omoregbe
Week 9:



Applet wizard,
Combining scripts and Applets,
Applets over webs.
Week 10




Dr Omoregbe
JavaScript ,
Developing Web Applications
HTML pages, Applets and HTML ,
Developing simple web applications.
Module 8:
Multimedia
Dr Omoregbe
Week 11:



Multithreading
Animation techniques
Animating images
Week 12

Project presentations
Week 13.
Revision & Exams
ll.
Tutorials
o 2 hours tutorial classes every week.
mm.
Structure of the Programme/Method of Grading
(1)
Continuous assessment
30 marks
(i)
Project & Assignment
15%
(ii)
Mid Semester Exam
15%
to
(2)
Examination
70%
====
TOTAL
100%
====
nn.
Ground Rules & Regulations
o To seat for the examination, 75% Attendance is required.
o Assignments must be submitted as at when due.
o Contributions to group discussion and class work are noted.
oo.
Alignment with Covenant University Vision/Goals
JAVA Programming develops talents to solve industrial problems irrespective of the
implementation platform and location as it works on internet. This impact very many industries
with one single solution developed and deployed without reinventing the will. The “compile once
and run anywhere” attribute of JAVA’s internationalization features provides ease of industry’s
expansion. The students are taught on how to develop applications for international audiences
using resource bundles that could be integrated seamlessly in any environment from world class
students of Covenant University.
pp.
Contemporary Issues/Industry Relevance
As organizations worldwide are now over-dependent on Information Technology for their
operations, they require correct software systems in place for reliable performance to remain
competitive. Software systems developed and deployed seamlessly and platform-independently
provide the required comfort. JAVA programming language has become the favourite among other
object-oriented programming languages to make organizations realize their goals. These services
provided by competent programmers with deep understanding of the platform-independent
application development make problem-solving easy. The ability of any student therefore to
comprehend socket-based communication in Java, understand client/server computing, and
implement Java networking programs using stream sockets would put such a student above his/her
peers to remain relevant.
qq.
Recommended Reading/Texts
 Liang, Y. Daniel (2007). Introduction to JAVA Programming, 7th Edn (Comprehensive Edn),
Pearson Prentice Hall, ISBN 0131857215 – Main text.
 Deitel & Deitel (2007),. JAVA: How to Program, 7th Edn.
 Morelli, Ralph (2007). JAVA, JAVA, JAVA! Object-Oriented Problem-Solving, 4th Edn, Prentice
Hall, ISBN 0130333700
 Other books on JAVA programming and Web resources are useful.
Covenant University
Course Compact
2013/2014 Academic Session
College:
Department:
Programme:
Course Code:
Course Title:
Unit:
Course Lecturers:
Semester:
Science and Technology
Computer and Information Sciences Department
Computer Science
CSC 216
Foundations of Sequential and Parallel Programming
2
Dr. Oyelami and Mr. Oluranti Jonathan
Alpha
Time & Location:
h) Brief Overview of Course/Description
This course introduces the relationships between High level languages and the
Computer Architecture that underlies their implementation: It also discusses basic
machine architecture; assembler specification and translation of programming language
block structured languages and parameter passing mechanisms.
i) Course Objectives/Goals
At the end of this course, students are expected to:

have a good understanding of computer architecture.

have a good understanding of the relationship between high level languages and
computer architecture.

have a good understanding of the concept of sequential and parallel
programming.
j) Method of Lecture Delivery/Teaching Aids
 PowerPoint presentations of lecture notes
 Tutorials for students
 Assignments, class work and good examples will also be used
k) Course Outlines
Module 1
Week1 Introduction to the course
Week 2-3

Basic computer architecture (basic machine architecture), assembler specification and
translation of programming language block structured languages.
Week 4

High Level Languages /C Language
Module 2
Week 5

Sequential programming
Week 6

Sequential programming practical applications
Week7

Parallel programming
Week 8

Mid-Semester Examination
Week 9

Parallel programming practical applications
Week 10

Comparing sequential and parallel programming.
Module 3

Week 11 & 12
The relationships between high level languages and the computer architecture as regards
assembler specification and translation of programming language block structured languages,
and parameter passing.
l) Structure/Method of Grading
 Continuous Assessment (CA)
- Mid Semester Test - 15%
-
2 Assignments, 3 quizzes (3 marks each) – 15%
 Examination – 70%
m) Ground Rules/Class Behavior
 Students are expected to participate during the lectures
 Punctuality to class very important
 Mandatory 75% attendance
 All assignments must be submitted as required
n) Recommended Reading/Texts

Concurrent Programming, A. Burns and G.Davies, Addison-Wesley, 1993

Computer Architecture: A Quantitative Approach by John L. Hennessy, David A. et al

Programming with C, Second Edition by Schaum’s Outline

Andrews (2000), Foundations of Multithreaded, Parallel and Distributed Programming,
Addison Wesley.

Lea (2000), Concurrent Programming in Java: Design Principles and Patterns, (2nd Edition),
Addison Wesley.

Goetz et al. (2006), Java concurrency in practice, Addison-Wesley

Ben-Ari (1982), Principles of Concurrent Programming, Prentice Hall.

Andrews (1991), Concurrent Programming: Principles & Practice, Addison Wesley.

Burns & Davis (1993), Concurrent Programming, Addison Wesley.

Magee & Kramer (1999), Concurrency: State Models and Java
COVENANT UNIVERSITY
COURSE COMPACT
2013/2014 Academic Session
College:
Science and Technology
Department:
Computer and Information Sciences
Programme:
B.Sc. Computer Science
Course Code:
CSC 315
Course Title:
Computer Architecture and Organization
Units:
2
Course Lecturers: Dr. Azeta A. A. & Mr. Oluranti
Semester:
Time:
Location:
Alpha
Tuesday 10 – 11 am & Wednesday 8 – 10 am.
Hall 308
rr.
Brief Overview of the Course
This course involves teaching of number systems, organization and architecture of modern computer systems as well as
writing of assembly language programs.
The aim is to expose students to the design and internal working of computer systems.
ss.
Course Objectives/Goals
At the end of this course, students are expected to:



tt.
be able to explain how numbers are represented in the computer memory;
be able to explain the architecture and organization of modern computer systems;
be able to program the computer system using Assembly Language.
Methods of Lecture Delivery/Teaching Aids
Lecture Delivery



Interactive classroom session
Group assignments
Lecture notes
 Charts and diagrams
Teaching Aids

Use of Computer laboratory to provide a practical understanding of computer architecture.
 Microsoft PowerPoint slides
 Transparences

Multimedia projector
d. Course Description
Data representation and Number bases. Binary/Octal/Hex Number Systems. Binary Arithmetic.
Other Codes: BCD, Excess-3, Gray, ASCII, EBCDIC. Signed numbers. 2's complement Addition &
subtraction. Multiplications and Division. BCD addition. Integer representation, Integer arithmetic,
Fixed and Floating-Point systems. Boolean Algebra: Basic circuits and theorems; Boolean
expressions; Truth tables, Logic gates and realization of Boolean functions. Fundamental building
blocks, logic expressive immunization, sum of product forms. Register transfer notation. Physical
considerations. Representation of memory systems organization and architecture. The Instruction
Cycle, Instruction Pipelining, The Intel Pentium and Motorola PowerPC processors, Microoperations. Advanced Computer Architecture: Reduced Instruction Set Architecture, RISC
Pipelining, The RISC versus CISC Controversy, Assembly language programming of 32 bit
INTEL and 32 bit MOTOROLA processors, programming model, addressing modes, instruction
set, data types, operation types, instruction formats, instruction groups.
m. Course Outlines
 Modules & Details of Topics
Module 1: Introduction
Mr. Oluranti/Dr. Azeta
Week 1 An Introduction to the following:
Course Outline, a general review.
The course lecturers.
Textbooks and reference materials.
Number Systems
Module 2:
Module 3:
Number Systems
Mr. Oluranti
Week 2
Data representation and Number bases. Binary/Octal/Hex Number
Systems. Binary Arithmetic. Other Codes: BCD, Excess-3, Gray, ASCII,
EBCDIC. Signed numbers. 2's complement .Addition & subtraction.
Multiplications and Division
Week 3
BCD addition. Integer representation, Integer arithmetic, Fixed and
Floating-Point systems
Boolean Expression & Logic Gate
Mr. Oluranti
Week 4 Boolean Algebra: Basic circuits and theorems; Boolean expressions;
Truth tables, Logic gates and realization of Boolean functions.
Week 5 Fundamental building blocks, logic expressive immunization,
sum of product forms.
Module 4:
Processor Organisation
Mr. Oluranti
Week 6 Register transfer notation. Physical considerations. Pentium
and PowerPC Evolution.
Week 7 Representation of memory systems organization and architecture.
Module 5:
Instruction Circle
Dr. Azeta
Week 8 The instruction circle, Instruction Pipelining.
The Intel Pentium and Motorola PowerPC processors.
Week 9 Micro Operations
Module 6:
Advanced Computer Architecture
Week 10
Dr. Azeta
Reduced Instruction Set Architecture, RISC Pipelining.
The RISC versus CISC Controversy.
Module 7:
Assembly Language
Week 11
Dr. Azeta
Assembly language programming of 32 bit INTEL and 32 bit
MOTOROLA processors, programming model.
Week 12
Addressing modes, instruction set, data types, operation types,
instruction formats, Instruction group
Module 8
Week 13
Tutorial/Revision
Dr. Azeta/Mr. Oluranti
n.
Tutorials
o Review of Number systems
o Boolean expression & logic gate
o Processor organization
o RISC and CISC Pipelining
o Assembly language Programming
o.
Structure of the Programme/Method of Grading
(1)
(2)
Continuous assessment
30 marks
(i)
Assignments
10%
(ii)
Mid Semester Exam
20%
Examination
70%
====
TOTAL
100%
====
p.
Ground Rules & Regulations
o To sit for the examination, 75% Attendance is required.
o Assignments must be submitted as at when due.
o Contributions to group discussion and class work are noted.
q.
Topics of Term Papers/Assignment/Student Activities
o
o
o
o
Representation of data in the computer memory
Development of theorems of Logic gates
Compare and contrast RISC and CISC processor
Programming in Assembly language
r.
Alignment with Covenant University Vision/Goals
Understanding the principles behind the design of a computer system is a major step in building a
computer system. This course will expose the students to the computer hardware so as for them to
know how software and hardware work together and most importantly, it will give them a
foundation to build on in case they want to specialize in hardware in the future, which can make
them self-employed.
s.
Contemporary Issues/Industry Relevance
As a result of the competitive nature of most businesses, organizations require competent IT
personnel with an understanding of the internal working of computer systems to provide effective
IT support services. Consequently, skilled programmers that have adequate hardware skills will be
at an advantage.
t.
Recommended Reading/Texts
Chalk B. S. (2004), Computer Organisation and Architechure An Introduction
Bartee, T. C. (1991), Computer Architecture and Logic Design
(McGraw-Hill International editions).
Dowsing R. D. et al (2000), Computers from logic to architecture
2nd Edition, (Mcgraw-Hill Companies)
Stallings W. (2003), Computer Organisation and Architecture
(Designing for performance) Sixth Edition.
Tanenbaum A. S. (2006), Structured Computer Organisation, fifth edition, Pearson Prentice Hall.
John P. Hayes (1998), Computer Architecture and organization
Mcgraw-hill international edition.
Mark D. Hill, Norman P. Jouppi Gurindar S. Sohl (2000), Readings in computer architecture.
M. Morris Mano, Computer System Architecture 3rd edition, Prentice Hall.
John L. Hennessy & David A. Patterson (2003), Computer Architecture, A Quantitative Approach. 3rd edition,
Morgan Kaufmann Publishers.
Miles J. Murdocca & Vincent P. Heuring (2000), Principles of Computer Architecture, Prentice-Hall, Inc.
R. D. Dowsing, F. W. D. Woodhams & I. Marchall (2000), 2nd edition, Computers from Logic to Architecture.
The McGraw-Hill Companies.
Dezso Sima, Terence Fountain & Peter Kacsuk, (1997) Pearson Education, Advanced Computer
Architectures, A design space Approach. Pearson Education.
ALPHA COURSE COMPACT
COLLEGE:
College of Science and Technology
DEPARTMENT:
Computer Science and Information Sciences
PROGRAMME:
Computer Science
COURSE CODE:
CSC 418
COURSE TITLE:
Fuzzy Logic
UNITS:
2
COURSE LECTURERS: Dr. (Mrs.) Oladipupo, O.O. & Mr. Oluranti Jonathan
SEMESTER:
TIME:
Alpha 2013/2014
10-12am, Wednesdays
LOCATION: CST Hall 201
BRIEF OVERVIEW OF THE COURSE
Fuzzy logic is a tool that can be applied to ambiguous, complicated, complex or nonlinear systems or
problems, which cannot
easily
be solved by classical techniques. This course discusses the
fundamental of fuzzy set theory and fuzzy logic. In addition, this course also introduces applications of
fuzzy logic in several areas such as fuzzy control and fuzzy decision making.
COURSE OBJECTIVES/GOAL
In this course you will learn:
(e) How imprecision in concept can be discussed using the basic of fuzzy sets;
(f) The basic principles of organizing a fuzzy expert system;
(g) What is inside the rule-base of a fuzzy expert system;
(h) About methods of building a fuzzy expert system.
METHOD OF LECTURE DELIVERY/TEACHING AIDS

Guided Instruction

Interaction classroom session

Students group assignment

Chart and diagrams

Multimedia projection
COURSE OUTLINES
Module 1:
Introduction to Fuzzy set theory
Week 1 and 2:
Introduction to fuzzy set theory, knowledge base problem,
objective and
subjective knowledge. Crisp sets, fuzzy sets, linguistic variables, hedges or
modifiers of linguistic variables, Properties of fuzzy sets, fuzzy set operations.
Exercises
Module 2
Membership function Calibrations
Week 3 and 4:
Review of module1, Membership functions, Fuzzy extension principles, Law of
contraction and law of excluded Middle.
Assignment
Modules 3:
Fuzzy Relation
Week 5 and 6
Review of module 2, Fuzzy Relation, compositions on the same and different
product spaces, Max-min composition, max-product composition, fuzzy
relational matrix, sup-star composition.
Exercises
Module 4:
Fuzzy reasoning and implication
Week 7 and 8:
The fuzzy truth tables, traditional propositional logic, rule of inference, the
Modus, pones and Modus tollens.
Module 5
Fuzzy Expert system Modeling
Week 9:
If – Then Rules, fuzzy inference, Fuzzification and Defuzzification process
MID-SEMESTER EXAMINATION
Week 11:
Building a fuzzy expert system (Fuzzy logic system applications)
Week 12 and 13
Hand-on practical using MatLab Fuzzy engine tool box.
Week 14
Group Presentations
Week 15
Revision and evaluation
STRUCTURE OF THE PROGRAMME/METHOD OF GRADING
3. Continuous assessment
40%
(iv)
Assignment (10%)
(v)
Group Presentation (10%)
(vi)
Mid-semester Exam (20%)
4. End-Semester Exam
60%
GROUND RULES AND REGULATION

No eating in the class

Active participation in all activities

All class assignment to be submitted on time

Punctuality and 75% attendance of classes to be observed
TOPIC FOR TERM PAPERS
Students will be grouped and each group will develop fuzzy expert system for different sectors of their
choice.
RECOMMENDED READING/TEXT
 J-S.R Jang, C-T. Sun, E. Mizutani, Neuro-Fuzzy and Soft Computing . 1st edition New York,
McGraw-Hill.
 T.J.Ross, (1995) Fuzzy logic with Engineering applications
 H-J. (1996) Zimmermann, Fuzzy set theory and its applications
 T,Terano, K. Asai, and M. Surgeno (1992) Fuzzy systems theory and its applications
Online Book
 Passino, Kevin M. & Yurkovich, Stephen (1998). Fuzzy Control. Menlo Park
(California): Addison Wesley
http://www.ece.osu.edu/~passino/FCbook.pdf#search=%22fuzzy%20control%22)
Milestone Papers:

Zadeh, L. (1965), "Fuzzy sets", Information and Control, Vol. 8, pp. 338-353.

Takagi, H., and Sugeno, M. (1985). ‘Fuzzy Identification of Systems and its

Applications to Modeling and Control’. IEEE Transactions on Systems, Man,
and Cybernetics. Volume 115, pages 116-132.
COURSE COMPACT
College:
Science and Technology
Department: Computer and Information Sciences
Programme(s):
o
B. Sc. Computer Science
Course Code: CSC314
Course Title: THEORY OF COMPUTING
Unit:
2
Course Lecturer(s): Dr. (Mrs) Oladipupo, O.O. and Mr. Adewole, O
Semester:
Alpha – 2013/2014
Time:
Friday , 12.00noon – 2.00pm
Location:
Hall 313.
A.
BRIEF OVERVIEW OF THE COURSE
Theory of computing is a scientific discipline concerned with the study of general properties of
computation. It provides computer science with concepts, models, and formalisms to help reason
about these concepts and models. It also addresses the question of what is and is not feasible
computable and creates algorithms for the intellectual processes that are being automated. The
aim of this course is all about the theories that enable computation, and computation is all about
modeling, designing, and programming the computer system to simulate our model.
B.
COURSE OBJECTIVES/GOALS
At the end of the course, students are expected to:



C.
be exposed to the exciting aspects of computer theory
be exposed to how programming language is design with the use of Grammars.
be concern about the languages or in other words, formal languages that enable computation with
the computer possible.
METHOD OF LECTURE DELIVERY/TEACHING AIDS
Lecture delivery
Guided instruction
Interaction classroom session
Transparencies
Overhead projection
Multimedia
-
D.
COURSE OUTLINES
Module 1 Introduction
Week 1 Alphabet and Strings , Languages, Language operation
Module 2
Finite Automata
Week 2 Deterministic and Non-deterministic finite automata
Week 3 Conversion automata to certain types of grammars and back again, using
non-deterministic automata
Week 4 Conversion of non-deterministic finite automata to deterministic finite
automata
Week 5 Regular expressions and their relationship to finite automata
Module 3
Grammars
Week 6 Definition, Regular Grammar
Week 7 Regular expression
Week 8 Relationship between regular grammar and regular expression
Types of Grammar (Chomsky hierarchy)
Module 4
Pushdown automata and context-free grammars
Week 9 Deterministic and non-deterministic pushdown automata Context-free
grammars
Week 10
Useless production and emptiness test Ambiguity
Week 11
Context-free grammars for pushdown automata and vice-versa
Module 5
Properties of Context-free languages
Week 12
Pumping lemma, Closure properties, Existence of non-context-free
languages
E.
Week 13
Turing languages, Decidability and Undecidability
Week 14
Revision
TUTORIALS
o
o
o
o
F.
STRUCTURE OF THE PROGRAMME/METHOD OF GRADING
1.
2.
G.
Review the basic features of Grammars and Finite Automata
Identifying different types Chomsky hierarchy
Review the Context free grammar and Pushdown automata.
Etc.
Continuous assessment
30%
i.
Assignments/Term paper
10%
ii
Mid-semester exam
20%
Examination
GROUND RULES AND REGULATIONS
Please note the following:
 Mandatory 75% class attendance
70%




H.
No eating in the classroom
Active participation in all activities
All class assignments to be submitted on time
Punctuality to classes to be observed
TOPICS FOR TERM PAPER/ASSIGNMENT
Students are to be group into three and each group is expected their term paper on Finite
Automata, Push down automata and Turing language
I.
ALIGNMENT WITH COVENANT VISION/GOALS
Generally, Theory of computing is a scientific discipline that dealt with the study of computation
which provides the computer scientists with concepts, models, and formalisms to help reason
about these concepts and models. It also addresses the question of what is and is not feasible
computable and creates algorithms for the intellectual processes that are being automated.
Therefore, this will enhance the students’ thinking and reasoning by providing solutions to a wide
range of scientific problems into the real world.
J.
CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
This course has a wide range of applications most especially in the areas of construction of compiler
design and Software Engineering.
K.
RECOMMENDED READING
4.
5.
6.
Lawson, M.V. Finite Automata. Chapman and Hall/CRC, 2004
Brookshear, J.G. Theory of Computation: Formal languages, Automata, and Complexity. The
Benjamin/Cummings Publishing Company, Inc. 1989.
Carroll, J. and Long, D. Theory of Finite Automata (with an introduction to formal languages).
Prentice Hall, 2004.
COURSE COMPACT
COLLEGE:
College of Science and Technology
DEPARTMENT: Computer Science and Information Sciences
PROGRAMME: Computer Science
COURSE CODE: CSP 412
COURSE TITLE: Fuzzy Logic
UNITS:
2
COURSE LECTURERS: Dr. (Mrs.) Oladipupo, O.O. and Mr. Oluranti
SEMESTER:
TIME:
LOCATION:
Alpha 2012/2013
10-12am, Wednessday
CSC Hall 201
BRIEF OVERVIEW OF THE COURSE
Fuzzy logic is a tool that can be applied to ambiguous, complicated, complex or nonlinear systems or
problems, which cannot easily be solved by classical techniques. This course discusses the fundamental of
fuzzy set theory and fuzzy logic. In addition, this course also introduces applications of fuzzy logic in several
areas such as fuzzy control and fuzzy decision making.
COURSE OBJECTIVES/GOAL
In this course you will learn:
(i) How imprecision in concept can be discussed using the basic of fuzzy sets;
(j) The basic principles of organizing a fuzzy expert system;
(k) What is inside the rule-base of a fuzzy expert system;
(l) About methods of building a fuzzy expert system.
METHOD OF LECTURE DELIVERY/TEACHING AIDS
 Guided Instruction
 Interaction classroom session
 Students group assignment
 Chart and diagrams
 Multimedia projection
COURSE OUTLINES
Module 1: Introduction to Fuzzy set theory
Week 1 and 2:
Introduction to fuzzy set theory, knowledge base problem, objective and
subjective knowledge. Crips sets, fuzzy sets, linguistic variables, hedges or
modifiers of linguistic variables, Properties of fuzzy sets, fuzzy set operations.
Exercises
Module 2
Week 3 and 4:
Membership function Calibrations
Review of module1, Membership functions, Fuzzy extension principles, Law of
contraction and law of excluded Middle.
Assignment
Modules 3:
Fuzzy Relation
Week 5 and 6
Review of module 2, Fuzzy Relation, compositions on the same and different
product spaces, Max-min composition, max-product composition, fuzzy relational
matrix, sup-star composition.
Exercises
Module 4:
Week 7 and 8:
Fuzzy reasoning and implication
The fuzzy truth tables, traditional propositional logic, rule of inference, the Modus,
pones and Modus tollens.
Module 5
Week 9:
Fuzzy Expert system Modeling
If – Then Rules, fuzzy inference, Fuzzification and Defuzzification process
MID-SEMESTER EXAMINATION
Week 11:
Week 12 and 13
Week 14
Week 15
Building a fuzzy expert system (Fuzzy logic system applications)
Hand-on practical using MatLab Fuzzy engine tool box.
Group Presentations
Revision and evaluation
STRUCTURE OF THE PROGRAMME/METHOD OF GRADING
5. Continuous assessment 40%
(vii)
Assignment (10%)
(viii)
Group Presentation (10%)
(ix)
Mid-semester Exam (20%)
6. End-Semester Exam
60%
GROUND RULES AND REGULATION
 No eating in the class
 Active participation in all activities
 All class assignment to be submitted on time
 Punctuality to classes to be observed
TOPIC FOR TERM PAPERS
Students will be grouped and each group will develop fuzzy expert system for different sectors of their
choice.
RECOMMENDED READING/TEXT
J-S.R Jang, C-T. Sun, E. Mizutani, Neuro-Fuzzy and SoftComputing . 1st edition New York,
McGraw-Hill.
T.J.Ross, (1995) Fuzzy logic with Engineering applications
H-J. (1996)
Zimmermann, Fuzzy set theory and its applications
T,Terano, K. Asai, and M. Surgeno (1992) Fuzzy systems theory and its applications
Online Book
Passino, Kevin M. & Yurkovich, Stephen (1998). Fuzzy Control. Menlo Park
(California): Addison Wesley
(http://www.ece.osu.edu/~passino/FCbook.pdf#search=%22fuzzy%20control%22)
Milestone Papers:
Zadeh, L. (1965), "Fuzzy sets", Information and Control, Vol. 8, pp. 338-353.
Takagi, H., and Sugeno, M. (1985). ‘Fuzzy Identification of Systems and its
Applications to Modeling and Control’. IEEE Transactions on Systems, Man,
and Cybernetics. Volume 115, pages 116-132.
COVENANT
UNIVERSITY, OTA
College of Science & Technology
Department of Computer &
Information Sciences
2013 – 2014 Academic Session, Alpha Semester
Course Compacts, CSC 213
Structured Programming (3 Units).
Course Lecturers: Mr. B. ODUSOTE & Mr. C. AJIEH
COLLEGE OF SCIENCE AND TECHNOLOGY
SCHOOL OF NATURAL AND APPLIED SCIENCES
DEPARTMENT OF COMPUTER AND INFORMATION SCIENCES
COURSE LECTURE OUTLINE
A. COURSE INFORMATION
Session
Semester
Course Title
Course Code
Course Unit
Programmes
Level
Venue
Day & Time
Lecturers
Contacts
Offices
2013/2014 Academic Session
Alpha semester
Structured Programming
CSC 213
Three (3) Units
BSc. Computer Science and BSc. Management Information System
200
CST Hall 107 & Computer Lab
Mon. 4pm -6pm & Tues. 11am-12noon
Mr Odusote Babafemi, Mr Ajieh Cyril
femi.odusote/[email protected]
Conference Room, 2nd Floor, CST Building & RM 167, Lecture Theater.
B. COURSE OVERVIEW
The course introduces structured program using Python Programming Language. The students’ are
exposed to the principles and core concepts of structured programming.
C. COURSE GOAL/OBJECTIVES
The primary goal of this course is that the students should be able to display a high level of
proficiency in the use and application of Python Programming Technologies & Techniques.
The Objectives are as follows:
At the end of this course, students are expected to:
 Understand the core concept of structured programming
 Differentiate between structured programming paradigm and other contemporary paradigms

Identify the important advantages of structured programming over unstructured ones

Learn and apply the fundamental concepts of Python programming language for program
development
Acquire competence in writing computer programs in Python using constructs such Lexical
Structures, Strings, Lists, Tuples, Dictionaries and Control Structures.

D. MODE OF LECTURE DELIVERY AND TEACHING AIDS
 Lecture Delivery Methods
o Guided Instructions
o Lecture Notes Delivery (In Powerpoint Format)
o On-hands Laboratory Practical Sessions
o Interactive Classroom Students’ Engagement Sessions
o Group and Individual Assignments/Tasks
o Live Quizzes to assess the immediate students’ understanding of concepts.
 Teaching Aids
o Overhead Multimedia Projector & Sound System
o Laboratory Computer Systems
o Software Applications Installation & Usage
E. ASSIGNMENTS AND GRADING POLICIES
SN
Task
1. Assignments and Tests
2. Mid-Semester Test
Continuous Assessment
3. Semester Examination
Score
15 marks
15 marks
30 marks
70 marks
Total Mark Obtainable
100 marks
F. GROUND RULES AND REGULATIONS
o Attendance in class is compulsory to participate in any assignment and tests.
o Punctuality and Sense of Responsibility is compulsory for all students.
o Minimum 75% Attendance is required to seat for the semester examination.
o All Assignments must be done promptly and submitted at the set lifelines.
o Contributions to group discussion and class work will be noted and graded.
G. Students Task/Assignments
o All Tasks & Assignments will entail Practical & Real Life Problems-solving using
the Python Programming language.
H. Course Content Preparation & Distribution
The course content as highlighted below will be taught in modules and each instructor will be
responsible to prepare the notes and other resources that will be used for that particular topic or
module. Adequate laboratory hands-on practical demonstration of the theory taught must be carried
out alongside the theory.
o Course Content:
Structured Programming: Definitions and Features. Brief History and Rationale, Comparison of
structure-oriented programming with other contemporary paradigms, important advantages of
structured programming over unstructured ones. Pseudo Codes, Algorithms and Flowcharts. Topdown design - stepwise refinement; Modular design – abstraction modularity. Lexical elements,
Data Types, Operators And Expressions, Control Structures - Sequence, Selection and Repetition,
Composite structures such as Lists, Tuples and Dictionaries, Functions and modules, File
Processing. Python features, Interactive shell environment and IDEs, Lexical elements, Data types,
Operators and Operands, Expression, Statement, branching, conditionals and iteration. Basics of
data representation and manipulation including: Tuples, Lists, Dictionaries, and Sets. Function
basics, Local variables, Parameters and arguments, Recursion, Module basics, Exceptions, Testing
and Debugging, Sorting and Searching. Text files processing, Database Connection and operations,
Tkinter Module, Basic GUI Construction, Models, Views, and Controllers (MVC). Python Django
Framework setup and basics & Hands-on Practical.
I. Assessment and Grading
Each instructor is expected to prepare his/her own questions for mid-semester and final
examinations, based on the content provided during teaching. The course coordinator will determine
the final output of the examination questions which will show the order and the number of
questions to be used for the examinations. Each question will be marked and graded by the
Instructor who prepared the question.
J.
1.
2.
3.
4.
5.
Lecture Note Preparation Format
Introduction and Overview of the Topic
Use, Importance and Relevance of the Concepts.
The use of the various functionalities and features Application Software & Tools.
Hands-on practical with relevant examples.
Live examples & class exercises.
K. Course Outline & Schedule.
Module 1-5: Structured Programming Techniques / Methodologies & Python Fundamentals
Lecture
No.
1.
2.
3.
4.
5.
6.
Lecture Title
Structured Programming Definitions
and Features, Brief History and
Rationale, Comparison of structureoriented programming with other
contemporary paradigms, important
advantages of structured programming
over unstructured ones.
Pseudo
Codes,
Algorithms
and
Flowcharts. Top-down design stepwise refinement; Modular design –
abstraction modularity.
Lexical
elements,
Data
Types,
Operators And Expressions, Control
Structures - Sequence, Selection and
Repetition, Composite structures such
as Lists, Tuples and Dictionaries,
Functions and modules, File Processing.
Python Fundamentals: Python features,
Interactive shell environment and IDEs.
Hands-on Lab Practical on all concepts
taught.
*Students’ Group Assignments
Lexical elements, Data types, Operators
and Operands, Expression, Statement,
branching, conditionals and iteration.
*Course Test (1)
Python Composite Structures, Functions
and modules. Hands-on Lab Practical
on all concepts taught.
Lecture
Week
Lecture Date
Instructors
Week 1
Mon. Aug. 12
&Tue. Aug. 13,
2013
Mr C. Ajieh
Mon. Aug. 19
&Tue. Aug. 20,
2013
Mr C. Ajieh
Mon. Aug. 26
&Tue. Aug. 27,
2013
Mr Odusote
Mon. Sept. 2
&Tue. Sept. 3,
2013
Mr Odusote
Mon. Sept. 9
&Tue. Sept. 10,
2013
Mr C. Ajieh
Week 2
Week 3
Week 4
Week 5
Week 6
Mon. Sept. 16
&Tue. Sept. 17,
2013
Mr Odusote
Mr Odusote
Mr C. Ajieh
Mr C. Ajieh
Mr Odusote
Mr C. Ajieh
Mr Odusote
Module 6-7: File Processing & GUI & Introduction to Python Framework
Lecture
No.
7.
8.
Lecture Title
Lecture
Week
Lecture Date
Instructor
Basics of data representation and
manipulation including: Tuples, Week 7
Lists, Dictionaries, and Sets
Mon. Sept. 23
&Tue. Sept. 24,
2013
Mr Odusote
Function basics, Local variables,
Parameters
and
arguments, Week 8
Mon. Sept. 30,
2013
Mr C. Ajieh
Mr Odusote
Recursion,
Module
basics,
Exceptions, Testing and Debugging,
Sorting and Searching.
9.
Mr C. Ajieh
File Processing: Text files processing,
Database Connection and operations, Week 9
Tkinter Module
Mon. Oct. 7 &
Tue.Oct. 8, 2013 Mr C. Ajieh
GUI: Basic GUI Construction, Models,
Mon. Oct. 14 &
Tue. Oct. 15,
2013
Mr Odusote
10.
Views, and Controllers (MVC).
Week 10
*Test (2): Mid-Semester Exam.
11.
Python Django Framework setup and
basics & Hands-on Practical.
*Students Group Assignments
12.
13
Mr Odusote
Week 11
Mon. Oct. 21 &
Tue. Oct. 22,
2013
Mr C. Ajieh
Mr Odusote
Real
Life
Problems-solving using the Python Week 12
Programming language.
*Students’ Assignments
Revision on Taught Concepts &
Week 13
Upload of Lecture Attendance.
Hands-on
Mr C. Ajieh
Practical:
Mon. Oct. 28 &
Tue. Oct. 29,
2013
Mr C. Ajieh
Mr Odusote
Mon. Nov. 4 &
Tue. Nov. 5,
2013
Mr C. Ajieh
Mr Odusote
***
Alpha Semester Examination
Week 14-15
Mon. Nov 11 –
Fri. Nov 22, 2013
Mr Odusote
Mr C. Ajieh
L. Course Resources & Recommended Texts
o Instructors: Mr. B.O Odusote & Mr. C. Ajieh
o E-Learning Platform: Covenant University ELearning
http://learn.covenantuniversity.edu.ng/
o
Recommended Reading:
1. "Practical Programming: An Introduction to Computer Science Using Python " by Jennifer
Campbell,Paul Gries,Jason Montojo and Greg Wilson, The Pragmatic Bookshelf Raleigh, North
Carolina Dallas, Texas, 2009.
2. “Learning Python”, Third Edition by Mark Lutz Copyright © 2008 O’Reilly Media, Inc.
3. “How to Think Like a Computer Scientist: Learning with Python” Copyright c 2002 Allen
Downey, Jeffrey Elkner, and Chris Meyers. Edited by Shannon Turlington and Lisa Cutler.
Cover design by Rebecca Gimenez. Printing history: April 2002: First edition
o
Reference: Python Online Documentation
o Interpreter: Python Interpreter 2.7.2.5 and Django-1.4.3
M. Alignment with Covenant University Vision & Goals.
The students are groomed and equipped with the relevant IT skills required to thrive as new
generation leaders of their fields of endeavour in the external contexts, outside the walls of the
University.
N. Contemporary Issues/Industry Relevance
The current trends and influence of IT in all field of human endeavour necessitates the need to
equip the student with relevant and requisite applicable IT knowledge and skillset sufficient enough
to secure a place for them in the Industry. With a course like this, such knowledge and skillset is
easily delivered to the students without which they would not be able to thrive within the Industry.
COVENANT
UNIVERSITY, OTA
College of Science & Technology
Department of Computer &
Information Sciences
2013 – 2014 Academic Session, Alpha Semester
Course Compacts, CSC 215
Mathematical Methods I (3 Units).
Course Lecturers: Prof. E.F ADEBIYI & Mr. B.O ODUSOTE
COLLEGE OF SCIENCE AND TECHNOLOGY
SCHOOL OF NATURAL AND APPLIED SCIENCES
DEPARTMENT OF COMPUTER AND INFORMATION SCIENCES
COURSE LECTURE OUTLINE
O. COURSE INFORMATION
Session
Semester
Course Title
Course Code
Course Unit
Programmes
Level
Venue
Day & Time
Lecturers
Contacts
Offices
2013/2014 Academic Session
Alpha semester
Mathematical Methods I
CSC 215
Three (3) Units
BSc. Computer Science
200
CST Hall 203
Wed. 12noon-1pm & Thurs. 10am-12noon
Prof. Adebiyi Ezekiel & Mr Odusote Babafemi
ezekiel.adebiyi/[email protected]
LT Ground Floor & Conference Room, 2nd Floor, CST Building.
P. COURSE OVERVIEW
The course is designed to expose students to various mathematical methods and their application to
science and real life problems. The course introduces students to the art of solving problems.
Q. COURSE GOAL/OBJECTIVES
The primary goal of this course is that the students should be able to display in-depth knowledge
and high level understanding of mathematical methods and their application to science and real life
problems.
The Objectives are as follows:
At the end of this course, students are expected to:
o Understand the detailed principle series and sequences with their applications
o Understand the principle Taylor, Maclaurin and Binomial theorem
o Understand vectors Algebra, Matrices & Determinant and their applications to science,
industry and real life in general
o Understand Complex Plane and Variables & Algebra and their applications to science,
industry and real life in general
R. MODE OF LECTURE DELIVERY AND TEACHING AIDS
 Lecture Delivery Methods
o Guided Instructions.
o Lecture Notes Delivery. (Ms Word Format)
o Live Solution to Mathematical Problems & Exercises.
o Interactive Classroom Students’ Engagement Sessions.
o Group and Individual Assignments/Tasks.
o Live Quizzes to assess the immediate students’ Understanding of Concepts.
 Teaching Aids
o Overhead Projection & Sound System.
o Slides and Transparencies
S. ASSIGNMENTS AND GRADING POLICIES
SN
Task
1. Assignments and Tests
2. Mid-Semester Test
Continuous Assessment
3. Semester Examination
Score
15 marks
15 marks
30 marks
70 marks
Total Mark Obtainable
100 marks
T. GROUND RULES AND REGULATIONS
o Attendance in class is compulsory to participate in any assignment and tests.
o Punctuality and Sense of Responsibility is compulsory for all students.
o Minimum 75% Attendance is required to seat for the semester examination.
o All Assignments must be done promptly and submitted at the set lifelines.
o Contributions to group discussion and class work will be noted and graded.
U. Students Task/Assignments
o All Tasks & Assignments will entail Practical & Real Life Problems-solving using
the Mathematical Methods Techniques..
V. Course Content Preparation & Distribution
The course content as highlighted below will be taught in modules and each instructor will be
responsible to prepare the notes and other resources that will be used for that particular topic or
module.
o Course Content:
Sequences of real numbers, Monotone sequence, Convergence: absolute and conditional
convergence, Infinite series, Convergence tests, Addition and Multiplication of series. Power series,
radius of convergence, Taylor and Maclaurin series and their applications, Taylor polynomials and
Taylor's formula, The binomial theorem and binomial series. Matrices and linear transformations,
Matrix operations, Solutions of linear systems by matrices, Rank and inverse, eigenvalues and
eigenvectors, Solution of a set of linear equations, guassian elimination method for solving a set of
linear equation, eigenvalues and eigenvectors. Canonical forms, Jordan form, generalized inverse of
a matrix. Application of matrix operation to real life problems. The complex plane, complex
algebra, complex numbers and their properties. Complex numbers as vectors. Functions of a
complex variable.
W. Assessment and Grading
Each instructor is expected to prepare his/her own questions for mid-semester and final
examinations, based on the content provided during teaching. The course coordinator will determine
the final output of the examination questions which will show the order and the number of
questions to be used for the examinations. Each question will be marked and graded by the
Instructor who prepared the question.
X.
6.
7.
8.
9.
Lecture Note Preparation Format
Introduction and Overview of the Topic
Sample Problems & Real Life-applicable Problem Solutions
Live examples & class exercises.
Relevance of Concepts to Real Life Scenarios.
Y. Course Outline & Schedule.
Module 1: Sequences & Series
Lecture
No.
1.
2.
3.
4.
Lecture Title
Lecture
Week
Sequences of real numbers. Monotone
sequence. Convergence. Absolute and Week 1
conditional convergence.
Infinite series, convergence tests,
addition and multiplication of series, Week 2
power series, radius of convergence.
Binomial theorem, Binomial Series. Week 3
Examples & Sample Exercises
Taylor and Maclaurin series and their
applications,
Taylor
polynomials, Week 4
Taylor’s formula.
*Students’ Group Assignments
Module 2: Matrices & Determinant
Matrices,
matrix
operations,
5.
Week 5
determinant of a square matrix.
*Course Test (1)
Elementary row and column operations,
6.
Week 6
linear transformations.
*Students’ Assignments
Rank of matrices, inverse matrices,
7.
solutions of linear systems by matrices, Week 7
eigenvalues and eigenvectors.
Lecture Date
Instructor
Wed. Aug. 14 &
Thur. Aug. 15,
2013.
Prof Adebiyi
Mr Odusote
Wed. Aug. 21 &
Thur. Aug. 22,
2013.
Wed. Aug. 28
&Thur. Aug. 29,
2013
Wed. Sept. 4
&Thur. Sept. 5,
2013
Prof Adebiyi
Mr Odusote
Prof Adebiyi
Mr Odusote
Prof Adebiyi
Mr Odusote
Wed. Sept. 11
&Thur. Sept. 12, Prof Adebiyi
2013
Mr Odusote
Wed. Sept. 18
&Thur. Sept. 19, Prof Adebiyi
2013
Mr Odusote
Wed. Sept. 25
&Thur. Sept. 26, Prof Adebiyi
2013
Mr Odusote
Module 3: Systems of Linear Equations
Lecture
No.
8.
9.
Lecture Title
Lecture
Week
Lecture Date
Instructor
Wed. Oct. 2
&Thur. Oct. 3,
2013
Prof Adebiyi
Mr Odusote
Wed. Oct. 9
&Thur. Oct. 10,
2013
Prof Adebiyi
Mr Odusote
Week 10
Wed. Oct. 16
&Thur. Oct. 17,
2013
Prof Adebiyi
Mr Odusote
Week 11
Wed. Oct. 23
&Thur. Oct. 24,
2013
Prof Adebiyi
Mr Odusote
Solution of a set of linear equations,
Guassian Elimination method for Week 8
solving a set of linear equation,
eigenvalues and eigenvectors.
Canonical forms, Jordan form,
Week 9
generalized inverse of a matrix.
Module 4: Vector Algebra and Complex Numbers
10.
11.
Vector algebra in Rn space, linear
independence, representation of lines
and planes by vectors
*Test (2): Mid-Semester Exam.
Complex numbers and their ppties,
complex numbers and vectors
*Students’ Assignments
13
The complex plane, complex
algebra, functions of a complex Week 12
variable.
Revision on Taught Concepts &
Week 13
Upload of Lecture Attendance.
***
Alpha Semester Examination
12.
Week 14-15
Wed. Oct. 30
&Thur. Oct. 31,
2013
Prof Adebiyi
Mr Odusote
Wed. Nov. 6
&Thur. Nov. 7,
2013
Prof Adebiyi
Mr Odusote
Mon. Nov 11 –
Fri. Nov 22, 2013
Prof Adebiyi
Mr Odusote
Z. Course Resources & Recommended Texts
o Instructors: Prof. E.F Adebiyi & Mr. B.O Odusote
o E-Learning Platform: Covenant University ELearning
http://learn.covenantuniversity.edu.ng/
o
Recommended Reading:
1. Adebiyi, E. F. and Fatumo, S., Mathematical Methods and Their Applications.
Covenant
University
Press,
2006.
(http://www.covenantuniversity.com/publications/pdf/cu-press.pdf
2. Riley, K.F, Hobson M.P, Bence, S.J., Mathematical Methods for Physics &
Engineering, 3rd Edition, Cambridge University, Press, 2006.
3. Anthony Croft and Robert Davison, Mathematics for Engineers. Pearson Eduation
Limited. 2004
4. Adegbola Akinola, a b c in mathematical methods (a). Obafemi Awolowo University
Press Ltd.2003.
5. Schaum’s Outline Series, Theory & Problems of Complex Variables, SI (metric)
Edition, McGraw Hill Press, 2004.
6. David Alexander Brannan, A First Course in Mathematical Analysis. The Open
University, 2006.
7.
AA.
Alignment with Covenant University Vision & Goals.
The students are groomed to provide solutions to a wide array of problems. The ability to solve
technical and business problems on this platform through the skills acquired in the course which are
required for the students to thrive as new generation leaders in their fields of endeavour in the
external contexts, outside the walls of the University.
BB.
Contemporary Issues/Industry Relevance
The current trends in the field of science necessitate the need to equip the student with relevant and
requisite applicable mathematical knowledge and skillset sufficient enough to secure a place for
them in the Industry. Mathematical Knowledge is important in all areas of life. The methods learnt
are useful in business. The methods are dominant tools in industries, banks, manufacturing
companies, engineering, and agricultural. With a course like this, such knowledge and skillset is
easily delivered to the students without which they would not be able to thrive within the Industry.
COURSE COMPACT
College: Science and Technology
Department: Computer and Information Sciences
Programmes:
o
o
B.Sc. Computer Science
B.Sc. Management Information System
Course Code: CSC 111
Course Title: Introduction to computer science
Units: 3
Course Lecturers: Mrs Oni A. A. and Mrs Okuboyejo S.R., Mr Adewumi A.A. and Miss Marcus V.
Semester: Alpha
Time: Tuesday, 8-10am and Wednesday, 10-11am
Location: Computer Science Laboratory CST
uu. Brief Overview of Course
The course is designed to introduce students to the concepts and scientific principles of computers. It
does not rely on the knowledge of higher mathematics, but merely presupposes a certain amount of
curiosity, creativity, and logical ability. It covers in details the digital computer organization, ICT and
programming concepts.
vv. Course Objectives/Goals
At the end of this course, students are expected to have:
o
o
o
o
A good understanding of the definition, fields and significance of computer science
Appreciate the basic organization of the computer by describing the various parts and how they
function.
Describe the different types of computers in terms of their size, genealogy, speed and
functionality.
Understand the role and application of computer science in ICT.
o
o
o
o
o
ww.
Define a language and differentiate between the various kinds of computer languages.
Describe software and its related issues like ethics, piracy, patents etc.
Understand the various software engineering issues.
Understand and describe each of the four standard number systems.
Convert from one number system to the other and then perform binary, octal and hexadecimal
arithmetic.
Methods of Lecture Delivery/Teaching Aids

Lecture Delivery Methods
o Interactive classroom session
o Group assignments
o Lecture notes

Teaching Aids
o Multimedia projection
o Computer Laboratory
xx. Course Outlines
 Modules & Details of Topics
Module I: History Computer Science and Computer Hardware
Week 1: Definition of Computer Science, History of Computer Science and their generations from
mechanical to multimedia computers.
Week 2: Basic elements of a micro computer , Functions of Components, Operating principles of
the computer , Examples of Component types. Modern I/O units
Week 3: Categories of Software, Application Software, Software packages and their applications.
Operating Systems and their generation. Programming language generations.
Module II: Program Development
Week 4-5: Steps in program development. Flowcharts, Algorithms and Pseudocode. Structured
programming, Program Objects
Continuous Assessment One (CA 1)
Module III:
Visual Basic Fundamentals
Week 6: Visual Basic User Interface Design: Form and other controls. VB data types and variables.
Week 7: Intrinsic functions, Expressions
Mid-Semester Test (CA 2)
Week 8: Control Statement Iteration, Selection If Then Else, Case statements, Repetition, For, while
statement
Hands-on practices on VBasic
Week 9: Managing your project, Sub Procedures, Functions, and Multiple Forms.
Hands-on practices on Basic.
Module IV: Database and Visual Basic (VB)
Week 10: Interfacing Visual Basic User Interface with MS Access Database design
Week 11: Hands-on practices on Visual Basic and Group Project
Week 12: Revision
yy. Tutorials
o
o
o
Review the basic features of computers
Identify basic features of different generations of computers
A review of the fundamentals and applications of software engineering as an important
branch of computer science
zz. Structure of the Programme/Method of Grading


aaa.
Continuous Assessment
o Class test/Assignments
o Mid Semester test
20 Marks
10 Marks
Examination
70 Marks
Ground Rules & Regulations
o 75% Attendance is required to seat for the examination.
o Assignments must be submitted as at when due.
o Contributions to group discussion and class work are noted.
bbb.

Topics of Term Papers/Assignment/Student Activities
The relevance of the stored program concept to the development of the 21st century computer
systems.
ccc. Alignment with Covenant University Vision/Goals
Generally, computer systems are prominent and dominant tools for carrying out day to day
transactions. Students are trained to have a comprehensive understanding of computer science to
enable them provide solutions to a wide range of scientific problems. Apart from enhancing their
thinking, it also affords students the opportunity to have a good foundation as regards higher level
computer science topics which can help to build their capacity.
ddd.
Contemporary Issues/Industry Relevance
Computer scientist will continue to be in a very high demand in industries and other institutions.
The relevance of this course is that it provides the basic knowledge of the operations of computer
systems and their genealogical development over the ages. It could help industries in developing
new models of systems, if explored and utilized efficiently and constructively.
eee.
Recommended Reading/Texts
o
J. Glenn Brookshear (2005) Computer Science; An overview, 8th edition, Pearson Addison
Wiley.
o
C.K Ayo (2001) Information Technology: Trends and Applications in Science and Business,
Concept Publications.
o
Committee on the Fundamentals of Computer Science; Challenges and Opportunities,
National Research Council (2004), Computer Science: Reflections on the Field, National
Academies Press. ISBN 978-0-309-09301-9
o
Peter J. Denning. Is computer science?, Communications of the ACM, April 2005.
Course Code
Course Title
Credit Unit
Offerings
Venues
Days and Time
CSC311
Discrete Structure
Three (3) Units
Computer Science
Hall 313, Hall 203
Tuesdays | 3pm-4pm, Fridays | 8am-10am
COLLEGE OF SCIENCE AND TECHNOLOGY
SCHOOL OF NATURAL AND APPLIED SCIENCES
DEPARTMENT OF COMPUTER AND INFORMATION SCIENCES
A. Brief Overview of Course
The course enables students to have the understanding of Logic and proofs, propositions, truth
tables, implication and equivalence; tautology, contingency and contradiction; Sets relations and
functions; Introduction to algorithms; Combinatorics; Graph theory; and Algebraic structures.
B. Course Objectives
At the end of this course, students are expected to;
*
have developed a formalized mathematical mind
*
simulate model and analysis of complex systems
*
be able to represent statements in a structured mathematical way
C. Course Outline:
Basic Set Theory: Basic definitions, Relations, Equivalence Relations Partition, Ordered Sets. Boolean
Algebra & Lattices, Logic, Graph theory: Directed and Undirected graphs, Graph Isomorphism, Basic Graph
Theorems, Matrices; Integer and Real matrices, Boolean Matrices med m, Path matrices. Adjacency
Vectors/Matrices: Path adjacency matrix, Numerical & Boolean Adjacency matrices. Applications to
counting, Discrete Probability Generating Functions.
Week
1-2
Title
Basic Set Theory: Basic definitions, Relations, Equivalence Relations Partition, Ordered
Sets.
Boolean Algebra & Lattices, Logic
Graph theory: Directed and Undirected graphs, Graph Isomorphism, Basic Graph
Theorems
Matrices; Integer and Real matrices, Boolean Matrices med m, Path matrices
Adjacency Vectors/Matrices: Path adjacency matrix, Numerical & Boolean Adjacency
matrices
Applications to counting, Discrete Probability Generating Functions.
Revision
3-4
5-6
7-8
9 - 10
11 - 12
13
D. Mode of Delivery and Teaching Aids
 Lecture notes (delivered through Power-point Format)
 Interactive/group and individual classroom engagement sessions
Teaching Aid
 Multimedia Projection
E. Tutorials
F. Assignments and Grading Policies
 Assignments and Tests 15 marks
 Mid-Semester Test 15 marks
Continuous Assessments 30 Marks
 End-Semester Exam 70 marks
Total 100 Marks
G. Ground rules & regulation






75 % average class attendance
Students displayed a good sense of responsibility and decorum
Class assignment should be taken seriously
Students should engage actively in all class activities
Punctuality to class is expected of every student
H. Topics for term papers/Assignment/Students activities

Structure questions based on class work and exercises
I. Alignment with Covenant University Vision/Goals
The delivery of the lecture aligns with the goals and vision of Covenant University to the raising
new generation of leaders.
J. Contemporary issues/Industry relevance
The course is very relevance because we are in the era when optimization is very crucial in any
organization vis-a-vis areas of human endeavour
K. Relevant Texts
1.
Discrete mathematics and its applications
2.
Discrete mathematics by examples
by Kenneth H. R.
by Andrew Simpson
3.
Discrete Mathematics
by Richard J. (Int’l Edition)
Covenant University, Ota
College:
Science and Technology
Department:
Computer & Information Sciences
Programme:


Course Code:
B. Sc. Computer Science
B.Sc. Management Information System
CSC 319/CSC 412
Course Title:
Operations Research
Units:
2 Units
Course Lecturer:
Dr. Oladipupo, O.O;Dr. Afolabi Mrs. Okuboyejo, S. R; Mr. Eweoya, I
Semester/ Session:
Alpha Semester/ 2013-2014 Session
Time:
Monday/ 10 a.m-12noon
Venue:
Hall 313
a.
Brief overview of Course
The course enables students to know Operations Research Modeling approaches. Transportation
and Assignment Problems: Formulation and Solution. It also shows students the techniques for
Project planning and control with PERT-CPM. Deterministic Model; Economic order quality model
(EOQ); Production planning; Stochastic Models:
b.
Course Objectives
At the end of this course, students are expected to;
*
have mathematical foundations in linear programming, optimization models, and
algorithms
*
know the details of the resource management techniques
*
understand the applicability of linear programming, transportation problem and network
analysis to some real life problems – task
c.
*
solve problems relative to minimization and maximization, using any solution method
*
be able to solve real life problems related to optimization, transportation and other related
problems.
Method of Lecture delivery/Teaching Aids
Lecture Delivery:

Guided instruction

Interaction classroom session

Student group assignments

Lecture notes
Teaching Aid


d.
Overhead projection
Multimedia projection
Course Outline
Overview of the operation research Modeling approaches. Linear programming model; assumption of
linear programming; Simplex method; Two-phase Method; Artificial Variable Technique; Minimization and
maximization Two-Phase method. Transportation simplex method: tableau initialization, optimality test,
and iteration; Assignment Problems: Formulation and Solution. Directed network; Shortest-path problem:
Algorithm for minimum spanning tree problem; Maximum cost flow problem; Minimum cost flow problem;
Network simplex method; Project planning and control with PERT-CPM. Deterministic Model; Continuous
Review: Economic order quality model (EOQ); Periodic review: Production planning; Stochastic Models:
Single Period model; Two-period inventory model; Multi-period model. One-dimensional Search: Golden
section search derivations; Taylor series and conditions for local optima; Convex / Concave function and
global optimality; Gradient search; Newton's method; Quasi-Network method and BFGS search. Lagrange
multipliers method; Karush-Kuhu-Tucker optimality conditions; Penalty and barrier method..
Module 1:
Overview of the operations research modeling approaches
Weeks 1 - 2
*
Linear programming model
*
Assumption of LP
*
Solution methods – Simplex, two-phase, and artificial variable
*
Minimization and maximization
Module 2:
Transportation and Assignment problems
Week 3 - 5
*
Transportation simplex method
(Dr. Oladipupo)
(Mrs. Okuboyejo)
Module 3:
*
Tableau initialization
*
Optimality test and iteration
*
Formulation and solution of assignment problems
Network analysis
(Dr. Afolabi)
Week 6 - 7
Module 4:
*
Shortest-path problem
*
Algorithm for minimum spanning tree problem
*
Maximum and minimum cost flow problem
*
Network simplex method
*
Project planning and control with PER-CPM
Inventory theory
(Mr. Eweoya)
Week 8 - 9
Module 5:
*
Continuous reviews
*
Economic order quality model (EOQ)
*
Periodic review - production planning
Stochastic model
(Dr. Oladipupo)
Week 10
Module 6
*
Single period model
*
Two-period inventory model
*
Multi-period model
Unconstrained nonlinear programming (Dr. Afolabi & Mrs. Okuboyejo)
Week 11 - 12
*
One-dimensional search
*
Golden search derivations
*
Taylor series and conditions for local optima
*
Week 13
Convex/concave function and global optimality
Revision
e.
Tutorial
f
Structure of the Programme/Method of Grading
1.
Continuous Assessment
*
2.
g.
Class Test
Semester examination
30 marks
70 marks
Ground rules & regulation





Recorded over 90 % average class attendance
Students displayed a good sense of responsibility and decorum
Class assignment are taken seriously
Students engaged actively in all class activities
Punctuality to class is expected of every student
h.
Topics for term papers/Assignment/Students activities
questions based on class work
i.
Structure
Alignment with Covenant University Vision/Goals
The delivery of the lecture aligns with the goals and vision of Covenant University to the raising
new generation of leaders.
j.
Contemporary issues/Industry relevance
The course is very relevance because we are in the era when optimization is very crucial in any
organization vis-a-vis areas human endeavour
k.
Recommended Reading/Text
1.
Introduction to Operations Research
2.
Operations Research in Decision analysis and Production Management
Adedayo et al (2006)
1st Edition
Hillier L.
8th Edition
Covenant University
Course Compact
2013/2014 Academic Session
College:
Science and Technology
Department:
Programme:
Course Code:
Course Title:
Computer and Information Sciences Department
Computer Science
CSC 216
Foundations of Sequential and Parallel Programming
Unit:
Course Lecturers:
Semester:
2
Dr. Oyelami and Mr. Oluranti Jonathan
Alpha
Time & Location:
o) Brief Overview of Course/Description
This course introduces the relationships between High level languages and the
Computer Architecture that underlies their implementation: It also discusses basic
machine architecture; assembler specification and translation of programming language
block structured languages and parameter passing mechanisms.
p) Course Objectives/Goals
At the end of this course, students are expected to:

have a good understanding of computer architecture.

have a good understanding of the relationship between high level languages and
computer architecture.

have a good understanding of the concept of sequential and parallel
programming.
q) Method of Lecture Delivery/Teaching Aids
 PowerPoint presentations of lecture notes
 Tutorials for students
 Assignments, class work and good examples will also be used
r) Course Outlines
Module 1
Week1 Introduction to the course
Week 2-3

Basic computer architecture (basic machine architecture), assembler specification and
translation of programming language block structured languages.
Week 4

High Level Languages /C Language
Module 2
Week 5

Sequential programming
Week 6

Sequential programming practical applications
Week7

Parallel programming
Week 8

Mid-Semester Examination
Week 9

Parallel programming practical applications
Week 10

Comparing sequential and parallel programming.
Module 3

Week 11 & 12
The relationships between high level languages and the computer architecture as regards
assembler specification and translation of programming language block structured languages,
and parameter passing.
s) Structure/Method of Grading
 Continuous Assessment (CA)
- Mid Semester Test - 15%
- 2 Assignments, 3 quizzes (3 marks each) – 15%

Examination – 70%
t) Ground Rules/Class Behavior
 Students are expected to participate during the lectures
 Punctuality to class very important
 Mandatory 75% attendance
 All assignments must be submitted as required
u) Recommended Reading/Texts

Concurrent Programming, A. Burns and G.Davies, Addison-Wesley, 1993

Computer Architecture: A Quantitative Approach by John L. Hennessy, David A. et al

Programming with C, Second Edition by Schaum’s Outline

Andrews (2000), Foundations of Multithreaded, Parallel and Distributed Programming,
Addison Wesley.

Lea (2000), Concurrent Programming in Java: Design Principles and Patterns, (2nd Edition),
Addison Wesley.

Goetz et al. (2006), Java concurrency in practice, Addison-Wesley

Ben-Ari (1982), Principles of Concurrent Programming, Prentice Hall.

Andrews (1991), Concurrent Programming: Principles & Practice, Addison Wesley.

Burns & Davis (1993), Concurrent Programming, Addison Wesley.

Magee & Kramer (1999), Concurrency: State Models and Java
COVENANT UNIVERSITY
COURSE COMPACT
2013/2014 Academic Session
College: Science and Technology
Department: Computer and Information Sciences
Programme: B.Sc. Computer Science
Course Code: CSC 315
Course Title: Computer Architecture and Organization
Units: 2
Course Lecturers: Dr. Azeta A. A. & Mr. Oluranti
Semester: Alpha, 2013/2014
Time: Tuesday 10 – 11 am.
Location: Hall 308 (Tuesday)
fff.
Brief Overview of the Course
This course involves teaching of number systems, organization and architecture of modern computer systems as well as
writing of assembly language programs.
The aim is to expose students to the design and internal working of computer systems.
ggg.
Course Objectives/Goals
At the end of this course, students are expected to:



be able to explain how numbers are represented in the computer memory;
be able to explain the architecture and organization of modern computer systems;
be able to program the computer system using Assembly Language.
hhh.
Methods of Lecture Delivery/Teaching Aids
Lecture Delivery



Interactive classroom session
Group assignments
Lecture notes
 Charts and diagrams
Teaching Aids

Use of Computer laboratory to provide a practical understanding of computer architecture.
 Microsoft PowerPoint slides
 Transparences

Multimedia projector
d. Course Description
Data representation and Number bases. Binary/Octal/Hex Number Systems. Binary Arithmetic.
Other Codes: BCD, Excess-3, Gray, ASCII, EBCDIC. Signed numbers. 2's complement Addition &
subtraction. Multiplications and Division. BCD addition. Integer representation, Integer arithmetic,
Fixed and Floating-Point systems. Boolean Algebra: Basic circuits and theorems; Boolean
expressions; Truth tables, Logic gates and realization of Boolean functions. Fundamental building
blocks, logic expressive immunization, sum of product forms. Register transfer notation. Physical
considerations. Representation of memory systems organization and architecture. The Instruction
Cycle, Instruction Pipelining, The Intel Pentium and Motorola PowerPC processors, Microoperations. Advanced Computer Architecture: Reduced Instruction Set Architecture, RISC
Pipelining, The RISC versus CISC Controversy, Assembly language programming of 32 bit
INTEL and 32 bit MOTOROLA processors, programming model, addressing modes, instruction
set, data types, operation types, instruction formats, instruction groups.
u. Course Outlines
 Modules & Details of Topics
Module 1: Introduction
Week 1 An Introduction to the following:
Course Outline, a general review.
The course lecturers.
Textbooks and reference materials.
Number Systems
Module 2:
Module 3:
Number Systems
Week 2
Data representation and Number bases. Binary/Octal/Hex Number
Systems. Binary Arithmetic. Other Codes: BCD, Excess-3, Gray, ASCII,
EBCDIC. Signed numbers. 2's complement .Addition & subtraction.
Multiplications and Division
Week 3
BCD addition. Integer representation, Integer arithmetic, Fixed and
Floating-Point systems
Boolean Expression & Logic Gate
Week 4 Boolean Algebra: Basic circuits and theorems; Boolean expressions;
Truth tables, Logic gates and realization of Boolean functions.
Week 5 Fundamental building blocks, logic expressive immunization,
sum of product forms.
Module 4:
Processor Organisation
Week 6 Register transfer notation. Physical considerations. Pentium
and PowerPC Evolution.
Week 7 Representation of memory systems organization and architecture.
Module 5:
Instruction Circle
Week 8 The instruction circle, Instruction Pipelining.
The Intel Pentium and Motorola PowerPC processors.
Week 9 Micro Operations
Module 6:
Advanced Computer Architecture
Week 10
Reduced Instruction Set Architecture, RISC Pipelining.
The RISC versus CISC Controversy.
Module 7:
Assembly Language
Week 11
Assembly language programming of 32 bit INTEL and 32 bit
MOTOROLA processors, programming model.
Week 12
Addressing modes, instruction set, data types, operation types,
instruction formats, Instruction group
Module 8
Week 13
Tutorial/Revision
v.
Tutorials
o Review of Number systems
o Boolean expression & logic gate
o Processor organization
o RISC and CISC Pipelining
o Assembly language Programming
w.
Structure of the Programme/Method of Grading
(1)
(2)
Continuous assessment
30 marks
(i)
Assignments
10%
(ii)
Mid Semester Exam
20%
Examination
70%
====
TOTAL
100%
====
x.
Ground Rules & Regulations
o To seat for the examination, 75% Attendance is required.
o Assignments must be submitted as at when due.
o Contributions to group discussion and class work are noted.
y.
Topics of Term Papers/Assignment/Student Activities
o
o
o
o
Representation of data in the computer memory
Development of theorems of Logic gates
Compare and contrast RISC and CISC processor
Programming in Assembly language
z.
Alignment with Covenant University Vision/Goals
Understanding the principles behind the design of a computer system is a major step in building a
computer system. This course will expose the students to the computer hardware so as for them to
know how software and hardware work together and most importantly, it will give them a
foundation to build on in case they want to specialize in hardware in the future, which can make
them self-employed.
aa.
Contemporary Issues/Industry Relevance
As a result of the competitive nature of most businesses, organizations require competent IT
personnel with an understanding of the internal working of computer systems to provide effective
IT support services. Consequently, skilled programmers that have adequate hardware skills will be
at an advantage.
bb.
Recommended Reading/Texts
Chalk B. S. (2004), Computer Organisation and Architechure An Introduction
Bartee, T. C. (1991), Computer Architecture and Logic Design
(McGraw-Hill International editions).
Dowsing R. D. et al (2000), Computers from logic to architecture
2nd Edition, (Mcgraw-Hill Companies)
Stallings W. (2003), Computer Organisation and Architecture
(Designing for performance) Sixth Edition.
Tanenbaum A. S. (2006), Structured Computer Organisation, fifth edition, Pearson Prentice Hall.
John P. Hayes (1998), Computer Architecture and organization
Mcgraw-hill international edition.
Mark D. Hill, Norman P. Jouppi Gurindar S. Sohl (2000), Readings in computer architecture.
M. Morris Mano, Computer System Architecture 3rd edition, Prentice Hall.
John L. Hennessy & David A. Patterson (2003), Computer Architecture, A Quantitative Approach. 3rd edition,
Morgan Kaufmann Publishers.
Miles J. Murdocca & Vincent P. Heuring (2000), Principles of Computer Architecture, Prentice-Hall, Inc.
R. D. Dowsing, F. W. D. Woodhams & I. Marchall (2000), 2nd edition, Computers from Logic to Architecture.
The McGraw-Hill Companies.
Dezso Sima, Terence Fountain & Peter Kacsuk, (1997) Pearson Education, Advanced Computer
Architectures, A design space Approach. Pearson Education.
COVENANT UNIVERSITY
COURSE COMPACT
2013/2014 Academic Session
College:
Science and Technology
Department:
Computer and Information Sciences
Programmes:
o
o
B.Sc. Computer Science
B.Sc. Management Information System
Course Code:
CSC 310
Course Title:
Internet Programming
Units:
2
Course Lecturers:
Dr. A. A. Azeta and Mrs A. A. Oni
Semester:
Alpha – 2013/2014
Time:
Tuesday 5 – 7 pm
Location:
Hall 307
iii. Brief Overview of Course
The course is designed to introduce students to the art of web design, implementation, maintenance
and hosting. The totality of this is to develop manpower for the ever-green and promising field of
electronic and Internet business.
jjj. Course Objectives
 Introduce students to the Internet and transmission protocols.
 Teach students the fundamentals of web design.
 Teach students the use of HTML, CSS, PHP and Java scripts.


kkk.
Teach students Front-end and Back-end scripting Language.
Teach the concept of managing and hosting web sites.
Methods of Lecture Delivery/Teaching Aids

Lecture Delivery Methods
 Interactive classroom session
 Group assignments
 Lecture notes

Teaching Aids
 Multimedia projection
 Computer Laboratory
lll. Course Outline:
 Modules & Details of Topics
Module I
Overview of Internet and Web Basics
Week 1. Overview of Distributed Computing, Mobile & Wireless computing,
Mobile Web page Design Tools. Network Security; Client/Server Computing
(using the web). Overview of the Internet, Domain Names, Internet
Protocols. Browsers: Netscape Communicator, Internet Explorer, Browser
Plug-ins, Helper Applications, Web Authoring Tools, and Internet Hardware
Requirements.
Module II
Web Design using HTML
Week 2:Structure of Web Application, Browsers and Web Servers, Front-end, Middleware and
Back-end Scripting Languages. Introduction to Hypertext Markup Language, HTML
Standards, HTML Extensions and Types of WebPages.
Week 3: Web page Basics: HTML Tags, Text and Information, Links, Lists, Tables,
Multimedia: Graphics. Audio, Video, Enhanced Features: Image Maps.
Counters, User Interaction, Dynamic Web Pages.
Module III
Introduction to Cascading Style Sheets (CSS)
Week 4. Meaning of CSS, difference between CSS and HTML, benefits of CSS
Week 5. The Basic CSS Syntax, applying CSS to HTML Syntax, and properties of CSS
Module IV
Web Design using PHP and MySQL
Week 5 and 6:Introduction to PHP
Week 7.
Dynamic Web Pages, Database design and management using MySQL
Module V Web Design using Java script
Week 8.
Introduction to JavaScript
Week 9.
CGI, PERL, Java, Design Considerations, Active Server Page,
Module III
Managing and Hosting Web Sites
Week 10:
Designing and Managing Web sites, Connecting to the Web Provider,
Publishing WebPages,
Week 11:
Website Maintenance Tools, Factors Affecting Website Performance,
Interfacing with Other Information Servers.
mmm.
Tutorials
 Review the basic features of some web sites.
 Identify basic features of e-Auction, e-Commerce, e-Government and e-Learning Web sites.
 Review of HTML, CSS, PHP and Java script syntax

nnn.
Structure of the Programme/Method of Grading


Continuous Assessment
o Class test/Assignments
o Mid Semester test
20 Marks
10 Marks
Examination
70 Marks
ooo.
Ground Rules & Regulations
o 75% Attendance is required to seat for the examination.
o Assignments must be submitted as at when due.
o Contributions to group discussion and class work are noted.
o Punctuality to classes to be observed
ppp.
Topics of Term Papers/Assignment/Student Activities

Practical Web Design Assignments:
o Development of an e-Commerce site
o Development of an m-Commerce site
o Development of a shopping Cart
o Development of an e-Learning Site
etc.
qqq.
Alignment with Covenant University Vision/Goals
The Internet has remained a dominant platform upon which businesses are transacted as well as a
medium for information is transmission globally. The students are groomed to provide solutions to
a wide array of technical and business problems on this platform through the skills acquired in the
course.
rrr. Contemporary Issues/Industry Relevance
Web site is a dominant feature of most organizations and virtually all business enterprises strive to
maintain this status quo. By implication, Internet programmers will continue to be in high demand.
sss. Recommended Reading/Texts
7. Programming the web using XHTML and JavaScript by Larry Randles. McGraw -Hill publisher
8.
9.
10.
11.
12.
MySQL/Php database Applications by Jay Greenspan and Bradbulger
JavaScript -the definite guide by David Flannagan
PHP cookbook by David Sklar, Adam Trachtenbeg
PHP and MySQL Web Development By Luke Welling and Luara Thomson, SAMS, USA
Learning WML & WMLScript O Reilly (Martin Frost)
COVENANT
UNIVERSITY, OTA
College of Science & Technology
Department of Computer &
Information Sciences
2013 – 2014 Academic Session, Alpha Semester
Course Compacts, CSC 213
Structured Programming (3 Units).
Course Lecturers: Mr. B. ODUSOTE & Mr. C. AJIEH
COLLEGE OF SCIENCE AND TECHNOLOGY
SCHOOL OF NATURAL AND APPLIED SCIENCES
DEPARTMENT OF COMPUTER AND INFORMATION SCIENCES
COURSE LECTURE OUTLINE
CC.
Session
Semester
Course Title
Course Code
Course Unit
Programmes
Level
Venue
Day & Time
Lecturers
Contacts
Offices
COURSE INFORMATION
2013/2014 Academic Session
Alpha semester
Structured Programming
CSC 213
Three (3) Units
BSc. Computer Science and BSc. Management Information System
200
CST Hall 107 & Computer Lab
Mon. 4pm -6pm & Tues. 11am-12noon
Mr Odusote Babafemi, Mr Ajieh Cyril
femi.odusote/[email protected]
Conference Room, 2nd Floor, CST Building & RM 167, Lecture Theater.
DD.
COURSE OVERVIEW
The course introduces structured program using Python Programming Language. The students’ are
exposed to the principles and core concepts of structured programming.
EE.
COURSE GOAL/OBJECTIVES
The primary goal of this course is that the students should be able to display a high level of
proficiency in the use and application of Python Programming Technologies & Techniques.
The Objectives are as follows:
At the end of this course, students are expected to:
 Understand the core concept of structured programming
 Differentiate between structured programming paradigm and other contemporary paradigms

Identify the important advantages of structured programming over unstructured ones

Learn and apply the fundamental concepts of Python programming language for program
development
Acquire competence in writing computer programs in Python using constructs such Lexical
Structures, Strings, Lists, Tuples, Dictionaries and Control Structures.

FF. MODE OF LECTURE DELIVERY AND TEACHING AIDS
 Lecture Delivery Methods
o Guided Instructions
o Lecture Notes Delivery (In Powerpoint Format)
o On-hands Laboratory Practical Sessions
o Interactive Classroom Students’ Engagement Sessions
o Group and Individual Assignments/Tasks
o Live Quizzes to assess the immediate students’ understanding of concepts.
 Teaching Aids
o Overhead Multimedia Projector & Sound System
o Laboratory Computer Systems
o Software Applications Installation & Usage
GG.
ASSIGNMENTS AND GRADING POLICIES
SN
Task
1. Assignments and Tests
2. Mid-Semester Test
Continuous Assessment
3. Semester Examination
Score
15 marks
15 marks
30 marks
70 marks
Total Mark Obtainable
100 marks
HH.
o
o
o
o
o
GROUND RULES AND REGULATIONS
Attendance in class is compulsory to participate in any assignment and tests.
Punctuality and Sense of Responsibility is compulsory for all students.
Minimum 75% Attendance is required to seat for the semester examination.
All Assignments must be done promptly and submitted at the set lifelines.
Contributions to group discussion and class work will be noted and graded.
II. Students Task/Assignments
o All Tasks & Assignments will entail Practical & Real Life Problems-solving using
the Python Programming language.
JJ. Course Content Preparation & Distribution
The course content as highlighted below will be taught in modules and each instructor will be
responsible to prepare the notes and other resources that will be used for that particular topic or
module. Adequate laboratory hands-on practical demonstration of the theory taught must be carried
out alongside the theory.
o Course Content:
Structured Programming: Definitions and Features. Brief History and Rationale, Comparison of
structure-oriented programming with other contemporary paradigms, important advantages of
structured programming over unstructured ones. Pseudo Codes, Algorithms and Flowcharts. Topdown design - stepwise refinement; Modular design – abstraction modularity. Lexical elements,
Data Types, Operators And Expressions, Control Structures - Sequence, Selection and Repetition,
Composite structures such as Lists, Tuples and Dictionaries, Functions and modules, File
Processing. Python features, Interactive shell environment and IDEs, Lexical elements, Data types,
Operators and Operands, Expression, Statement, branching, conditionals and iteration. Basics of
data representation and manipulation including: Tuples, Lists, Dictionaries, and Sets. Function
basics, Local variables, Parameters and arguments, Recursion, Module basics, Exceptions, Testing
and Debugging, Sorting and Searching. Text files processing, Database Connection and operations,
Tkinter Module, Basic GUI Construction, Models, Views, and Controllers (MVC). Python Django
Framework setup and basics & Hands-on Practical.
KK.
Assessment and Grading
Each instructor is expected to prepare his/her own questions for mid-semester and final
examinations, based on the content provided during teaching. The course coordinator will determine
the final output of the examination questions which will show the order and the number of
questions to be used for the examinations. Each question will be marked and graded by the
Instructor who prepared the question.
LL.
Lecture Note Preparation Format
10. Introduction and Overview of the Topic
11. Use, Importance and Relevance of the Concepts.
12. The use of the various functionalities and features Application Software & Tools.
13. Hands-on practical with relevant examples.
14. Live examples & class exercises.
MM.
Course Outline & Schedule.
Module 1-5: Structured Programming Techniques / Methodologies & Python Fundamentals
Lecture
No.
1.
2.
3.
4.
5.
6.
Lecture Title
Structured Programming Definitions
and Features, Brief History and
Rationale, Comparison of structureoriented programming with other
contemporary paradigms, important
advantages of structured programming
over unstructured ones.
Pseudo
Codes,
Algorithms
and
Flowcharts. Top-down design stepwise refinement; Modular design –
abstraction modularity.
Lexical
elements,
Data
Types,
Operators And Expressions, Control
Structures - Sequence, Selection and
Repetition, Composite structures such
as Lists, Tuples and Dictionaries,
Functions and modules, File Processing.
Python Fundamentals: Python features,
Interactive shell environment and IDEs.
Hands-on Lab Practical on all concepts
taught.
*Students’ Group Assignments
Lexical elements, Data types, Operators
and Operands, Expression, Statement,
branching, conditionals and iteration.
*Course Test (1)
Python Composite Structures, Functions
and modules. Hands-on Lab Practical
on all concepts taught.
Lecture
Week
Lecture Date
Instructors
Week 1
Mon. Aug. 12
&Tue. Aug. 13,
2013
Mr C. Ajieh
Mon. Aug. 19
&Tue. Aug. 20,
2013
Mr C. Ajieh
Mon. Aug. 26
&Tue. Aug. 27,
2013
Mr Odusote
Mon. Sept. 2
&Tue. Sept. 3,
2013
Mr Odusote
Mon. Sept. 9
&Tue. Sept. 10,
2013
Mr C. Ajieh
Week 2
Week 3
Week 4
Week 5
Week 6
Mon. Sept. 16
&Tue. Sept. 17,
2013
Mr Odusote
Mr Odusote
Mr C. Ajieh
Mr C. Ajieh
Mr Odusote
Mr C. Ajieh
Mr Odusote
Module 6-7: File Processing & GUI & Introduction to Python Framework
Lecture
No.
7.
8.
Lecture Title
Lecture
Week
Lecture Date
Instructor
Basics of data representation and
manipulation including: Tuples, Week 7
Lists, Dictionaries, and Sets
Mon. Sept. 23
&Tue. Sept. 24,
2013
Mr Odusote
Function basics, Local variables,
Parameters
and
arguments, Week 8
Mon. Sept. 30,
2013
Mr C. Ajieh
Mr Odusote
Recursion,
Module
basics,
Exceptions, Testing and Debugging,
Sorting and Searching.
9.
Mr C. Ajieh
File Processing: Text files processing,
Database Connection and operations, Week 9
Tkinter Module
Mon. Oct. 7 &
Tue.Oct. 8, 2013 Mr C. Ajieh
GUI: Basic GUI Construction, Models,
Mon. Oct. 14 &
Tue. Oct. 15,
2013
Mr Odusote
10.
Views, and Controllers (MVC).
Week 10
*Test (2): Mid-Semester Exam.
11.
Python Django Framework setup and
basics & Hands-on Practical.
*Students Group Assignments
12.
13
Mr Odusote
Week 11
Mon. Oct. 21 &
Tue. Oct. 22,
2013
Mr C. Ajieh
Mr Odusote
Real
Life
Problems-solving using the Python Week 12
Programming language.
*Students’ Assignments
Revision on Taught Concepts &
Week 13
Upload of Lecture Attendance.
Hands-on
Mr C. Ajieh
Practical:
Mon. Oct. 28 &
Tue. Oct. 29,
2013
Mr C. Ajieh
Mr Odusote
Mon. Nov. 4 &
Tue. Nov. 5,
2013
Mr C. Ajieh
Mr Odusote
***
Alpha Semester Examination
Week 14-15
Mon. Nov 11 –
Fri. Nov 22, 2013
Mr Odusote
Mr C. Ajieh
NN.
Course Resources & Recommended Texts
o Instructors: Mr. B.O Odusote & Mr. C. Ajieh
o E-Learning Platform: Covenant University ELearning
http://learn.covenantuniversity.edu.ng/
o
Recommended Reading:
4. "Practical Programming: An Introduction to Computer Science Using Python " by Jennifer
Campbell,Paul Gries,Jason Montojo and Greg Wilson, The Pragmatic Bookshelf Raleigh, North
Carolina Dallas, Texas, 2009.
5. “Learning Python”, Third Edition by Mark Lutz Copyright © 2008 O’Reilly Media, Inc.
6. “How to Think Like a Computer Scientist: Learning with Python” Copyright c 2002 Allen
Downey, Jeffrey Elkner, and Chris Meyers. Edited by Shannon Turlington and Lisa Cutler.
Cover design by Rebecca Gimenez. Printing history: April 2002: First edition
o
Reference: Python Online Documentation
o Interpreter: Python Interpreter 2.7.2.5 and Django-1.4.3
OO.
Alignment with Covenant University Vision & Goals.
The students are groomed and equipped with the relevant IT skills required to thrive as new
generation leaders of their fields of endeavour in the external contexts, outside the walls of the
University.
PP. Contemporary Issues/Industry Relevance
The current trends and influence of IT in all field of human endeavour necessitates the need to
equip the student with relevant and requisite applicable IT knowledge and skillset sufficient enough
to secure a place for them in the Industry. With a course like this, such knowledge and skillset is
easily delivered to the students without which they would not be able to thrive within the Industry.
COVENANT UNIVERSITY, OTA
2013/2014 Academic Session
COURSE COMPACT FOR MAT313
College: Science and Technology
School: Natural & Applied Sciences
Department: Mathematics
Programme: Industrial Mathematics
Course Code: MAT313
Course Title: Complex Analysis I
Units: 2
Course Lecturers: DR. M.C. AGARANA & MR O.O. AGBOOLA
Semester: Alpha
Time: Monday, 12:00 Noon – 2:00 pm
Location: Hall 102 (CST Building)
A. BRIEF OVERVIEW OF COURSE
This is the first course (of two) in the sequence "Complex Analysis." It is a third-year
undergraduate level course on complex analysis. Complex analysis is an extremely useful and
beautiful part of mathematics and forms the basis of many techniques employed in many branches
of mathematics and physics. In this course, some basic rudiments of complex analysis will be
studied. The notions of derivatives, familiar from calculus, will be extended to the case of complex
functions of a complex variable. In fact, analytic functions form the centrepiece of this course. It is
a prerequisite for MAT418 (Complex Analysis II).
B. COURSE OBJECTIVES/GOALS
In this course students will learn the algebra and geometry of complex numbers, mappings in the
complex plane, the theory of multi-valued functions and the calculus of functions of single complex
variable. In particular, students after completing this course are expected to be able to





perform basic mathematical operations (arithmetics, powers, roots) with complex numbers
in Cartesian and polar forms;
determine continuity/differentiability/analyticity of a function and find the derivative of a
function;
work with functions (polynomials, reciprocals, exponential, trigonometric, hyperbolic, etc)
of single complex variable and describe mappings in the complex plane;
work with multi-valued functions (logarithmic, complex power) and determine branches of
these functions;
determine whether a series is convergent or divergent by using the ratio test
C. METHOD OF DELIVERY /TEACHING AIDS
The course has an in-class component and an out-of-class component. The in-class component will be a
combination of lectures, problem solving demonstrations, discussions, questions/answers and short
problem solving activities. In the out-of-class component, students are expected to read and review their
notes and textbooks, and complete homework problems.
Classroom Powerpoint presentations will be used to reinforce concepts. Many sample problems will
be presented on overhead transparencies. Students will be led step-by-step through various thinking
and problem solving strategies to solve many kinds of problems. Students will be given ample
opportunity to practice solving problems through in-class assignments as well as through homework
assignments.
D. COURSE OUTLINE
Course Outline and Weekly Course Coverage Calendar
Week 1 (12-08-2013)
Review of the field of Complex Numbers and Complex Algebra
Week 2 (19-08-2013)
Functions of a complex variable: polynomials, rational, trigonometric, hyperbolic, logarithmic
functions and their inverses and branch point
Week 3 (26-08-2013)
Functions of a complex variable: logarithmic functions; the inverses of trigonometric, hyperbolic
and branch point
Week 4 (02-09-2013)
Limit and continuity of a complex-valued function of a complex variable
Week 5 (09-09-2013)
Test #1
Week 6 (16-09-2013)
Differentiation: complex derivative
Week 7 (23-09-2013)
Analytic functions and the Cauchy-Riemann equations
Week 8 (30-09-2013)
Sequences and series of functions of complex variables
Week 9 (07-10-2013)
Convergence of sequences and series of functions of complex variables
Week 10 (14-10-2013)
Test #2
Week 11 (21-10-2013)
Absolute and uniform convergence
Week 12 (28-10-2013)
Tutorials and Revision
Week 13 (04-11-2013)
Tutorials and General Revision
Week 14 & 15 (Final exam) - (11-11-2013 to 22-11-2013)
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Each student will be evaluated on the basis of performance in each of the following areas:
10. Attendance at class meetings, In-class work / group work (periodically), quizzes (some
quizzes may be unannounced), homework, collected and graded and solutions provided
(counting for 10% of the total course marks);
11. Two tests, 1-hour duration for each (counting for 20% total of the course marks) and
12. One (1) End-of-semester examination, 2 hours duration counting for 70% of the total
course marks.
G. GROUND RULES & REGULATIONS
Students would be required to maintain high level of discipline (which is the soul of an army) in the
following areas:






Regularity and punctuality at class meetings – Because regular participation enhances the
learning process, students are expected to adhere to the attendance policy set forth by the
University. Therefore, students are strongly encouraged to attend all classes to better prepare
them for assignments, tests and other course-related activities;
Modest dressing;
Good composure;
Regardless of the cause of absences, a student who is absent six or more days in a semester
is excessively absent, and will not receive credit unless there are verified extenuating
circumstances.
A note on academic honesty: Collaboration among students to solve homework
assignments is welcome. This is a good way to learn mathematics. So is the consultation of
other sources such as other textbooks.
However, every student should hand in an own set of solutions, and if you use other people's
work or ideas you should indicate the source in your solutions.
(In any case, complete and correct homework receives full credit.)
Late homework assignments will NOT be accepted.
H. TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITIES
Group projects will be assigned at the discretion of the course tutor/facilitator.
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS
Prayers are to be offered at the beginning of lectures. Presentation of the learning material will be
done in such a way that the knowledge acquired is useful and applicable. Efforts would be made to
address students on godliness, integrity and visionary leadership.
J. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
Complex analysis is useful in many branches of mathematics, including algebraic geometry,
number theory, applied mathematics; as well as in physics, including hydrodynamics,
thermodynamics, mechanical engineering and electrical engineering.
K. RECOMMENDED READING/TEXT
1. Advanced Engineering Mathematics 3rd Edition by Dennis G. Zill & Michael R. Cullen (2006)
(Publishers: Jones & Bartlett Publishers)
2. A First Course in Complex Analysis with Applications by Dennis G. Zill & Patrick D. Shanahan
(Publishers: Jones & Bartlett Publishers)
COVENANT UNIVERSITY, OTA
2013/2014 Academic Session
COURSE COMPACT FOR MAT212
College: Science and Technology
School: Natural & Applied Sciences
Department: Mathematics
Programme: Industrial Mathematics
Course Code: MAT212
Course Title: Mathematical Methods I
Units: 2
Course Lecturers: DR. MRS S.A. BISHOP & MR O.O. AGBOOLA
Semester: Alpha
Time: Tuesdays, 1:00 pm – 3 pm; Fridays, 11:00 am – 12:00 Noon
Location: Hall 308 (CST Building)
A. BRIEF OVERVIEW OF COURSE
This is the first course (of two) in the sequence "Mathematical Methods." This course is designed to
teach students about a variety of mathematical methods which are used in modelling through their
application to solving real world problems. To study this course students should have a sound
knowledge of algebra, calculus, and geometry as provided by MAT111 (Algebra) and MAT121
(Calculus). MAT212 is a prerequisite for MAT222 (Mathematical Methods II).
B. COURSE OBJECTIVES/GOALS
Objectives: At the end of the course students will be able to:

relate the concepts of limit and continuity studied in MAT121 to function of several
variables




carry out partial differentiation of function of several variables
apply the concept of Lagrange multiplier techniques to finding the minima and
maxima of functions of several variables
find higher derivatives of functions of several variables
carry out Taylor series and Maclaurin series expansion of functions of several
variables.
C. METHOD OF DELIVERY /TEACHING AIDS
The course has an in-class component and an out-of-class component. The in-class component will
be a combination of lectures, problem solving demonstrations, discussions, questions/answers and
short problem solving activities. In the out-of-class component, students are expected to read and
review their notes and textbooks, and complete homework problems.
Classroom Powerpoint presentations will be used to reinforce concepts. Many sample problems will
be presented on overhead transparencies. Students will be led step-by-step through various thinking
and problem solving strategies to solve many kinds of problems. Students will be given ample
opportunity to practice solving problems through in-class assignments as well as through homework
assignments.
D. COURSE OUTLINE
Course Outline and Weekly Course Coverage Calendar
Week 1 (L: 13-08-2013 & T: 16-08-2013)
Partial differentiation: application
Week 2 (L: 20-08-2013 & T: 23-08-2013)
Maxima and Minima of Functions of two variables: Classification of critical points of functions of
two variables
Week 3 (L: 27-08-2013 & T: 30-08-2013)
Constrained Maxima and Minima and Lagrangian multipliers
Week 4 (L: 03-09-2013 & T: 06-09-2013)
Differentiation of Integrals: Leibniz’rule Pt. I
Week 5 (L: 10-09-2013 & T: 13-09-2013)
Test #1
Week 6 (L: 17-09-2013 & T: 20-09-2013)
Differentiation of Integrals: Leibniz’rule Pt. II
Week 7 (L: 24-09-2013 & T: 27-09-2013)
Coordinate system: change from Cartesian to polar, spherical and cylindrical coordinate systems.
Week 8 (L: --------- & T: 04-10-2013)
Coordinate system: change from Cartesian to polar, spherical and cylindrical coordinate systems II
Week 9 (L: 08-10-2013 & T: 11-10-2013)
Taylor’s and Maclaurin’s series Pt. I
Week 10 (L: 15-10-2013 & T: 18-10-2013)
Test #2
Week 11 (L: 22-10-2013 & T: 25-10-2013)
Taylor’s and Maclaurin’s series Pt. II
Week 12 (L: 29-10-2013 & T: 01-11-2013)
Differential coefficients of the nth order
Week 13 (05-11-2013 & 08-11-2013)
Tutorials and General Revision
Week 14 & 15 (Final exam) – (11-11-2013 to 22-11-2013)
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Students’ grades in the course will be determined from their total scores weighted as follows:
Attendance at class meetings, in-class wrok / group work (periodically), quizzes (some quizzes may
be unannounced) 10%, Two tests 20%, Final Exam 70%.
G. GROUND RULES & REGULATIONS
Students would be required to maintain high level of discipline (which is the soul of an army) in the
following areas:






Regularity and punctuality at class meetings – Because regular participation enhances the
learning process, students are expected to adhere to the attendance policy set forth by the
University. Therefore, students are strongly encouraged to attend all classes to better prepare
them for assignments, tests and other course-related activities;
Modest dressing;
Good composure;
Regardless of the cause of absences, a student who is absent six or more days in a semester
is excessively absent, and will not receive credit unless there are verified extenuating
circumstances.
A note on academic honesty: Collaboration among students to solve homework
assignments is welcome. This is a good way to learn mathematics. So is the consultation of
other sources such as other textbooks.
However, every student should hand in an own set of solutions, and if you use other people's
work or ideas you should indicate the source in your solutions.
(In any case, complete and correct homework receives full credit.)
Late homework assignments will NOT be accepted.
H. TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITIES
Group projects will be assigned at the discretion of the course tutor/facilitator.
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS
Prayers are to be offered at the beginning of lectures. Presentation of the learning material will be
done in such a way that the knowledge acquired is useful and applicable. Efforts would be made to
address students on godliness, integrity and visionary leadership.
J. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
This course will provide the mathematical background for optimization and develop
mathematical thinking.
K. RECOMMENDED READING/TEXT
G. Stephenson (1977). Mathematical Methods for Science Students. London and New York:
Longman.
P. D. S. Verma (1995). Engineering Mathematics. New Delhi: Vikas Publishing House PVT
Ltd.
COVENANT UNIVERSITY, OTA
2013/2014 Academic Session
COURSE COMPACT FOR MAT112
College: Science and Technology
School: Natural & Applied Sciences
Department: Mathematics
Programme: Industrial Mathematics
Course Code: MAT112
Course Title: Trigonometry and Analytical Geometry
Units: 2
Course Lecturers: DR. T.A. ANAKE & AGBOOLA, O. O.
Semester: Alpha
Time: Wednesday, 12:00 Noon – 2:00 pm
Location: Lecture Theatre I
A. BRIEF OVERVIEW OF COURSE
This course is a preparation course intended for students majoring in engineering, mathematics,
physics, chemistry, computer science or certain vocational fields. The course is a study of both
trigonometric and conic functions and equations. Both rectangular and polar coordinates are
studied.
B. COURSE OBJECTIVES/GOALS
• To introduce trigonometric functions and their applications.
• To introduce exponential functions and their applications
• To introduce logarithmic functions and their graphs.
• To study the basic properties of logarithmic functions.
• To study lines, planes and conic sections
Specific Learning Outcomes: Upon successful completion of this course the student should be able to:
1. Define the trigonometric ratios and find these ratios for arbitrary angles.
2. State and apply the basic trigonometric identities.
3. Solve application problems involving triangles.
4. Sketch graphs involving the trigonometric functions.
5. State and apply the inverse trigonometric functions.
6. Verify trigonometric identities.
7. Solve trigonometric equations.
8. describe a conic section and solve related problems
C. METHOD OF DELIVERY /TEACHING AIDS
The course has an in-class component and an out-of-class component. The in-class component will be a
combination of lectures, problem solving demonstrations, discussions, questions/answers and short
problem solving activities. In the out-of-class component, students are expected to read and review their
notes and textbooks, and complete homework problems.
Classroom Powerpoint presentations will be used to reinforce concepts. Many sample problems will
be presented on overhead transparencies. Students will be led step-by-step through various thinking
and problem solving strategies to solve many kinds of problems. Students will be given ample
opportunity to practice solving problems through in-class assignments as well as through homework
assignments.
D. COURSE OUTLINE
Course Outline and Weekly Course Coverage Calendar
Week 1 (14-08-2013)
Trigonometric Functions
1.1. Angles and Their Measurement
1.2. Right Triangle Trigonometry
1.3. Computing Values
Week 2 (21-08-2013)
2.1 Circular Measure (Radian Measure)
2.2. Trigonometric Functions of General Angles
2.3 Applications of Trigonometric functions (Angles of elevation and depression, bearing, etc)
Week 3 (28-08-2013)
3.1 Graphs of Sine and Cosine Functions
3.2 Graphs of Tangent, Cotangent, Secant, and Cosecant Functions
3.3 The Inverse Sine, Cosine and Tangent Functions
3.4 Inverse Functions Continued
Week 4 (04-09-2013)
4 Trigonometric Identities
4.1 Sum and Difference Formulas
4.2 Double Angle and Half-angle Formulas
Week 5 (11-09-2013)
Test #1
Week 6 (18-09-2013)
Trigonometric Equations
Week 7 (25-09-2013)
Exponential, Logarithmic and Hyperbolic functions
Week 8 (02-10-2013)
Analytic Geometry I: Equations of lines and planes
Week 9 (09-10-2013)
Analytic Geometry II: Conics (Circle, Parabola, Ellipse and Hyperbola) Pt. I
Week 10 (16-10-2013)
Test #1I
Week 11 (23-10-2013)
Analytic Geometry II: Conics (Circle, Parabola, Ellipse and Hyperbola) conts.
Week 12 (30-10-2013)
Analytic Geometry II: Conics (Circle, Parabola, Ellipse and Hyperbola) – conts.
Week 13 (06-11-2013)
Revision
Week 14 & 15 (Final exam) - (11-11-2013 to 22-11-2013)
F. STRUCTURE OF PROGRAMME/METHOD OF GRADING
Each student will be evaluated on the basis of performance in each of the following areas:
13. Attendance at class meetings, In-class work / group work (periodically), quizzes (some
quizzes may be unannounced), homework, collected and graded and solutions provided
(counting for 10% of the total course marks);
14. Two tests, 1-hour duration for each (counting for 20% total of the course marks) and
15. One (1) End-of-semester examination, 2 hours duration counting for 70% of the total
course marks.
G. GROUND RULES & REGULATIONS
Students would be required to maintain high level of discipline (which is the soul of an army) in the
following areas:






Regularity and punctuality at class meetings – Because regular participation enhances the
learning process, students are expected to adhere to the attendance policy set forth by the
University. Therefore, students are strongly encouraged to attend all classes to better prepare
them for assignments, tests and other course-related activities;
Regardless of the cause of absences, a student who is absent six or more days in a semester
is excessively absent, and will not receive credit unless there are verified extenuating
circumstances
Students will be given assignments periodically. Students may work together to understand
these assignments, but all work submitted must be the student’s original work. There is a
distinct difference between providing guidance and instruction to a fellow student and
allowing the direct copying of another’s answers or work.
Late homework assignments will NOT be accepted.
Modest dressing; and
Good composure.
H. TOPICS FOR TERM PAPERS/ASSIGNMENTS/STUDENT ACTIVITIES
Group projects will be assigned at the discretion of the course tutor/facilitator.
I. ALLIGNMENT WITH COVENANT UNIVERSITY VISION/GOALS
Prayers are to be offered at the beginning of lectures. Presentation of the learning material will be
done in such a way that the knowledge acquired is useful and applicable. Efforts would be made to
address students on godliness, integrity and visionary leadership.
J. CONTEMPORARY ISSUES/INDUSTRY RELEVANCE
The course will lay a solid foundation for the students in applied Mathematics and
Engineering.
K. RECOMMENDED READING/TEXT
 R. T. Smith & R. B. Minton. Calculus (Multivariable), 2nd ed., McGraw-Hill. (2002).
 C. H. Edwards & D. E. Penney. Calculus, 6th ed., Prentice Hall: New Jersey. (2002).
 S. K. Stein & A. Barcellos. Calculus and Analytic Geometry, 5th ed., McGraw – Hill Inc.:
New Jersey. (1992).
 K. T. Tang. Mathematical Methods for Scientists and Engineers, Vol. II, Springer: New
York. (2007).
 R. Wrede & M. R. Spiegel. Schaum’s Outline of Theory and Problems of Advanced
Calculus, 2nd ed., Mc-Graw-Hill: New York. (2002).
COVENANT UNIVERSITY, OTA
College:
Science and Technology
Department:
Computer and Information Sciences
Programme:
Management Information System
Course Code:
MIS 316
Course Title:
Business Research Methods
Units:
3
Course Lecturer:
Dr. Osamor V.C. and Mrs. Oladimeji T.
Semester:
Alpha 2013/2014
Time:
10 - 12 noon ( Tuesday) and 12-1pm (Wednesday)
Location:
Hall 107 and Hall 308
a.
Brief overview of course
b.
Course Objectives
c.
Method of Lecture delivery/Teaching Aids
Lecture Delivery:

Guided instruction

Interaction classroom session

Student group assignments

Lecture notes
Teaching Aid


Overhead projection
Multimedia projection
d.
Course Outline
Module 1
Introduction to research methods
Week 1:
Basic concepts in scientific inquiry; Scientific Research: Meaning, basic steps.
Weeks 2& 3:
Basic and applied research concepts, theories, laws, hypotheses, research design, choosing
a research topics.
Module 2
Qualitative and theoretical issues in research methods
Weeks 4& 5:
Problem analysis, literature reviews, modeling building/conceptual, the research proposal
Weeks 6
Sampling techniques
Weeks 7 & 8:
Data collection techniques, data types (primary, secondary, etc) data collection strategies,
surveys, experiments.
Weeks9:
Content analysis motivation research, data measurement, analysis and interpretation:
measurement scaling, validity, reliability analysis.
Weeks10&11: Quantitative statistical data presentation: tables, charts, cross tabs etc. Report audience,
types and length, mechanical aids.
Module 3
Case Study
Week 12:
Business research in Nigeria; problems and possibilities.
Week 13:
Revision
e.
Tutorial
f
Structure of the Programme/Method of Grading
1.
2.
Continuous Assessment
30 marks
i.
Class test
15 marks
ii.
Assignment/Term Paper
15 marks
Examination
70 marks
g.
Ground rules & regulation





Recorded over 75 % average class attendance.
Students displayed a good sense of responsibility and decorum.
Class assignments are taken seriously.
Students engaged actively in all class activities.
Punctuality to class is expected of every student
h.
Topics for term papers/Assignment/Students activities
i.
Alignment with Covenant University Vision/Goals
j.
Contemporary issues/Industry relevance
k.
Recommended Reading/Text
College:
Department:
Programme:
Course Code:
Course Title:
Units:
Course Lecturer:
Semester:
Time:
Location:
COVENANT UNIVERSITY, OTA
Science and Technology
Computer and Information Sciences
Computer Science and Management Information System
CIS 319
Statistical Computing
3
Dr. Osamor V.C. and Mrs. Oladimeji T.
Alpha 2013/2014
3 - 5 pm ( Wednesday)
Computer Lab
a.
Brief overview of course
Computational data analysis is highly necessary in modern research and statistics is
normal used to draw conclusion and provide the needed knowledge. Since most tools in
Linux are open source, it is also imperative to study the Linux environment.
b.
Course Objectives
The objective of this course is to use computational software such as R and or SPSS to
solve statistical problems.
c.
Method of Lecture delivery/Teaching Aids
Lecture Delivery:

Guided instruction

Interaction classroom session

Student group assignments

Lecture notes
Teaching Aid

Overhead projection

Multimedia projection
d.
Course Outline
Module 1
Week 1:
Introduction to Linux
Basic concepts of Linux
Weeks 2& 3: Linux commands and installation of R / SPSS.
Module 2
Statistical Analysis
Weeks 4& 5: Quantitative statistical data presentation: tables, charts, cross tabs etc.
Weeks 6
Regression and Correlation analysis
Weeks 7 & 8: Parametric Testing
Weeks9:
Non parametric Testing
Weeks10&11: Data measurement, analysis and interpretation: measurement scaling,
validity, reliability analysis.