Course

Outline
_____________________________________________________________________________________________________________________________ _____________________________________________________________________________________________________________________________ ____________________________________________________________________________________________________________________________

A. Faculty Information

Md. Asiful Islam Miah (Himel)

B.Sc in CSE, KUET
Ex-R&D Engineer, Shanghai Baud Data Communication (BDCOM)
Lecturer, Department of CSE, Southeast University

B. Course Details
1. Importance of the Course
A discrete mathematics course has more than one purpose. Students should learn a particular set of
mathematics facts and how to apply them; more importantly, such a course should teach students how to think
mathematically. To achieve these goals, this text stresses mathematical , reasoning, combinatorial analysis,
discrete structures, algorithmic thinking, and applications and modeling.

2. Objectives
After learning this course student will be able to-
1. Explain set theory, functions and relations in the area of computer science.
2. Apply mathematical logic and proofs in computer science such as design of computer circuit,
verification of programs.
3. Analyze the graph models in computer network and shortest path problems.
4. Design mathematical reasoning, counting problems, tree structures and graph theory in solving
mathematical problems as applied to the respective branches of Engineering.

3. Course Outcomes (COs)

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

COs Description Teaching-Learning Strategy Assessment Strategy

CO1 Construct propositional logic, Lectures, Active discussion, Solving Formative:

predicate logic, and theorem logical problems. - Discussion
proving for mathematical - Essay Questions -
reasoning. Quiz
- Viva voce
Summative:

1 of 9
 Course
Outline
_____________________________________________________________________________________________________________________________ _____________________________________________________________________________________________________________________________ ____________________________________________________________________________________________________________________________

- Midterm Examination

CO2 Demonstrate counting, Lectures, Practice problems, Group Formative:

permutations, and combinations Discussion. - Essay Questions
for combinatorial analysis. - Quiz
- Viva voce
Summative:
- Midterm Examination
- Final Examination

CO3 Discuss the growth of functions, Lectures, Practice problems, Formative:

complexity analysis of Presentation. - Problem based
algorithms, and integer exercise
algorithms for algorithmic - Assignment
thinking; demonstrate this - Presentation
knowledge and write reports for - Viva voce
realistic problem solving. Summative:
- Midterm Examination
- Final Examination

CO4 Interpret discrete structures such Discussion, Practice problem, Formative:

as sets, functions, relations, Presentation - Case Study
graphs, and trees for modeling - Assignment
discrete objects; demonstrate this - Discussion
knowledge and write reports for - Viva voce
realistic problem solving. Summative:
- Final Examination

4. Course Outcomes (COs) and Program Outcomes (POs) Mapping

PO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 ✔

CO2 ✔

CO3 ✔

CO4 ✔

1 of 9
 Course
Outline
_____________________________________________________________________________________________________________________________ _____________________________________________________________________________________________________________________________ ____________________________________________________________________________________________________________________________

5. Tentative Lecture Plan

1 of 9
 Course
Outline
_____________________________________________________________________________________________________________________________ _____________________________________________________________________________________________________________________________ ____________________________________________________________________________________________________________________________

Class Lecture Contents Learning Outcome Learning

No. Resources

1 Lecture Introduction, introduction of discrete Introduced to the course Course Outline

Module mathematics, introduction of Course and its contents alongside
1 Contents and application of discrete usage in real life.
mathematics.

2 Lecture Propositional logic, propositional State Logic Lecture Slide

Module function, representation of Explain Propositional logic
2 propositional logics Describe Truth Table
Compare Statement and
3 Propositional equivalence, algebra of Propositional logic Lecture Slide
propositional logic, tautologies and Solve math related to
contradictions. Tautology, Contradiction,
Contingency

4 Lecture Introduction of set, representation of State Set Basics Lecture Slide

Module set, arithmetic operation of set, Venn Describe different types of
3 diagram Sets
Develop operation of Sets
5 Set problems, cartesian products, Demonstrate Van Diagram Lecture Slide
cardinality of set related math
Recognize Functions basics
Describe different types of
Function such as One to
One, Onto Function
Calculate Floor and Ceiling
of a Function

6 Quiz-1

7 Lecture Introduction the concept of State Predicates and Lecture Slide

Module quantification, domain range Quantifiers
4 Classify the Quantifiers
8 Universal quantifier, Existential Translating sentences using Lecture Slide
quantifier Predicates and Quantifiers
Describe Order of
9 Implication and math problem of Lecture Slide
Quantifiers and Nested
quantification, argument, negation of
Quantifiers
quantified statements

1 of 9
 Course
Outline
_____________________________________________________________________________________________________________________________ _____________________________________________________________________________________________________________________________ ____________________________________________________________________________________________________________________________

10 Quiz-2

11 Lecture Different types of relations, closure of Compare Function and Lecture Slide
Module relations, reflexive closure, transitive Relation
5 closure, symmetric closure Represent the Relations on
a Set
12 Composite of relations, equivalence Analyze the properties of a Lecture Slide
of relations, partial ordering of Relation
relations, math problem of relations.

13 Lecture Introduction to Function, Different Define and identify Lecture Slide

