CS201 Formal Foundations of Computer Science
Spring 1999
CS201 - Introduces elements of logic and discrete mathematics
that allow reasoning about computational structures and
processes. Generally, the areas of discrete structures, proof
techniques, and computational models are covered. Topics typically
include propositional and predicate logic; sets, relations,
functions, and graphs; proof by contradiction, induction, and
reduction; and finite state machines and regular languages.
Corequisite: CS 101G or significant prior programming experience.
Credit 3 units.
- Instructor
- Karl Stiefvater
-
qarl@cs.wustl.edu
- 314.935.8145
- Lopata 404b
- Office Hours
- Melanie - Sun 8:00pm-10:00pm
- Ronnie - Mon 5:30pm-7:30pm
- Glen - Mon 7:00pm-9:00pm
- Rhett - Tue 3:00pm-5:00pm
- Eric - Tue 4:15-6:15
- Karl - Tue and Thu 1:00pm-3:00pm
- Announcements
- 23 January -
Homework modification
- 31 January -
Homework modification 2
- 4 Februrary -
Homework modification 3
- 5 Februrary -
Yet another...
- 16 Februrary -
Exam news
- 16 March -
Homework notes
- 30 March -
Friday's Exam
- Handouts
- Course Information
- Course Syllabus
- Laws of Logic
- Proof Forms
- Homework
- HW1 assigned problems
- HW2 assigned problems
- HW3 assigned problems
- HW4 assigned problems
- HW5 assigned problems
- HW6 assigned problems
- HW7 assigned problems
- HW8 assigned problems
- HW9 assigned problems