CS1050D: Understanding and Constructing
Proofs

Course Syllabus

Spring 2002, College of Computing, Georgia Tech

** TEACHING ASSISTANTS**:

Name: Rahim Shariff

Email: rahim@cc

Office Hours: M, W, F 11:00 A.M.-12:00 P.M. in Common Area

---------------------------------------------------------------------

Name: Sandip Agarwala

Office: CCB154

Email: sandip@cc

Office Hours: T, Th 1:30-3:00 P.M. in his office

** CLASSROOM:** Boggs B6

** CLASS URL**: <http://webct.gatech.edu/>

** REQUIRED TEXT**:
Discrete Mathematics with Applications, by Susanna S. Epp, Second Edition.

__COURSE DESCRIPTION :__

Introduction to techniques of rigorous argumentation, emphasizing reading and
writing of formal and informal proofs.
Application of techniques to domains of relevance to computer science.

__EXAMS AND HOMEWORKS:__

Percentage

Exam
I
20% (Feb. 12, 2002)

Exam II 20% (March 21, 2002)

Final Exam 30% (April 30, 2002;
2:50-5:40 P.M.)

Homework 30%

--------------------------

Total
100%

__FINAL GRADES____:__

Grade
Percentage

A
90% and up

B
80% - 89.99%

C
70% - 79.99%

D
60% - 69.99%

F
59.99% or less

__COURSE POLICY:__

1. Class participation is essential in learning computer technology. It
is your responsibility to attend classes in order to achieve good learning,
therefore obtain a good grade.

2. You must NOT miss a test unless you have a verifiable excuse. An unexcused absence from a test will result in a numerical grade of zero for that test.

3. Late assignments will be penalized 10% per day for up to 3 days after the assigned due date. Any assignment turned in late more than three days will not be accepted.

Week One Chapter 1 – The Logic of Compound Statements

Week Two Chapter 1 – The Logic of Compound Statements

Week Three Chapter 2 – The Logic of Quantified Statements

Week Four Chapter 2 – The Logic of Quantified Statements

Week Five Chapter 3 – Elementary Number Theory and Methods of Proof

Week Six Chapter 4 – Sequences and Mathematical Induction

Week Seven Chapter 4 – Sequences and Mathematical Induction

Week Eight Chapter 5 - Set Theory

Week Nine Chapter 5 - Set Theory

Week Ten Chapter 7 - Functions

Week Eleven Chapter 7 - Functions

Week Twelve Chapter 9 – O-Notation and the Efficiency of Algorithms

Week Thirteen Chapter 9 – O-Notation and the Efficiency of Algorithms

Week Fourteen Chapter 10 - Relations

Week Fifteen Chapter 6 - Counting

Week Sixteen Chapter 8 - Recursion

Week Seventeen Chapter 11
– Graphs and Trees

__LAST DAY TO DROP WITHOUT
ACADEMIC PENALTY__**:
Feb. 15, 2002**

__CLASS RECESSES DURING TERM__**: Jan. 21 (MLK Holiday) & March 4-8
(Spring Break)**