Instructor
Margaret Loper
Office: Electronics Research Building (ERB) 248
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.cs1050c
Web page: http://www.cc.gatech.edu/classes/AY2002/cs1050c_spring
Teaching Assistants
Kemin Yang
Office Hours: Tuesday
and Thursday 1:00-2:30pm in CoC common area
Email: kemin@cc.gatech.edu
Bessie Yang
Office Hours: Tuesday
and Thursday 11:00-12:00am in CoC common area
Email: bessie@cc.gatech.edu
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: Homework assignments will be given on Wednesdays and you have one week to complete the assignment. 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 your homework is more than fifteen minutes late, 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 February 8th and one March 22nd. 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 |
|
1/4 |
Introduction,
Syllabus, Logical Form |
1.1 |
|
|
|
1/7 |
Logical
Equivalence |
1.1 |
|
|
|
1/9 |
Conditional
Statements |
1.2 |
HW
1 |
1/16 |
|
1/11 |
Valid
and Invalid arguments |
1.3 |
|
|
|
1/14 |
Valid
and Invalid arguments |
1.3 |
|
|
|
1/16 |
Digital
Logic Circuits |
1.4 |
HW
2 |
1/23 |
|
1/18 |
Digital
Logic Circuits |
1.4 |
|
|
|
1/21 |
NO
CLASS – MLK DAY |
|
|
|
|
1/23 |
Predicates
and Quantified Statements |
2.1 |
|
|
|
1/25 |
Predicates
and Quantified Statements |
2.2 |
HW
3 |
2/1
|
|
1/28 |
Predicates
and Quantified Statements |
2.2 |
|
|
|
1/30 |
Arguments
with Quantified Statements |
2.3 |
|
|
|
2/1 |
Arguments
with quantified statements Review
for Test 1 |
2.3 |
|
|
|
2/4 |
Direct
Proofs |
3.1-3.3 |
|
|
|
2/6 |
Direct
Proofs |
3.1-3.1 |
|
|
|
2/8 |
TEST 1 |
|
|
|
|
2/11 |
Direct
Proofs |
3.1-3.3 |
|
|
|
2/13 |
Direct
Proofs |
3.4-3.5 |
|
|
|
2/15 |
Direct
Proofs |
3.4-3.5 |
|
|
|
2/18 |
Indirect
Argument |
3.6 |
HW
4 |
2/25
|
|
2/20 |
Sequences |
4.1 |
|
|
|
2/22 |
Sequences |
4.1 |
|
|
|
2/25 |
Induction |
4.2-4.3 |
|
|
|
2/27 |
Induction |
4.2-4.3 |
HW
5 |
3/13 |
|
3/1 |
Induction
|
4.4 |
|
|
|
3/4
|
NO
CLASS - SPRING BREAK |
|
|
|
|
3/6 |
NO
CLASS - SPRING BREAK |
|
|
|
|
3/8 |
NO
CLASS - SPRING BREAK |
|
|
|
|
3/11 |
Induction |
4.4 |
|
|
|
3/13 |
Correctness
of Algorithms |
4.5 |
|
|
|
3/15 |
Correctness
of Algorithms Review
for Test 2 |
4.5 |
|
|
|
3/18 |
Set
Theory Definitions |
5.1 |
|
|
|
3/20 |
Properties
of Sets |
5.2 |
|
|
|
3/22 |
TEST 2 |
|
|
|
|
3/25 |
Properties
of Sets |
5.2 |
|
|
|
3/27 |
Empty
Sets, Partitions, Power Sets, and Boolean Algebra |
5.3 |
|
|
|
3/29 |
Functions
Defined on General Sets |
7.1 |
|
|
|
4/1 |
Functions
Defined on General Sets |
7.1 |
|
|
|
4/3 |
Finite-State
Automata |
7.2 |
|
|
|
4/5 |
One-to-One
and Onto, Inverse Functions |
7.3 |
|
|
|
4/8 |
The
Pigeonhole Principle |
7.4 |
|
|
|
4/10 |
The
Pigeonhole Principle |
7.4 |
|
|
|
4/12 |
Cardinality |
7.6 |
|
|
|
4/15 |
O-notation |
9.2 |
|
|
|
4/17 |
Relations
on Sets |
10.1 |
|
|
|
4/19 |
Relations
on Sets |
10.1 |
|
|
|
4/22 |
Reflexivity,
Symmetry and Transitivity |
10.2 |
|
|
|
4/24 |
Equivalence
Relations |
10.3 |
|
|
|
4/26 |
Equivalence
Relations Review
for Final |
10.3 |
|
|
Examples
Determining an argument is valid or not (Questions, Answers).
Converting between formal English and Predicates (Questions, Answers).
Assignments
Homework 1—Due on 1/16/02
Wednesday
Section 1.1
2,7,13,14,18,24,28,39,44,45
Section 1.2
4,7,10,16b,16e,17b, 26, 30, 35, 40c
Homework 2
Section 1.3
5, 9, 22, 25, 31, 37b, 41
Section 1.4
8, 12, 17, 21, 26, 31, 32
Homework 3
Section 2.1
5, 10, 11b, 14, 25, 34
Section 2.2
4, 8, 15, 19, 23, 29
Section 2.3
12, 14, 16, 19c, 24, 28
Homework 4 (due 2/25)
3.1: 8, 16, 20, 26, 35
3.2: 10, 19
3.3: 10, 15, 20, 24, 31c
3.4: 3, 9, 20
3.5: 20, 27
Homework 5 (due 3/13)
Section 3.6
3, 7, 14
Section 4.1
16, 21, 30, 36, 53
Section 4.2
4, 7, 10, 20
Section 4.3
7, 10, 15
Section 4.4
3, 5
Homework#6 (due 4/8)
Section 5.1
7, 14, 17
Section 5.2
11, 12, 18, 33
Section 5.3
13, 18, 23
Homework#7(due 4/15)
section 7.1
2, 12b, 12d
section 7.2
6, 9, 22
section 7.3
3 (a,b), 5 (a,b,c), 9a, 36
section 7.4
16, 29
section 7.6
2, 11, 12
Homework#8 (due 4/22)
Section 9.2
6, 12, 22, 26
Section 10.1
2, 6, 14, 18, 30
Section 10.2
10, 16, 22, 24
Section 10.3
5, 10, 16, 28