CSCI/MATH-2610:
Discrete Mathematics for Computer Science
(Prerequisite: CSCI-1301)
Description
The
fundamental mathematical tools used in computer science: sets, relations, and
functions; propositional logic, predicate logic, and inductive proofs; summations,
recurrences, and elementary asymptotics; counting and
discrete probability; undirected and directed graphs; introductory linear
algebra, with applications in computer science.
Instructor:
Don Potter (Professor
of Computer Science and Director of the Artificial
Email: potter at cs
dot uga dot edu
Office:
GSRC-113 (enter through 111)
Phone:
542-0361
Hours:
By Appointment, Drop In, or _________________
Notes: If you stop-by or call and I'm NOT available, then be sure to leave a note (I'll be glad to call you
back).
Class:
References:
1) The textbook and its supporting materials. Be sure you take advantage of these.
2) Web
page: http://www.cs.uga.edu/~potter/dismath
Grading:
Assignments 30% (homework,
reports, projects, and presentations)
Exams 40% (Sept. 11, Oct. 9, Nov. 6, Dec. 4; 10%
each)
Final Exam 30% (December
14th,
(Scale: A: 93-100, A-: 90-92, B+: 87-89, B: 83-86, B-: 80-82, C+:
77-79, C: 73-76, C-: 70-72, D: 60-69, F: <60)
Each student is expected to do his/her own work. Any evidence of academic dishonesty will not
be tolerated, and will be subject to disciplinary action. Be sure you are familiar with the
University's academic honesty policy as well as the CS departmental policy
(attached). See http://www.uga.edu/ovpi/honesty/acadhon.htm
for details.
Homework assignments are due at the beginning of class on the date
they are due. Late assignments will not
be accepted. Alternate arrangements must
be made in advance of the due date.
Typically, make-up exams are not provided. In very rare University-approved absence
excuse cases, a make-up exam may be arranged.
NOTE: The course syllabus provides a general plan for the course;
deviations may be necessary.
Tentative
Class Schedule
|
Date |
Topics &
Readings |
Comments &
Assignments |
|
Aug 17 |
Introduction & welcome |
|
|
Aug 21 - 24 |
Ch 1.1 – 1.5: Logic & Inference |
|
|
Aug 28 - 31 |
Ch 1.6 – 2.2: Proofs & Sets |
|
|
Sept 5 - 7 |
Ch 2.3, 11.1 – 11.2: Boolean Algebra |
|
|
Sept 11 - 14 |
Ch 11.3 - 11.4, 2.4: Logic Gates & Sums |
Test 1 on Sept 11 |
|
Sept 18 - 21 |
Ch 3.1 – 3.3: Algorithms |
|
|
Sept 25 - 28 |
Ch 3.4 – 3.5: Integers |
|
|
Oct 2 - 5 |
Ch 3.5 – 3.6: More Integers & Algorithms |
|
|
Oct 9 - 12 |
Ch 4.1 – 4.2: Induction |
Test 2 on Oct 9 |
|
Oct 16 - 19 |
Ch 4.3 – 4.5: Recursive Algorithms |
|
|
Oct 23 - 24 |
Ch 5.1 – 5.2: Counting |
|
|
Oct 30 – Nov 2 |
Ch 5.3 – 5.4: Permutations & Combinations |
|
|
Nov 6 - 9 |
Ch 6.1 – 6.2: Probability |
Test 3 on Nov 6 |
|
Nov 13 - 16 |
Ch 6.3 – 6.4: Bayes’ Theorem |
|
|
Nov 20 - 21 |
Ch 7.1 – 7.2: Recurrences |
|
|
Nov 27 - 30 |
Ch 8.1 – 8.3: Relations |
|
|
Dec 4 - 5 |
Ch 8.4 – 8.6: More on Relations |
Test 4 on Dec 4 |
|
|
|
|
|
Dec 14 |
|
Final Exam at |
Computer
Science
Departmental Policy Statement
Academic Honesty
The Computer Science Department recognizes
honesty and integrity as necessary to the academic function of the University. Therefore, all students are reminded that the
CS faculty requires compliance with the conduct regulations found in the
Common forms of academic dishonesty that
students should guard against are:
Three steps to
help prevent academic dishonesty are:
All faculty,
staff, and students are encouraged to report all suspected cases of academic
dishonesty. Serious cases of suspected
academic dishonesty (cheating) will be referred to the Office of Academic
Affairs. Penalties imposed by the Office
of Academic Affairs may include a failing grade in the course and a notation on
the student's transcript. Repeated
violations are punishable by expulsion from the University. For further information please refer to the
following webside: http://www.uga.edu/ovpi.
Revised 8/2003