Course Name:
Discrete Structures in Computing
Other Course Description or Assignment Information:
This course is an introduction to discrete structures and formal methodologies used in computer science, including Boolean algebra, propositional logic, predicate logic, proof techniques, set theory, equivalence relations, order relations, and functions.
IMPORTANT NOTE REGARDING FALL 2020 WORK ASSIGNMENTS AND COURSE DELIVERY: Courses posted as ‘Other’ may have to pivot to an alternative delivery format (see https://opened.uoguelph.ca/academic-continuity) in the case that requirements placed on the University and its employees by public health bodies, local, provincial, and federal governments necessitate such a mid-semester transition. Requirements for Fall 2020 course delivery include:
-Course should be designed and delivered within an inclusive and accessible learning environment consistent with the principles of Universal Instructional Design (see: https://opened.uoguelph.ca/student-resources/Universal-Instructional-Design).
-Course learning activities and assessments are to be created to easily accommodate alternative/remote teaching delivery methods.
-Submission of a final and deferred exam, if applicable, to Department ahead of the exam period.
-Plan to offer final exam, if applicable, in a modified format other than face-to-face.
-Courses that will be delivered in alternative formats and no additional payment will be provided for delivering courses in new format.
Projected Class Enrolment:
299 - split into two sections, one being taught be a faculty member and one offered as a SL position