CSCI/MATH2610:
Discrete Mathematics for Computer Science
(Prerequisite: CSCI1301)
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 Institute for Artificial Intelligence)
Email: potter at cs
dot uga dot edu
Office:
GSRC113 (enter through 111)
Phone:
5420361
Hours:
By Appointment, Drop In, or _________________
Notes: If you stopby 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% (Feb 2, Mar 2, Apr 6, Apr 27; 10% each)
Final Exam 30% (May 7^{th},
Thursday at noon)
(Scale: A: 93100, A: 9092, B+: 8789, B: 8386, B: 8082, C+:
7779, C: 7376, C: 7072, D: 6069, 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, makeup exams are not provided. In very rare Universityapproved absence
excuse cases, a makeup 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 
Jan 8 
Introduction & welcome 

Jan 12  15 
Ch 1.1 1.5: Logic & Inference 

Jan 19  22 
Ch 1.6 2.2: Proofs & Sets 

Jan 26  29 
Ch 2.3, 11.1 11.2: Boolean Algebra 

Feb 2  5 
Ch 11.3  11.4, 2.4: Logic Gates & Sums 
Test 1 on Feb 2 
Feb 9  12 
Ch 3.1 3.3: Algorithms 

Feb 16  19 
Ch 3.4 3.5: Integers 

Feb 23  26 
Ch 3.5 3.6: More Integers & Algorithms 

Mar 2  5 
Ch 4.1 4.2: Induction 
Test 2 on Mar 2 
Mar 16  19 
Ch 4.3 4.5: Recursive Algorithms 

Mar 23  26 
Ch 5.1 5.2: Counting 

Mar 30 Apr 2 
Ch 5.3 5.4: Permutations & Combinations 

Apr 6  9 
Ch 6.1 6.2: Probability 
Test 3 on Apr 6 
Apr 13  16 
Ch 6.3 6.4: Bayes Theorem 

Apr 20  23 
Ch 7.1 7.2: Recurrences 

Apr 27  28 
Ch 8.1 8.3: Relations 
Test 4 on Apr 27 
Apr 28  30 
Ch 8.4 8.6: More on Relations 




May 7^{th} 
Thursday at noon 
Final Exam May 7^{th} at noon 
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 against which students should guard are:
Three steps to help prevent academic dishonesty are:
All faculty, staff and students are encouraged to report all suspected cases of academic dishonesty. All cases of suspected academic dishonesty (cheating) will be referred to the Office of Judicial Programs. Penalties imposed by the Office of Judicial Programs may include a failing grade in the course and a notation on the students transcript. Repeated violations are punishable by expulsion from the University. For further information please refer to the UGA Code of Conduct, available at the URL below.
http://www.uga.edu/judicialprograms/200607%20Code%20of%20Conduct.pdf
Revised 8/2006