ZNRF University of Management Sciences (ZUMS)

School Required Course

Course Outline
Course Title: Discrete Mathematics

Course Code: MAT 185

Spring 2025
Course Information Faculty Information
Class Time: Monday / Wednesday Faculty Name: Rubaiya Rahman Dipti (RRD)
(11:50 AM-1:20PM) Designation: Lecturer

Credits: 3 Contact: +8801865350503

Prerequisite: N/A Email: [email protected]
Course Type: Compulsory Course Office Location: 10th Floor, Teachers room 1
Contact Hours/week: 3 hours

Rationale of the Course:

This course in Mathematics for Computer Science aims to equip students with the essential
mathematical tools and concepts crucial for solving complex computational problems. By bridging
the gap between theoretical mathematics and practical applications in computer science, students
will develop a strong foundation that enhances their ability to design algorithms, analyze data
structures, and excel in various areas of computer science.

Course Content: Logics and Proofs: Propositional Logic, Applications of Propositional Logic,
Propositional Equivalences, Predicates and Quantifiers, Nested Quantifiers, Set Theory,
Elementary number theory, Rules of Inference, Introduction to Proofs, Fundamental principles of
counting (permutations, combinations), Graph theory, Graph Models, Graph Terminology and
Special Types of Graph, Euler and Hamilton Paths, Relations and Functions, Introduction to
Trees.
 Course Objectives:
▪ Understand essential discrete mathematics concepts for problem-solving.
▪ Apply logical reasoning, propositional logic, and set theory effectively.
▪ Utilize functions, integers, sequences, summations, and mathematical reasoning
strategies.
▪ Apply counting rules, Pigeonhole Principle, permutations, combinations, and
discrete probability.
▪ Analyze properties of relations, closures, equivalence, and partial orderings.
▪ Understand graph theory concepts and tree.

Course Learning Outcomes (CLOs)

CLO1 Understand mathematical reasoning of representing logical statements and

building arguments using propositions, predicates, quantifiers and logical
connectives.

CLO2 Understand and construct mathematical proofs using various proof

techniques, including direct proofs, indirect proofs, and proof by induction.

CLO3
Understand and apply the fundamental concepts of set theory, including set
operations, set properties, number theory, combinatorial principles and
techniques, including permutations, combinations, Boolean Algebra

CLO4 Apply set theory, mathematical logics, probability, graph theory, Boolean
Algebra to solve problems

15.Mapping of CLOs with Program Learning Outcomes (PLOs)

PLO PLO PLO PLO PLO PLO PLO PLO PLO PLO PLO PLO
1 2 3 4 5 6 7 8 9 10 11 12

CLO1 ✔ ✔

CLO2 ✔ ✔

CLO3 ✔ ✔ ✔

CLO4 ✔ ✔
 Course plan specifying content, CLOs, and Mapping CLOs with teaching learning and
assessment strategy:
Wee Topic Teaching Assessment Corresponding
k Learning Strategy CLOs
Strategy

1 Propositional Logic I Chapter 1.1 -1.2 Assignment, CLO 1, CLO 2

Propositions and their truth values, Logical Quiz, Midterm
connectives: and, or, not, implication, Exams, Final
biconditionals; Compound Propositions, Exam
Precedence of Logical Operators,
Translation.

2 Propositional Logic II and Chapter 1.3-1.4 Assignment, CLO 1, CLO 2

Predicate Logic Discussions, Quiz, Midterm
Logical Equivalences, Predicates, Problem- Solving Exams, Final
Quantifiers, Quantified statements, Exam
Translation

3 Nested Quantifiers and Rules of Chapter 1.5-1.6 Assignment, CLO 1, CLO 2

Inference Discussions, Quiz, Midterm
Nested Quantifiers, Negating Quantifiers, Problem- Solving Exams, Final
Translation, Rules of Inference. Exam

4 Proofs, Sets and Set Operations Assignment, CLO 1, CLO 2

Formal Proofs, Informal Profs, Set, Venn Quiz, Midterm
Diagram, Subsets, Proper Subset, Set Exams, Final
operations. Exam

5 Functions Lecture, Assignment, CLO 1, CLO 2

Functions: Definition, domain, codomain, Discussions, Quiz, Midterm
and range, One-to-One, Onto function, Problem- Solving Exams, Project,
Bijective, Inverse Functions. Paper

6 Mathematical Induction Chapter 8, Midterm CLO 1, CLO