Module type of function (i.e. Injective functions using various
6 function, Bijective function, methods.
Surjective function), concept of Distinguish and analyze
domain and range, composite injective, surjective, and
function, different operations among bijective functions.
function(i.e. Addition, subtraction, Determine and explain the
multiplication, division ) domain and range of
functions.
Understand and create
composite functions.
Perform and analyze
operations on functions
(addition, subtraction,
multiplication, division).

14 Lecture Mathematical induction proof Describe Mathematical Lecture Slide

Module Induction
7 Construct Proof Strategies
Explain Structural
Induction Describe
Mathematical Induction
Construct Proof Strategies

16 Quiz-3

1 of 9
 Course
Outline
_____________________________________________________________________________________________________________________________ _____________________________________________________________________________________________________________________________ ____________________________________________________________________________________________________________________________

17 Lecture Counting: Basic counting principles, Describe Basic Rules of Lecture Slide
Module mathematical function, permutation, Counting
8 combinations, the pigeonhole theory, Explain Pigeonhole
the inclusion and exclusion principle, Principle, Permutations and
tree diagrams, solved problems, Combinations
supplementary problems. Solve math related
Permutation, Combination
and Pigeonhole Principle

18 Lecture Introduction to data structure, State Graph Lecture Slide

Module graphs, multigraphs, subgraph, Describe Graph
9 isomorphic graph, homomorphic Representation
graph Explain different types of
Graphs
19 Path , connectivity, traversing, bridge, Compare Bridge and Cut Lecture Slide
labeled and weighted graph Point in Graph
Develop Distance Matrix
20 Planar graph, graph coloring, Lecture Slide
for Graph.
representation of graph in memory,
graph algorithms

21 Quiz-4

22 Lecture Basic definitions of directed graph, Define and identify basic Lecture Slide
Module sequential representation of directed concepts of directed graphs.
10 graph, linked representation Understand sequential and
linked representations of
23 Graph algorithms: Depth first search, directed graphs. Lecture Slide
Breadth first search, directed cycle free Implement and explain
graph, topological sort. depth-first search (DFS)
algorithm.
Implement and explain
breadth-first search (BFS)
algorithm.
Understand directed cycle-
free graphs and perform
topological sorting.

1 of 9
 Course
Outline
_____________________________________________________________________________________________________________________________ _____________________________________________________________________________________________________________________________ ____________________________________________________________________________________________________________________________

24 Lecture Tree: Binary tree, general tree, State Trees Lecture Slide
Module complete and extended binary tree, Describe different types of
11 representation of binary tree in Trees
memory, traversing of binary tree, Applications of Trees
Tree Traversal

6. Teaching and Learning Methods

● Online Learning Management System (Google Classroom)
● Lecture delivery in Physical Class
● Lecture materials in Google Classroom
● Discussion during class and counseling hours
● Sample codes provided during physical class and via Google Classroom
7. Assessment
i. Tentative Assessment Schedule

Serial Assessment Type Schedule Comments

1. Quiz 1 Week 03

2. Assignment 1 Week 02 - Week 06 It will be 4 weeks long assessment

3. Quiz 2 Week 05

4. Midterm Exam Week 07

5. Quiz 3 Week 09

6. Assignment 2 Week 08-Week 12 It will be 4 weeks long assessment

7. Quiz 4 Week 12

8. Presentation Week 13

9. Final Exam Week 14

ii. Tentative Weight Assessment

1 of 9
 Course
Outline
_____________________________________________________________________________________________________________________________ _____________________________________________________________________________________________________________________________ ____________________________________________________________________________________________________________________________

Assessment Tools Percentage

Attendance 010%

Class Tests 015%

Assignments/Presentation 025%

Mid Term Examination 020%

Final Examination 030%

Total 100%

iii. Grading Policy

Obtained Marks
Letter Grade Grade Point Assessments
Minimum Maximum

080% 100% 4.00 A+ AAOutstanding

075% 079% 3.75 A/ AAExcellent

070% 074% 3.50 A- AAVery Good

065% 069% 3.25 B+ AAGood

060% 064% 3.00 B/ AAAverage

055% 059% 2.75 B- AABelow Average

050% 054% 2.50 C+ AAPoor

045% 049% 2.25 C/ AAVery Poor

040% 044% 2.00 D/ AAPassing

1 of 9
 Course
Outline
_____________________________________________________________________________________________________________________________ _____________________________________________________________________________________________________________________________ ____________________________________________________________________________________________________________________________

Obtained Marks
Letter Grade Grade Point Assessments
Minimum Maximum

000% 039% 0.00 F/ AAFail

8. Lecture Materials

Lecture Notes As provided during class

Text Book(s) 1. Rosen, Kenneth H. Discrete Mathematics and Its Applications. 7th ed, McGraw-Hill,
2012.

Reference 1. Epp, Susanna S. Discrete Mathematics with Applications. Fifth edition, Cengage
Book(s) Learning, 2020.
2. Lipschutz, Seymour, and Marc Lipson. Schaum’s Outline of Theory and Problems of
Discrete Mathematics. 3. ed, McGraw-Hill, 2007.

Online Resources as provided during class time

Resources

9. Aiding Materials for Learning

i. Internet Connectivity
ii. SEU official email ID.
iii. Should know how to use “Google Meet” and “Google Classroom”

10. Faculty Suggestions

i. Md. Habibullah Belali, Assistant Professor
ii. Md Nazrul Islam, Lecturer
iii. Farhad Uz Zaman, Lecturer

1 of 9