Introduction, Statements, and Notation, Connectives, Well-formed formulas, Tautology, Duality law, Equivalence, Implication, Normal Forms, Functionally complete set ...

This course covers elementary discrete mathematics for engineering. It focuses on definitions and proofs as well as practicable methods to provide students with a solid understanding of the material ...

Self-funded student: register by the 10th of the month, start on the 1st of the next. Funded student: please check the next enrolment deadline and course start date. Mathematics 309: Discrete ...

Course Description: A course designed to prepare math, computer science, and engineering majors for future coursework by introducing formal mathematical concepts and techniques that are fundamental ...

Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...

8.1 Application of recurrence relations 8.2 Solving linear recurrence relations (* optional sections, cover as time allows) Additionally, if a student is requesting a (CSD approved) testing ...