Discussions, Exams, Final 2, CLO 3, ,
Problem- Solving, Exams, Term CLO 4
Group Paper,
Projects Presentation
7 Counting Chapter 10, Midterm CLO 1, CLO
Discussions, Exams, Final 2, CLO 3, ,
Problem- Solving, Exams, Term CLO 4
Group Paper,
Projects Presentation
8 Sequences and summations Lecture, Assignment, CLO 1, CLO
Discussions, Quiz, Midterm 2, CLO 3, ,
Problem- Solving Exams, Final CLO 4
Exam
9 Matrix Lecture, Assignment, CLO 1, CLO
Discussions, Quiz, Midterm 2, CLO 3,
Problem- Solving Exams, Final CLO 4
Exam
10 Number Theory I Chapter 11 & 12, Assignment, CLO 1, CLO
Discussions, Quiz, Midterm 2, CLO 3, ,
Problem- Solving Exams, Final CLO 4
Exam
11 Number Theory II Chapter 5, Assignment, CLO 1, CLO 2,
Discussions, Quiz, Midterm CLO 4
Problem- Solving, Exams, Final
Group Exam, Project
Discussion Paper
12 Relations Chapter 14, Midterm CLO 1, CLO 4
Discussions, Exams, Final
Problem- Solving, Exams, Term
Group Paper,
Discussion Presentation
13 Graph Theory Chapter 15 & 17, Midterm CLO 1, CLO 4
Discussions, Exams, Final
Problem- Solving, Exams, Term
Group Paper,
Discussion Presentation
14 Trees Chapter 10 & 17, Assignment, CLO 1, CLO 4,
Discussions, Quiz, Midterm CLO 5
Problem- Solving Exams, Final
Exam
(All the chapters are from the Textbook).
Assessment and Evaluation:

Serial Evaluation Module

Percentage
No.
Assignment /
1 20%
Presentation
2 Class Test 10%
3 Midterm 20%
4 Class Participation 10%

5 Final Exam 40%

Learning Materials:

▪ Textbook:
1. “Discrete Mathematics and Its Applications” , Seventh Edition - Kenneth H.
Rosen

Plagiarism and Academic Integrity:

Honesty is an intrinsic value that plays an integral role in developing the character of a
person. It is something that needs to be inculcated in a person from a very early age,
nurtured and reinforced by the environment in which he or she grows in such a manner,
that it permeates into and pervades the entire system, be it academics or otherwise.
Academic honesty cannot be a mutually exclusive term; rather, it is an extension of the
broader value system that enables a student to be ethical, honest and accountable for her
work. The integrity of students’ academic work is very important to ZUMS’s faculty. The
academic community revolves around innovative ideas and creativity and we believe that
person’s ideas are his or her contribution to the academic community. Therefore, taking
another person’s ideas and representing them as one’s own is a serious form of dishonesty.
Similarly, cheating (copying someone else’s work, asking for answers, sharing answers,
etc.) and other forms of dishonesty (falsifying data, making up references, etc.) are also
serious breaches of this honor code. The following are considered to be academic
dishonesty at ZUMS:
● Plagiarism: Passing off the ideas or work of another person as one’s own (one may
be using another person’s writing/ideas/ project/ survey report, claiming it to be original
work or using the ‘cut-copy-paste’ method to download information and then incorporating
the same in one’s own work without proper, clear and explicit acknowledgment of the
source.
● Collusion: Allowing one’s work to be copied or submitted for assessment by
another
 ● Duplication of work: Presenting the same work for different assessment
components.
● Falsifying data/documents- Creating data that is not backed by true research or
participation
● Copying, asking for answers, sharing answers, and any other form of cheating
(misrepresenting your own work and knowledge) on exams or quizzes are all forms of
academic dishonesty.

Other Forms of Academic Dishonesty

1. Making up references, quoting wrong sources, etc.
2. Falsifying data.
3. Misrepresenting your situation to be excused from academic work.
4. Submitting the same paper in more than one class.
5. Informing a student in a later class about questions on tests or quizzes.
6. Misrepresenting your academic work or qualifications in any way.
For more about plagiarism:
https://www.ox.ac.uk/students/academic/guidance/skills/plagiarism#:~:text=Plagiarism%
20is%20presenting%20someone%20else's,is%20covered%20under%20this%20definition
.
* Note: The syllabus maybe subject to modification depending on the necessity, and also
on any unanticipated circumstances.