Instructor
Margaret
Loper
Office: Electronics Research Building (ERB)
Phone: 894-4663
Email: margaret@cc.gatech.edu
Office Hours: Monday and Wednesday 11:00-11:45 or by appointment
General Class Information
Textbook: Discrete Mathematics with Applications, 2nd edition, by Susanna Epp
Newsgroup: git.cc.class.cs1050b
Web page: http://www.cc.gatech.edu/classes/AY2002/cs1050b_fall
Teaching Assistants
Hailemelekot
Seifu
seif@cc.gatech.edu
Tuesday/Thursday 9-10 CCB commons area
Barath
Petit
bpetit@cc.gatech.edu
Friday 2- 4 at CCB 154
Yi Ma
mikema@cc.gatech.edu
Monday 9-11 CCB commons area
Abhishek
Kumar
akumar@cc.gatech.edu
Wednesday 10-12 CCB 154
Homework
To do well on
the exams, you need to do the homework. When
I make up the exam, I expect that you have done and understood all the homework
problems. If you do not keep up
with the homework, you will do poorly on the exams.
Assignments:
You have one week to complete homework assignments.
All assignments must have your name and e-mail address (from your prism
account) written legibly at the top. Failure
to write one¡¯s name on the assignment will result in a zero for the
assignment.
Late
Homework Policy: I will
collect homework at the beginning of the class period.
If you do not turn in your homework by the end of class, your homework
grade will be reduced by 25%. If
your homework is not turned in during class time on the day it is due and you do
not have an excused absence, I will not accept it.
Honor
Code: I do not mind if
you work together on assignments, but you must write up the solutions on your
own. You are expected to reconstruct the solution to each problem
without the help of your study group. You
may not substitute material that is wholly or substantially identical to that
created or published (even in web format) by another individual or individuals.
Re-grade
Policy: All re-grade
requests must be made to the instructor in writing. Verbal re-grade requests and any re-grade requests made to
someone other than the instructor will not be honored.
If you alter your work after it is graded, please use a different color
(not red) than you used when you originally submitted the work.
Exams
We
will have two exams during the semester, one September 23rd and one October 28th.
Students are expected to take exams at the scheduled times.
A student who misses an exam may not take it unless the student has
received prior approval or, in the case of illness or an emergency, the student
calls the instructor within a reasonable time.
Grading
Homework: 20%
Exam 1: 25%
Exam 2: 25%
Final 30%
I
will use the following grading scale:
A 90-100%, B
80-89%, C 70-79%, D 60-69%, F 0-59%
Reading Assignments and Topics
|
Date |
Topic |
Book Section |
Homework |
Due Date |
|
8/19 |
Introduction, Syllabus, Logical Form |
1.1 |
|
|
|
8/21 |
Logical Equivalence |
1.1 |
|
|
|
8/23 |
Conditional Statements |
1.2 |
|
|
|
8/26 |
Valid and Invalid arguments |
1.3 |
9/4 |
|
|
8/28 |
Valid and Invalid arguments |
1.3 |
|
|
|
8/30 |
Digital Logic Circuits |
1.4 |
|
|
|
9/2 |
NO CLASS ¨C LABOR DAY |
|
|
|
|
9/4 |
Digital Logic Circuits |
1.4 |
9/11 |
|
|
9/6 |
Predicates and Quantified Statements |
2.1 |
|
|
|
9/9 |
Predicates and Quantified Statements |
2.2 |
|
|
|
9/11 |
Predicates and Quantified Statements |
2.2 |
|
|
|
9/13 |
Arguments with Quantified Statements |
2.3 |
9/20 |
|
|
9/16 |
Arguments with quantified statements Review for Test 1 |
2.3 |
|
|
|
9/18 |
Direct Proofs |
3.1-3.3 |
|
|
|
9/20 |
Direct Proofs |
3.1-3.3 |
|
|
|
9/23 |
TEST 1 |
|
|
|
|
9/25 |
Direct Proofs |
3.4-3.5 |
|
|
|
9/27 |
Direct Proofs |
3.4-3.5 |
|
|
|
9/30 |
Indirect Argument |
3.6 |
|
|
|
10/2 |
Sequences |
4.1 |
|
|
|
10/4 |
Sequences |
4.1 |
|
|
|
10/7 |
Induction |
4.2-4.3 |
|
|
|
10/9 |
Induction |
4.2-4.3 |
|
|
|
10/11 |
Strong
Induction |
4.4 |
|
|
|
10/14 |
NO CLASS ¨C Midterm Recess |
|
|
|
|
10/16 |
Correctness of Algorithms |
4.4 |
|
|
|
10/18 |
Correctness of Algorithms |
4.5 |
|
|
|
10/21 |
Set Theory Definitions |
5.1 |
|
|
|
10/23 |
Properties of Sets |
5.2 |
|
|
|
10/25 |
Empty Sets, Partitions, Power Sets, and Boolean Algebra |
5.3 |
|
|
|
10/28 |
TEST 2 |
|
|
|
|
10/30 |
Functions Defined on General Sets |
7.1 |
|
|
|
11/1 |
Finite-State Automata |
7.2 |
|
|
| 11/4 | Review Test 2 | ¡¡ | ¡¡ | ¡¡ |
|
11/6 |
One-to-One and Onto, Inverse Functions |
7.3 |
|
|
|
11/8 |
The Pigeonhole Principle |
7.4 |
11/18 |
|
|
11/11 |
Cardinality |
7.6 |
|
|
|
11/13 |
O-notation |
9.2 |
|
|
|
11/15 |
Relations on Sets |
10.1 |
|
|
|
11/18 |
Relations on Sets |
10.1 |
|
|
|
11/20 |
Reflexivity, Symmetry and Transitivity |
10.2 |
11/27 |
|
|
11/22 |
Reflexivity, Symmetry and Transitivity |