KU/ACAD/SOP/8.
5-
KENYATTA UNIVERSITY Ref.:
3
QUALITY MANAGEMENT SYSTEM
Ver.: 1.0
SMA 102: Basic Mathematics Course Outline
Title: Date: 05/09/2023
Pre-requisite 35 Contact Hours
None
Purpose of the Course
To equip students with basic mathematical skills which build the foundation of Mathematics.
Expected Learning Outcomes of the course
By the end of the course the learner should be able to;
1. Apply the Factor and Remainder theorems to solve problems.
2. Apply permutations, combinations and the Binomial expansions to solve problems.
3. Use Venn diagrams and laws of set theory to solve problems.
4. Categorize a compound proposition as a tautology, contradiction or contingency.
Course Content (Revised)
Quadratic equations and inequalities. Remainder and Factor Theorem and their applications.
Permutations and combinations, Binomial theorem and its applications. Set theory: Basic operations
on sets, Laws of set theory, Venn diagrams and application. Logic: Propositions, compound
propositions and truth tables. Methods of proof: Direct, indirect, Induction, contradiction, cases,
counter examples. Complex numbers: Arithmetic operations, Geometric representations and polar
form. De Moivre’s Theorem and its applications.
Mode of Delivery
Class lectures, tutorials, discussions, problem solving, exercises.
Instructional Materials and/or Equipment
Whiteboard/chalkboard, overhead projector, smart board
Course Assessment
Continuous assessment tests: 30%
Final examination: 70%
Core Reading Materials for the Course
1. Backhouse, J.K. and Houldsworth, S.P.T (2000). Pure Mathematics I & II. London: Longman
Group.
2. Goldstein, L., Schneider, D. and Siegel, M. (1998). Finite Mathematics and its applications, 7th Ed.,
Prentice Hall.
Recommended Reading Materials for the Course
1. Grimaldi, R.P. (2004). Discrete and Combinatorial Mathematics. An applied introduction, 5th Ed.,
Pearson Addison Wesley.
2. Edgar, G., Goodaire, M., Parmenter, M. (2002). Discrete Mathematics with graph theory, 2nd Ed.
Journals
1. Discrete Mathematics journal
Teaching Schedule
Week Topics
1 Quadratic equations and inequalities
2 Remainder and Factor Theorem and their applications
3 Permutations
4 Combinations
5 Binomial theorem and its applications
6 Set theory: Basic operations on sets, Laws of set theory, Venn diagrams
7 CAT I
Applications of set theory
8 Logic: Propositions, compound propositions and truth tables
9 Methods of proof: Direct, indirect, induction, contradiction, cases, counter examples
10 Complex numbers: Arithmetic operations, Geometric representations and polar form
11 CAT II
De Moivre’s Theorem and its applications
12 & 13 FINAL EXAMINATION
Groupings
A1: I162, I163 and NON CBC Education Retakers
A2: I20, I122
A3: CO1, I71, I73