EN العربية

Mathematics

Discrete Mathematics, Part I

Develop rigorous problem-solving and mathematical thinking through logic, proofs, sets, and functions.

Instructor Dr. Waleed A. Yousef Adjunct Professor, University of Victoria, Canada
A mathematical graph with connected vertices and a highlighted path

01

Course overview

Develop rigorous problem-solving and mathematical thinking through logic, proofs, sets, and functions.

02

What you will learn

This course is fundamental for any computer science student. Students will learn how to approach problems rigorously and develop mathematical thinking skills, working with pencil and paper before translating their ideas into computer programs. The course will cover various foundational areas of mathematics, including logic and proofs, sets and functions. A solid theoretical understanding of computer science, as well as other sciences, relies on a strong grasp of mathematics. This course is Part 1 that will be followed by other two parts.

03

Lecture syllabus

Video titles and durations as published on Arabsera. The advertised lecture total may differ from the number of video entries, which can include introductions, tutorials, and split sessions.

Video titles and durations 24
  1. 00 Motivation and Introduction to Discrete Mathematics
  2. 01 Sec. 1.1 Propositional Logic
  3. 02 Sec. 1.1 Propositional Logic (b)
  4. 03 Sec. 1.1 Propositional Logic (c)
  5. 04 Sec. 1.2 Propositional Equivalence
  6. 05 Sec. 1.2 Propositional Equivalence (b)
  7. 06 Sec. 1.3 Predicates and Quantifiers
  8. 07 Sec. 1.3 Predicates and Quantifiers (b)
  9. 08 Sec. 1.3 Predicates and Quantifiers (c)
  10. 09 Sec. 1.3 Predicates and Quantifiers (d)
  11. 10 Sec. 1.4 Nested Quantifiers
  12. 11 Sec. 1.4 Nested Quantifiers (b)
  13. 12 Sec. 1.5 Rules of Inference
  14. 13 Sec. 1.5 Rules of Inference (b)
  15. 14 Sec. 1.6 Introduction to Proofs
  16. 15 Sec. 1.6 Introduction to Proofs (b)
  17. 16 Sec. 1.7 Proof Methods and Strategy
  18. 17 Sec. 1.7 Proof Methods and Strategy (b)
  19. 18 Sec. 2.1 Sets
  20. 19 Sec. 2.2 Set Operations
  21. 20 Sec. 2.3 Functions
  22. 21 Sec. 2.3 Functions (b)
  23. 22 Sec. 2.4 Sequences and Summations
  24. 23 Sec. 2.4 Sequences and Summations (b)

04

Teaching support (check your plan)

  • Discussion groups
  • TA-human texting for Q&A
  • TA-GPT (coming soon)

05

Textbook

Kenneth H. Rosen, “Discrete Mathematics and Its Applications”, 6th ed., McGraw-Hill.

06

Certificate

Awarded after passing a brief sample exam, which you may attempt multiple times.