COURSE OUTLINE

1 Faculty Faculty of Science & Engineering

2 Department Department of CSE
3 Program B.Sc. in Computer Science and Engineering
4 Name of Course Discrete Mathematics
5 Course Code CSE 101
6 Trimester Summer 2021
and Year
7 Pre-requisites None
8 Status Core Courses
9 Credit 3.0
10 Section 212DA, 212DB, 212DC, 212DD, 221 DO, PC-212DA, PC-212DB, 212EA,
212EB
11 Class Hours
Section Class Day Class Hours Venue
212DA MONDAY+WEDNESDAY 11.30AM-01.00 PM Online
212DB TUESDAY+THURSDAY 11.30AM-01.00 PM Online
212DC TUESDAY+THURSDAY 10:00 AM-11:30 Online
AM
221DO MONDAY+WEDNESDAY 11.30AM-01.00 PM
212DD MONDAY+WEDNESDAY 11.30AM-01.00 PM Online
PC-212 DA MONDAY+WEDNESDAY 01.30PM - 03.00PM Online
PC-212 DB MONDAY+WEDNESDAY 10.00AM-11.30 AM Online
212EA FRIDAY 10.30AM-01:00 PM Online
212EB FRIDAY 8.00AM-10.30AM Online

12 Class Location Online

13 Course website https://classroom.google.com/u/0/c/MzU4MDQxMDg3MjQ1 (212DA),
https://classroom.google.com/u/0/c/MzU4MDQxMDg3MjY0 (212DB),
https://classroom.google.com/c/MzY2MTIzOTAwNjM0?cjc=ofxg2xi (212DD)
https://classroom.google.com/c/NDY0MTkyMjQ4NDk0 (212DO)
https://classroom.google.com/u/3/c/MzU5MTAzOTIxNjk2 (PC-212 DA)
https://classroom.google.com/u/2/c/MzY1NTM2NjkxNzcz (PC-212DB),
https://classroom.google.com/u/1/c/MzU4MjE4MjM4NTA1(212EA),
https://classroom.google.com/c/MzY1NTA5MzUwNzAz?cjc=e5yd6ac (212EB)

Instructor(s) Ms. Sumaiya Kabir (212DA, 212DB)

14
Md. Sultanul Islam Ovi (PC-212 DA)
Ms. Zeseya Sharmin (PC-212DB)
Ahmed Iqbal Pritom (212EA)
Ms. Umme Habiba (212EB)
Arnab Kanti Tarafder (212 DC)
Feroza Naznin (212DD)
Tanoy Debnath (221 DO)
15 Contact [email protected] (212DA, 212DB),
[email protected] (PC-212 DA)
[email protected] (PC-212DB),
[email protected] (212EA)
[email protected] (212EB)
[email protected] (212DC)
[email protected] (212DD)
[email protected] (221 DO)
16 Office NA (due to online classes)

Section Day Counseling Hours Venue

17 Counseling 212DA Wednesday 01:00 PM-3:00 PM Online
Hours 212DB TUESDAY 01:00 PM-3:00 PM Online
212 DC Friday 12:00-1:00 PM Online
212DD Monday 3.30-4.30 PM Online
PC-212 DA Wednesday 03:00 PM-5:00 PM Online
PC-212DB Thursday 11:30AM-1:00PM Online
212EA Thursday 6.00PM-8.30PM Online
212EB Thursday 6.00PM-8.30PM Online
 1. Rosen K.H (2007). Discrete Mathematics and it’s applications. AMC, 7th
18 edition.
Text Book

1. Goodaire, E.G., & Paramenter, M.M (1997). Discrete Mathematics with

19
graph theory. Prentice hall PTR.
Reference
2. Biswal, P.C (2015). Discrete Mathematics and graph theory. PHI
Learning Pvt. Ltd.

Bring your own materials (calculator, pen, paper, etc.) to participate effectively
20 Equipment & in classroom activities. You are not allowed to borrow from others inside the
Aids
classroom during class activities.

Note: Besides class note, Please keep at least one blank A4 size paper per class
with you.

