Course Outline and Introduction
CSI 2101: Discrete Structures
School of Electrical Engineering and Computer Science, University of Ottawa
January 12, 2022
Copyright By PowCoder代写 加微信 powcoder
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 January 12, 2022 1 / 10
1 Course Outline
2 Introduction
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 January 12, 2022 2 / 10
Who is Who?
Instructor
Lectures: Wednesday @10:00 am and Friday @08:30 am Tutorial: Thursday @05:30 pm
TA Please check your email to find the TA’s contact.
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 January 12, 2022 3 / 10
Course Outline
Prerequisite: MAT 1348
Textbook
Discrete Mathematics and its Applications by K. Rosen (7th or 8th edition), McGraw Hill Education.
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 January 12, 2022 4 / 10
Course Outline (cont.)
Grade distribution
Quizzes 20% (5×4%) Midterm 1 20% Midterm 2 20%
Final exam 40%
Midterm schedules Midterm 1: March 02
Midterm 2: April 01
Md. Hasan (uOttawa)
Discrete Structures 0 MdH S21
January 12, 2022
Course Outline (cont.)
Important Evaluation policies
Visit the University of Ottawa’s academic integrity policy:
https://www.uottawa.ca/vice-president-academic/academic-integrity
The attendance is mandatory. At least 80% attendance is required to write the final exam.
Pop 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 three hours long. Numerical and conceptual questions. Close book online.
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 January 12, 2022 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)
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 January 12, 2022 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 January 12, 2022 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 January 12, 2022 9 / 10
Thank You!
Questions and Comments?
Md. Hasan (uOttawa) Discrete Structures 0 MdH S21 January 12, 2022 10 / 10
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com