CSCI(MATH) 2610: Discrete Mathematics for Computer Science

Fall Semester 2007

Syllabus

INSTRUCTOR: Dr. Thiab R. Taha, e-mail: thiab@cs.uga.edu

OFFICE: Boyd Graduate Studies Research Center, Room 420

OFFICE HOURS: T, Th 12:30 PM - 1:20 PM, GSRC 420

PREREQUISITE: MATH 1113 Precalculus.

LECTURES: W/06 & Tu,Th/75 306 Boyd, GSRC

TOPICS COVERED:

  1. Logic and Proofs
  2. Sets, Functions,Sequences and Summations.
  3. Algorithms.
  4. Matrices.
  5. Methods of Proofs and Mathematical Induction.
  6. Relations.
  7. Recurrences.
  8. Boolean Algebra.
  9. Counting and Discrete Probability.
  10. Graphs.
  11. Introduction to Trees

TEXT: Discrete Mathematics and Its Applications (Sixth Edition) by Kenneth Rosen

SCOPE:
The course will cover essentially the following sections 1.1-1.7, 2.1-2.4, 3.1-3.8, 4.1-4.4, 5.1-5.6, 6.1-6.4, 7.1-7.5, 8.1-8.6, 9.1-9.4, 10.1 - 10.2, 11.1-11.4 from the text book. Additional reading material may be assigned during the course.

HOMEWORK AND READING:
Will be assigned to help you understand the material. Homework will be collected in lectures.

GRADING:

  • Hour tests, in class (2) 50% (October 04, 2007 and November 15, 2007)
  • Final Exam 30%
  • Homeworks 20%

    MAKE UP TESTS: No make up tests.

    Unexcused test absences result in a score of zero for the missing test. Excused absences require extenuating circumstances and advance notice; the missing grade will be replaced by the average of the other tests grades.

    Note: The course syllabus provides a general plan for the course; deviations may be necessary.

    Academic Honesty: The Department Policy applies: see overleaf.

    (OVER)