Scribd
Upload
25 views

00 Overview

Uploaded by

Ronnie Atuhaire
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
25 views

00 Overview

Uploaded by

Ronnie Atuhaire
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

CSC 2105: Discrete Mathematics

J. Kizito

Makerere University

e-mail: [email protected]
www: https://www.socnetsolutions.com/~jona
materials: https://www.socnetsolutions.com/~jona/materials/CSC2105
e-learning environment: http://muele.mak.ac.ug
office: block A, level 3, department of computer science
alt. office: institute of open, distance, and eLearning

Overview

Kizito (Makerere University) CSC 2105 Aug, 2024 1/8


Overview

1 Introduction

2 Content Overview

3 Assessment

4 Reference

5 Timetable

6 Conclusion

Kizito (Makerere University) CSC 2105 Aug, 2024 2/8


Introduction

Introduction

Course Description
The course applies mathematics to finite or discontinuous quantities in order to master
the process of problem-solving, communication, reasoning, and modeling. It gives a
basic understanding of mathematical structures that are fundamentally discrete. Objects
studied in discrete mathematics are largely countable sets such as integers, finite graphs,
and formal languages. Applications of such concepts to computer science are to be
studied. Concepts and notations from discrete mathematics are useful in studying and
describing objects and problems in computer algorithms and programming languages

Aims
The aim of this course is to provide the student with:
A basic understanding of mathematical objects that assume only distinct, separate
values, rather than values on a continuum
The main ideas studied in the broad area of Discrete Mathematics especially clear
algorithmic aspects
An understanding of what the relation between problems is

Kizito (Makerere University) CSC 2105 Aug, 2024 3/8


Content Overview

Content Overview
Modules – 45 CH

1 Module 1 (6 hours) – Logic: Propositional and First Order Logic


2 Module 2 (6 hours) – Functions and The Set Theory. Basic set
operations, one-to-one, onto, inverses, composition and graphs.
3 Module 3 (6 hours) – Relations and the Number Theory
4 Module 4 (9 hours) – Methods of Proof: Direct Proofs,
Implications, Contraposition, Contradiction, Proof by Cases, Induction
5 Module 5 (6 hours) – Counting: Sum Rule, Product Rule,
Permutations, Combinations, Combinatorial Proofs
6 Module 6 (3 hours) – Recursion: Recursive definitions, Recursive
algorithms, Solving recurrences.
7 Module 7 (9 Hours) – Graphs and Trees: Terminology, Representing
Graphs, Isomorphism, Eulerian and Hamiltonian Graphs, Bipartite
Graphs and Matchings, The Stable Marriage Problem, Graph
Colorings.
Kizito (Makerere University) CSC 2105 Aug, 2024 4/8
Assessment

Assessment

Assignments
Written tests
Written Examination
Assignments and tests, 40% while examination contributes 60%

Kizito (Makerere University) CSC 2105 Aug, 2024 5/8


Reference

References
Reading List

i Discrete Mathematics and Its


Applications by Kenneth H. Rosen, 7th
Edition, McGraw Hill, 2012.
ii Discrete Mathematics, by Kenneth A.
Ross and Charles R. B. Wright, Fourth
Edition.
iii Discrete and Combinational Mathematics:
An Applied Introduction, by Ralph
Grimaldi, 4th Edition.
iv Discrete Mathematics with Applications,
by Susanna S. Epp.

Kizito (Makerere University) CSC 2105 Aug, 2024 6/8


Timetable

Timetable
Staggered blended

CS-2 Day, LLT 6B, 1B


Mondays 09:00–10:00
Mondays 10:00–12:00

CS-2 Evening, LLT 6B


Mondays 17:00–20:00

Kizito (Makerere University) CSC 2105 Aug, 2024 7/8


Conclusion

Questions? Comments? Discussion?

Kizito (Makerere University) CSC 2105 Aug, 2024 8/8

You might also like