21 Course Discrete Mathematics is needed to see mathematical structures in the object you
Rationale work with, and understand their properties. This ability is important for software
engineers, data scientists, security and financial analysts (it is not a coincidence
that math puzzles are often used for interviews). We cover the basic notions and
results (graphs, probability, number theory etc) that are universally needed. To
deliver techniques and ideas in discrete mathematics to the learner we
extensively use interactive puzzles specially created for this specialization. To
bring the learners experience closer to IT-applications we incorporate
programming examples, problems and projects in our courses.

22 Course Mathematical logic: propositional logic, predicate logic, mathematical

Description reasoning and proof techniques; set theory: sets, relations, partial ordered sets,
functions; counting: permutations, combinations, principles of inclusion and
exclusion; discrete probability; functions: recurrence relations and recursive
algorithms; growth of functions; graph theory: graphs, paths, trees; algebraic
structures: rings and groups.

23 Course After completing this course students will be able to-

Outcomes (CO)
CO1: Describe the basic characteristics and operations of logic, sets, functions
relations, graphs and trees. [Cognitive]

CO2: Solve problems related to counting discrete objects and use various
techniques of mathematical induction (weak, strong and structural induction) to
prove simple mathematical properties of a variety of discrete structures.
[Cognitive]

CO3: Model and solve real world computing problems using various concepts
of discrete mathematics. [Cognitive]

24 Teaching Most of the topics will be covered from PPT file which directly match to the
Methods textbook. For the rest of the topics, reference books will be followed. Class notes
 (Lecture PPT) will be uploaded on the web. White board will be used for most of
the time. All the class will be conducted with projector. Students must participate
in classroom discussions for case studies, problems solving.

25 Topic Outline All topics and problems are from the main text if not specified otherwise.

Lecture Selected Topics PPT Text Book Suggested Problems. Outcome

(Text)

(1) Socialization and -

Introduction to the course
(2-3) Logic PPT-1 Page-12 Problem (1-20) CO1
Propositional Logic PPT-1 1.1 Page-22 Problem (1-20)
Composite Statements PPT-1 Page -6
Logical Connectives PPT-1 Page-(4-9)
Application of PPT-1 1.2
Propositional Logic

(4-5) Logic PPT-2 Page-78 CO1

Limitation of PPT-2 Problem (1-9)
Propositional Logic
Predicate Logic PPT-2 1.4
Quantifier PPT-2 1.4
Rule of Inference PPT-2 1.6

(6-8) Set PPT-3 Page-125 CO1

Basic Discrete Structure PPT-3 2.1 Problem (1-44)
Set PPT-3 2.1
Cardinality PPT-3 Page-121,170
Infinite Set PPT-3 Page-121 Page-136
Power Set PPT-3 Page-121 Problem (1-29)
Cartesian Product PPT-3 Page-122
Set Operation PPT-3 2.2
Computer Representation PPT-3 Page-134
of Set

(9-11) Function Page-152 CO1

Function PPT-4 2.3 Problem (1-6)
Representing a Function PPT-4
Notation of Set PPT-4
Injective Function PPT-4
Surjective Function PPT-4
Bijection Function PPT-4
Inverse Function PPT-4 Page-145
Composition of Function PPT-4 Page-145
(12) Mathematical Induction Page-329 CO2
Proof Technique PPT-5 5.1 Problem (1-2)
Mathematical Induction PPT-5 5.1
Page-451
(13) Discrete Probability Chapter-7
Discrete Probability PPT-6 7.1
Uniform Probability PPT-6 Page-121 Problem (1-24)
Measure CO2
Probability of PPT-6 Page-455
Complementary Event
Probability of a Union PPT-6 Page-455
Event

(14-16) Graph -

Graph PPT-6 Page-649 CO1,

Terminology PPT-6 10.1 Problem (1-10) CO3
Directed Graph PPT-6 10.2
Undirected Graph PPT-6 Page-654
Page-665
Complete Graph PPT-6 Page-652
Bipartite Graph PPT-6 Page-684 Problem (1-58)
Subgraph PPT-6 Page-656
Representation of Graph PPT-6 Page-663 Page-675
Problem (1-18)

