KMA 2105: Discrete Mathematics
Contact Hours: 45
Pre-requisite: None
Course Purpose
To equip the learner with skills in proofs and rigorous analytical thinking.
Expected Learning Outcomes
At the end of the course students will:
1. Be able to design simple logic circuits and describe digital logic
elements
2. Understand fundamental structures
3. Understand basic Boolean algebra
4. Understand Propositional logic, Basic counting, and elementary
number theory
Course Content
Logic: variables, open sentences, truth sets, propositions, truth values,
logical equivalence, truth tables, negation of statements, conjunction,
disjunction, tautology, contradiction, implication, contrapositive, converse,
inverse, existential and universal quantifier, negation with quantifiers, and
counter example. Sets: elements, specification, finite and infinite, universal,
empty and disjoint. Subsets. Venn diagram: union, intersection,
complement, difference, number of elements and logical arguments. Set of
sets, the power set, and Cartesian product. Functions: domain, co-domain,
images, range, pre-image, specification and composition; bracket, absolute
value and inverse; injections, surjections and bijections; sum, difference,
product and quotient; increasing and decreasing functions. Numbers: real,
natural, prime, integer, rational and irrational. Transcendental Complex.
Laws of arithmetic including comparison with laws of set theory and logic.
Evenness and oddness, denseness, real number line, intervals and
inequalities. Methods of proof: direct, contrapositive, contradiction,
construction, counter example and principle of mathematical induction.
Teaching Methodologies
Lectures, tutorials, and seminars.
Instructional Materials or Equipment
Computers, Learning Management System, Writing boards, writing materials,
projectors etc
Course Assessment (Type and Weighting)
Type Weight
Continuous Assessment Tests 30%
Examination 70%
Total 100%
Textbooks Required (2)
1. Ralph Grimaldi (2013): Discrete and Combinatorial Mathematics:
Pearson New International Edition, 5th Edition, ISBN13: 9781292022796,
ISBN10: 1292022795.
2. Harris Kwong (2015): A Spiral Workbook for Discrete Mathematics,
Open SUNY, ISBN-13: 9781942341161.
Journals Required (2)
1. SIAM journal of discrete mathematics.
2. Mathematical structures in computer science
Textbooks for Further Reading (At Most 5)
1. Richard Johnsonbaugh (2013): Discrete Mathematics: Pearson New
International Edition, 7th Edition, ISBN13: 9781292022611, ISBN10:
1292022612.
2. Kenneth Rosen (2012): Discrete Mathematics and Its Applications,
7/e, McGraw-Hill Global Education Holdings, ISBN: 0073383090.
Journals for Further Reading (At Most 5)
1. Discrete Applied Mathematics (DAM)
2. Journal of Electronic Notes in Discrete Mathematics
3. DMTCS - Discrete Mathematics & Theoretical Computer Science
