Course Outline and Introduction
Dr. Mahmud Hasan
CSI 2101: Discrete Structures
School of Electrical Engineering and Computer Science, University of Ottawa
May 3, 2021
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 May 3, 2021 1 / 10
Agenda
1 Course Outline
2 Introduction
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 May 3, 2021 2 / 10
Who is Who?
Instructor
Mahmud Hasan
mhasan@[Link]
Lectures: Monday @1:00 pm and Thursday @11:30 am
Tutorial: Wednesday @10:00 am
TA TBA
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 May 3, 2021 3 / 10
Course Outline
Prerequisite:
MAT 1348
Textbook
Discrete Mathematics and its Applications by K. Rosen (7th or 8th
edition), McGraw Hill Education.
Other materials
Selected papers on applications of discrete structures.
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 May 3, 2021 4 / 10
Course Outline (cont.)
Grade distribution
Quizzes 30% (6×5%)
Midterm 1 20%
Midterm 2 20%
Final exam 30%
Midterm schedules
Midterm 1: June 07
Midterm 2: July 12
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 May 3, 2021 5 / 10
Course Outline (cont.)
Evaluation policies
Visit the University of Ottawa’s academic integrity policy:
[Link]
Quiz questions include multiple choices, true/false, and one word
answers. Close book online.
Midterm exams will be fifty minutes long. Numerical and conceptual
questions. Close book online.
Final exam will be two hours long. Numerical and conceptual
questions. Close book online.
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 May 3, 2021 6 / 10
Course Outline (cont.)
Sequence of Lecture Topics
Course Introduction
Propositional Logic (Textbook Chapter 1)
Predicate Logic (Textbook Chapter 1)
Inference Rules and Proofs (Textbook Chapter 1)
Number Theory (Textbook Chapter 4)
Induction (Textbook Chapter 5)
Recurrence Relations (Textbook Chapter 8)
Graphs (Textbook Chapters 10 and 11)
Selected Papers on Applications
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 May 3, 2021 7 / 10
Discrete Structures
CSI 2101 Course Features
It includes more advanced concepts of discrete mathematics
compared to its prerequisite MAT 1348.
It is more about computational applications: algorithm development,
cryptographic security, and network analysis.
It is a prerequisite for CSI 3104 (Introduction to Formal Languages),
CSI 3105 (Design and Analysis of Algorithms I), and CSI 3120
(Programming Language Concepts).
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 May 3, 2021 8 / 10
Discrete Structures (cont.)
CSI 2101 Course Goals
Understanding of mathematical reasoning
Learning of advanced counting concepts
Learning of discrete structures
Learning of algorithmic thinking
Understanding of applications and modelling
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 May 3, 2021 9 / 10
Thank You!
Questions and Comments?
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 May 3, 2021 10 / 10