COURSE TITLE: DISCRETE STRUCTURES I

COURSE CODE: COMP 114

CREDIT FACTORS: 3.0

PREREQUISITE: NONE

Lecture Name : Mr Komen Francis

Contact : 0721327274

Email : [email protected]

Purpose

This course is intended to introduce students to discrete mathematics as applied to computing.

Objectives

At the end of the course students will be able to:

1. Use sets and set operations, such as union, intersection, and complementation to solve
problems in discrete mathematics.

2. Describe principles of logic and propositional calculus, including truth tables,

equivalences, and proof methods.

3. Explain the principles of counting and combinatorics, including permutations,

combinations, and pigeonhole.

4. Describe concepts in graph theory, including graph representations, connectivity, paths,

cycles, and trees.

5. Explain the concepts of number theory, including divisibility, prime numbers, and
modular arithmetic.
Course Outline

WEEK DATE CONTENT ACTIVITY

1 Lecture 1 Introduction to Logic and Proofs Assignments

Overview of mathematical logic

Direct proofs :

Basics and examples

Proof by contradiction:

Principles and examples

2 Lecture 2: Mathematical Induction Assignments

 Principle of mathematical induction

 Strong induction

 Examples and applications of

mathematical induction

3 Lecture 3: Fundamentals of Structures - Functions Assignments

 Definitions and properties of functions

 Surjections, injections, and bijections

 Composition and inverses of functions

4 Lecture 4: Fundamentals of Structures - Relations Assignments

 Introduction to relations

 Reflexivity, symmetry, and transitivity

 Equivalence relations and equivalence

classes

5 Lecture 5: Fundamentals of Structures - Sets Assignments

 Set theory basics

 Venn diagrams and set operations

  Cartesian products, power sets, and set
cardinality

CAT ONE

6 Lecture 6: Pigeonhole Principle and Cardinality Assignments

 Pigeonhole principle and its applications

 Counting and combinatorial principles

 Cardinality and countable/uncountable

sets

7 Lecture 7: Boolean Algebra

 Introduction to Boolean algebra

 Boolean values and operations

 De Morgan's laws and their applications

8 Lecture 8: Probability Logic Assignments

 Logical connectives and truth tables

 Normal forms: Conjunctive and

disjunctive

 Validity and logical equivalence

9 Lecture 9: Elementary Number Theory – Factorability Assignments

 Prime factorization and its properties

 Divisibility and factorability in integers

 Fundamental theorem of arithmetic

10 Lecture 10: Elementary Number Theory - Properties of Assignments

Primes

 Properties of prime numbers

 Prime factorization and unique

factorization theorem
  Prime counting functions

11 Lecture 11: Elementary Number Theory - GCD and LCM Assignments

 Greatest common divisor (GCD) and its

properties

 Euclid's algorithm for finding GCD

 Least common multiple (LCM) and its

properties

12 Lecture 12: Modular Arithmetic and Combinatorics Assignments

 Basics of modular arithmetic

 Applications of modular arithmetic

 Permutations, combinations, and

binomial coefficients

13 Lecture 13: Graph Theory Assignments

 Introduction to graph theory

 Graph representations: Adjacency matrix,

adjacency list

 Connectivity, paths, cycles, and trees in

graphs

CAT TWO

Teaching Methodologies

Lecture, Tutorials, Seminars, Assignments, Exams and Recitations

Instructional Materials/Equipment

Computers, Appropriate Software, Manuals/Handouts, Whiteboard, Library and Internet.

 Course assessment

Type of assessment Weighting

CAT/ Assignments 30%

Final Exam 70%

Total 100%

Recommended Textbooks

Levin, O. (2017). Discrete mathematics 2nd edition. University of Northern Colorado Greeley.
ISBN-13:978-1534970748. Available-Online (discrete mathematics eBook.pdf)

Recommended Reference Books

Johnsonbaugh, R. (2017). Discrete Mathematics 8th Edition. Pearson. - 978-

0321964687

- 978-0691179292

E-Materials

1. Resources for Discrete Mathematics:

https://www.csie.ntu.edu.tw/~sylee/courses/dm/resources.htm

2. Discrete Math Resources: http://www.discrete-math-hub.com/resources-and-

help.html

3. Discrete math Videos:

https://www.youtube.com/playlist?list=PLDDGPdw7e6Ag1EIznZ-m-
qXu4XX3A0cIz