|MATH 240 - Discrete Structures 1.|
Mathematical foundations of logical thinking and reasoning. Mathematical language and proof techniques. Quantifiers. Induction. Elementary number theory. Modular arithmetic. Recurrence relations and asymptotics. Combinatorial enumeration. Functions and relations. Partially ordered sets and lattices. Introduction to graphs, digraphs and rooted trees.
Corequisite: MATH 133.
Restriction: For students in any Computer Science program. Others only with the instructor's permission. Not open to students who have taken or are taking MATH 235.
3.000 Credit hours
Schedule Types: Lecture, Midterm Exam, Optional Tutorial, Tutorial
All Sections for this Course
Faculty of Science
Mathematics and Statistics Department
May not be enrolled in one of the following Levels:
Masters & Grad Dips & Certs
May not be enrolled in one of the following Faculties:
Faculty of Dentistry
Faculty of Medicine
School of Continuing Studies
|Return to Previous||New Search|