(17-18) Tree Page-755 CO1, CO3

Tree PPT-7 Problem (1-33)
Rooted Tree PPT-7 11.1
M-ary Tree PPT-7 Page-747
Binary Tree PPT-7 Page-773
Complete Binary Tree PPT-7 Page-748

(19-20) Counting Page-413 CO2

Counting PPT-8 6.1 Problem (1-38
Counting Rules PPT-8 Page-386
Inclusion PPT-8
Pigeonhole principle PPT-8 6.2
Permutation PPT-8 6.3
Combination PPT-8 6.3 Page
(409)
Caesar Cipher PPT-8 6.1

(21-22) Basic Number Theory Problem (1-8) CO1,

Importance of Number PPT-9 CO3
Theory Page-284
Divisors PPT-9 4.1
Prime Numbers PPT-9 4.3 Problem (1-10)
Fundamental Theorem PPT-9 Page-258
of Arithmetic
 GCD and Relatively PPT-9 Page-256
Prime
Least Common Multiple PPT-9 Page-256
Mod Function PPT-9 Page-253

(23-24) Relation PPT-10 Page-579 CO1

Binary Relation PPT-10 9.1 Problem (1-16)
Reflexive Relation PPT-10 Page-576
Symmetric Relation PPT-10 Page-579
Transitive Relation PPT-10 Page-579
Closure of a Relation PPT-10
Composite Relation PPT-10 9.1
Equivalence Relation PPT-10

26 Assessment and Students will be assessed on the basis of their overall performance in all the
Marks exams, quizzes, and class participation. Final numeric reward will be the
Distribution: compilation of (tentative):
● Class Test (15%)
● Group Assignment (5%)
● Individual Presentation (5%)
● Class Attendance (5%)
● Mid-Term (30%)
● Final Exam (40%)

27 Assessment Assessment methods of COs are given below:

Methods of COs
Course Outcomes
Assessment Methods CO1 CO2 CO3
Class Test 15%
Group Assignment, 5% 10%
Individual Presentation,
Attendance
Mid-Term Exam 10% 20%
Final Exam 15% 25%
Total (100%) 40% 50% 10%

Mapping of COs
with PLOs
28

29 Grading Policy The following chart will be followed for grading. This has been customized from
the guideline provided by the School of Engineering and Computer Science.
 A+ A A- B+ B B- C+ C D F
80 and 75- 70- 65- 60- 55- 50- 45- 40- <4
above <80 <75 <70 <65 <60 <55 <50 <45 0

30 Additional Course
Policies
Assignme There will be one assignment and a capstone project presentation.
nts and Average marks will be counted. Delayed submission will not be
accepted.
Capstone
Project Any kind of plagiarism in assignment will carry zero mark.
Presentati
on Two or more copied assignments will carry zero mark in all
assignments. Zero tolerance will be shown in this regard.
Capstone Project Presentation will be on group basis. Three
groups will present their task at the end of class. Project idea,
dress code, & presentation fluency will differentiate the team
members marks.
Class Test There will be three CTs, best of two will be counted. A CT can
(CT) be taken with an announcement in prior or without any
announcement.
Exams Mid-term and final exam will be closed book, closed notes.
Mobile is strictly prohibited in exam hall. Please bring your own
watch and synchronize time during exam hours.
Test If any student fails to appear in the test and have not clarified the
Policy: actual reason to the teacher personally beforehand, his/her score
for the test will be zero. No make-up for class test will be taken
because it has alternative (three out of four). No make-up for mid
will be entertained without presence and recommendation of
guardian and written permission of the department.

31 Additional a. Academic Calendar Summer 2021:

Information http://www.green.edu.bd/academics/academic-calendar.
b. Academic Information and Policies:
http://www.green.edu.bd/academics/academic-rules-a-regulations.
c. Grading and Performance Evaluation:
d. http://www.green.edu.bd/academics/academic-rules-a-regulations.
Proctorial Rules: http://www.green.edu.bd/administrator/proctors-office.