Subject

ECS 020

Title

Discrete Mathematics For Computer Science

Status

Active

Units

4.0

Effective Term

2017 Winter Quarter

Learning Activities

Lecture - 3.0 hours

Discussion - 1.0 hours

Discussion - 1.0 hours

Description

Discrete mathematics of particular utility to computer science. Proofs by induction. Propositional and first-order logic. Sets, functions, and relations. Big-O and related notations. Recursion and solutions of recurrence relations. Combinatorics. Probability on finite probability spaces. Graph theory. GE Prior to Fall 2011: SciEng. GE: SE, QL.

Prerequisites

MAT 016A C- or better or MAT 017A C- or better or MAT 021A C- or better

Enrollment Restrictions

Pass One open to Computer Science, Computer Science Engineering, Computer Engineering, and Cognitive Science Majors only.