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

I&C Sci 6D Discrete Mathematics for Computer Science

(Required for CSE.)
Catalog Data:

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)

Required Textbook:
. Edition, , 1969, ISBN-13 978-0073383095.

Recommended Textbook:
None
References:
None
Coordinator:
Gopi Meenakshisundaram
Relationship to Student Outcomes
No student outcomes specified.
Course Learning Outcomes. Students will:

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

Prerequisites by Topic

High school mathematics through trigonometry

Lecture Topics:
  • 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
Class Schedule:

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

Computer Usage:

None

Laboratory Projects:

None

Professional Component

None

Design Content Description
Approach:
Lectures:
Laboratory Portion:
Grading Criteria:
  • Homework: 25%
  • Quizzes: 25%
  • Final: 50%
Estimated ABET Category Content:

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

Prepared:
April 15, 2014
Senate Approved:
June 16, 2013
Approved Effective:
2013 Winter Qtr