CS 1050 B - Constructing Proofs

Fall 2005

[ Lectures] [Homework]


Web Announcements

Final exam is Thursday, December 15, 8-10:50 am.

Course Description

Theme: Basic primitives and paradigms for the mathematical understanding of computation.

Tentative list of topics:

Propositions, Proofs, Propositional Logic.
Induction and Recursion.
Graphs and State Machines.
Basic Counting and Probability.
Diagonalization and Uncomputability.
Number Theory: Euclid's Algorithm, Primality, RSA.

Lectures

MWF 10:05-10:55, CoC Room 53.
The material covered in each lecture together with references and/or notes will be posted in the Lectures web page.

Instructor

Eric Vigoda, Associate Professor
Office phone: 404-894-9150
Office hours: Monday and Wednesday, 11:00-12:00, College of Computing Room 237, or by appointment.
Email:

Teaching Assistants

Jun Xiao
Email:
Office Hours: Tuesday ** 4:30-5:30 ** and Thursday ** 5:30-6:30 **
They will be held in the College of Computing Commons Area on the first floor.

Text and Notes

(1) Discrete Mathematics and Its Applications, 5th Edition, by Kenneth H. Rosen.
(2) Notes from a similar class at Berkeley.

Grading

Weekly or biweekly homeworks (we shall drop the lowest 2 grades): 33.33%.
You may discuss the homeworks with other people in the class. But:
You MUST write your answers by yourselves, without any collaboration and without using any resource, as if you are taking a test.
You should also indicate on the top of your homework who, if anyone, you discussed the homework with.
Academic conduct is subject to the Georgia Tech Honor Code.

Complete solutions will be always posted on the Web shortly after the deadline.

Homeworks are due at the beginning of class on the noted date.
Late homework policy: no credit for late homeworks.

Three quizes: 33.33%.
First quiz is Fri, Sept 23.
Final exam: 33.33%.
The final exam is scheduled for Thursday, December 15 from 8-10:50 am.

Resources

Class Web-site http://www.cc.gatech.edu/~vigoda/1050.