GSC-221 Discrete Mathematics
Course Title:
Discrete Mathematics
Course Code:
GSC-221
3
Credit Hours Theory:
Credit Hours Lab (If 0
Applicable):
This course aims to develop the students’ ability of logical thinking and
Course Objectives:
its application to computer science. Via teaching variety of important
concepts, this course aims to develop students understanding of breadth
of mathematics and familiarity with the concepts, structures and
algorithms that are essential to the field of computer science and
engineering.
Learning Outcomes:
After the successful completion of course, the students will be able to:
CLO-1: Solve basic problems demonstrating the understanding of
fundamental concepts of logic, reasoning, algorithms, graphs, counting
and grammars.
CLO-2: Apply the knowledge learnt to solve simple mathematical
problems in computer science.
Contents
(Catalog Logical reasoning and proofs, Mathematical induction and recursion,
Sets, Relations and functions, Algorithms, Graph theory, Boolean
Description):
algebra, Languages and grammar, Finite state machines, Number theory.
Recommended
Books:
Text
1. Kenneth H.Rosen, “Discrete Mathematics and Its Applications”,
7th Edition, McGraw Hill Books Co., 2012
2. Richard Johnsonbaugh, “Discrete Mathematics”, 8th Edition,
Pearson Education Asia, 2018.
Reference Books:
Helping Web Sites:
Attendance is mandatory. Every class is important. All deadlines are
hard. Under normal circumstances late work will not be accepted.
Students are required to take all the quizzes. No make-up quizzes will be
taken under normal circumstances. Any form of cheating on
exams/assignments/quizzes is subject to serious penalty.
Attendance:
General
Instructions
75% attendance is mandatory. Latecomers will be marked as absent.
for students:
Evaluation Criteria:
Assignments
Quizzes
Class Activities
Mid-Term
Final
10%
10%
10%
20%
50%
Sixteen
Week
Lesson Plan
Week
1
2
3
4
5
6
7
8
9
10
11
Topics Covered
Number Theory. Introduction to Sets. Set operations and properties. Venn
diagrams.
Sequences and Strings.
Relations.
Functions.
Propositional logic. Conditional propositions and logical equivalence.
Proofs. Rules of inference. Mathematical induction and recursion.
Matrices.
Revision
MID TERM EXAMINATION
Boolean Algebra
Algorithms, integers and recursion.
12
13
Counting Techniques
Introducing graphs and trees.
14
Algebraic structures.
15
Languages and Grammars.
16
17
18
Finite state machines.
Revision.
FINAL EXAMINATION
CONTRIBUTION OF COURSE LEARNING OUTCOMES (CLOs) TO PROGRAMME
LEARNING OUTCOMES (PLOs)
BS Software Engineering
Discrete Mathematics
No
Program Outcomes
1
2
3
4
5
6
7
8
9
10
11
12
Engineering Knowledge
Problem analysis
Design/Development of solutions
Investigation
Modern tool usage
Engineer and society
Environment and sustainability
Ethics
Individual and Team work
Communication
Project Management
Lifelong learning
Course Learning Outcomes
1
2


