**CISC 102**

**Discrete Structures I**

**Units: 3.00**

Introduction to mathematical discourse and proof methods with a focus on discrete structures. Sets, sequences, and relations. Properties of the integers. Induction. Counting with permutations and combinations, pigeonhole principle. Principle of Inclusion-Exclusion. Introduction to graphs and graph terminology.

NOTE Also offered online. Consult Arts and Science Online (Learning Hours may vary).

NOTE Also offered online. Consult Arts and Science Online (Learning Hours may vary).

**Learning Hours:**120 (36 Lecture, 84 Private Study)

**Requirements:**Prerequisite None.

**Offering Faculty:**Faculty of Arts and Science

**Course Learning Outcomes:**

- Analyze and/or solve problems using discrete structures.
- Construct mathematical proofs using basic proof methods.
- Apply graph theory to solve basic problems.
- Use concepts for discrete structures to produce correct computer code to solve problems.
- Communicate concepts and/or solutions using discrete structures to a technical audience.