The official course webpage is on WebCT Vista.
Please make sure that you sign on to WebCT Vista and get the up-to-date information there.
This course teaches the fundamental tools, ideas, and principles underlying the field of computer science.
The class trains students to rigorously formulate and solve problems relevant to all areas of computer science.
It challenges students to develop their general reasoning ability.
SC 239
MWF 9:30-10:20am
CS 180 and MATH 161.
Greg N. Frederickson
Office: CS 224
Office hours: Monday 1:00-2:00, Thursday 1:00-2:00, Friday 11:00-12:00
email: gnf at cs.purdue.edu
Check the WebCT Vista webpage for this information.
- Efim Kinber and Carl Smith,
Theory of Computing: A Gentle Introduction, Prentice Hall, 2001.
- Kenneth H. Rosen,
Discrete Math and Its Applications, fifth edition, McGraw Hill, 2003.
Logic and proofs
Sets, sequences, strings, relations, and functions
Number representations
Discrete probability
Mathematical proofs
Algorithms
Boolean algebra and combinatorial circuits
Finite state machines
Pushdown automata
Complexity classes, computability, and undecidability
Total weight in grade Quizzes (2-4) 10% Problem sets (8-10) and programming assignments (1-3) 20% Midterm 1
- 7:00-8:00pm, February 1520% Midterm 2
- 7:00-8:00pm, March 2820% Final Exam
- during Exam Week30%
Last updated January 8, 2006.