CS 1050 A - Constructing Proofs

Fall 2006

[ Lectures] [Homework] [Puzzles]


Web Announcements

Final exam is on Dec 12, Tue,  starting at  3:00 pm  (2:30 hours),  in the regular classroom.

Following topics will *not* be on the exam (everything else taught in the course will be on the exam):         * propositional logic     * countable and uncountable numbers      *recurrence relations      *chinese remainder theorem,  Fermat's little theorem,  RSA    *Eulerian tours

Practice problems on graph theory are posted below.

Homework-6 is now online. Due on Wed, Dec 6.

There is a homework-3 with no name of it. Please collect it from me, otherwise you do not get credit for it.

Handouts

Handout on solving recurrence relations

Practice  Problems

Page numbers are as in Rosen's book, 6th Ed.  

Page 17:   8, 25, 27(a,c,d),  

Page 28:   4, 7, 9(a,b,c,d),  11(a,b,c,d) 

Page  47:   7,  12,  33,  35

Page 85:   2,  7,  8, 17,  18,  27   

Page 102:   1,  27,  34,  33     

Page 119:   1,  10, 12, 33, 34

Page 130:   1, 3,  16,  19,  25,  26

Page 146:   1,  10,  11,  12(a,b,c),  16,  19, 29,  30, 31

Page  61:  26,  27,  30, 40

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

Page 280:  5, 8, 11, 15,  19, 28, 32,  48

Page 291:  4,  12, 29  

Page 308:   1, 5, 9, 12, 13, 14

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

Page 191:  1, 2, 5, 6, 7, 13, 16, 17, 36

Page 208:  6, 7, 8, 9, 20, 21, 22, 24

Page 217:  4, 5, 11, 20, 32

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

Page 608: 5, 6, 30, 34, 35,  36

 

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.
Basic Counting and Probability.
Diagonalization and Uncomputability.
Number Theory: Euclid 's Algorithm, Primality, RSA.

Lectures

MWF 11:05-11:55,   Room:  Bunger-Henry 311

The material covered in each lecture together with references and/or notes will be posted in the Lectures web page.

Instructor

Subhash Khot  

Assistant Professor
Office phone: 404-385-6603
Office hours: Monday and Wednesday, 12:00-1:00, College of Computing Room 234 
Email:    last_name@cc.gatech.edu

 

Teaching Assistants

Shakti Kamal     Email:  last_name@cc.gatech.edu

Office hours:  Tuesday and Thursday,   1:45-2:45 in CoC Commons

 

 

Text and Notes

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

Grading

Weekly or biweekly homeworks (we shall drop the lowest 2 homework scores): 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%.

Final exam: 33.33%.

Resources

Class Web-site http://www.cc.gatech.edu/~khot/cs1050/index.html