U Chicago CS Dept Logo
University of Chicago CSPP 512 - General Information

CSPP 512: Mathematics for Computer Science
Summer 2001
General Information

Goal

This course is an introduction to the kind of mathematics used for work in computer science. We will begin with logic and provide some basic training in rigorous mathematical proofs. We will then study sets, functions and relations, matrix algebra, recurrence relations, graphs, directed graphs, and binary trees. These topics are inherently interesting and are prerequisites for courses in Algorithms, Databases, and Networking.

Prerequisites

Precalculus, especially logarithms and exponentials, is a prerequisite; calculus is not required. There are no computer science prerequisites.

Textbook

The required text is Discrete Mathematics (Fifth Edition) by Richard Johnsonbaugh.

Syllabus

week topics
1 logic (ch 1)
propositional and predicate logic
2 mathematical proof
proof by induction
3 fundamental mathematics (ch 2)
sets and sequences
4-5 functions and relations
matrices
6-7 counting (ch 4)
recurrences (ch 5)
8-9 graph theory (ch 7)
10-11 trees (ch 7)
brady@cs.uchicago.edu