# I&C SCI 6D Discrete Mathematics for Computer Science (2015-2016)

#### I&C Sci 6D Discrete Mathematics for Computer Science

**I&C SCI 6D Discrete Mathematics for Computer Science (Credit Units: 4)** Covers essential tools from discrete mathematics used in computer science with an emphasis on the process of abstracting computational problems and analyzing them mathematically. Topics include: mathematical induction, combinatorics, and recurrence relations. Prerequisite: High school mathematics through trigonometry. (Design units: 0)

1. Be able to apply discrete mathematics to computer science problems.

High school mathematics through trigonometry

- Logic
- Sequences, Functions, Cardinals, Matrices
- Algorithms
- Induction and Recursion
- Counting
- Discrete Probability
- Advanced Counting 1: Recurrence relations
- Advanced Counting 2: Generating functions and inclusion/exclusion

Meets for 3 hours of lecture and 2 hours of discussion each week for 10 weeks.

None

None

None

- Homework: 25%
- Quizzes: 25%
- Final: 50%

Mathematics and Basic Science: 4.0 credit units

Computing: 0.0 credit units

Engineering Topics: 0.0 credit units

Engineering Science: 0.0 credit units

Engineering Design: 0.0 credit units