CSCI(MATH) 2610(CS_34792, Math_54793): Discrete Mathematics for Computer Science
INSTRUCTOR: Dr. Thiab R. Taha, e-mail: firstname.lastname@example.org
OFFICE: Boyd Graduate Studies Research Center, Room 545
OFFICE HOURS: T, Th 2:00 - 2:50 P, GSRC 545
PREREQUISITE: MATH 1113 Precalculus.
LECTURES: M/05(12:20-1:10P) & Tu,Th/74(12:30-1:45P), Room 208 Boyd, GSRC
COURSE OBJECTIVES: To learn the basic logical and mathematical tools used in computer science.
TEXT: Discrete Mathematics and Its Applications (Sixth Edition) by Kenneth Rosen
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.
There will be a ten-minute quiz almost every week. There will be no makeup quizzes. 2 lowest grades for quizzes will be dropped.
HOMEWORK AND READING:
Will be assigned to help you understand the material. Homework will not be graded. Quizzes will be based on homework problems.
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.
ATTENDANCE: Regular class attendance is important. I reserve the right to withdraw you from the class if you miss too many classes.
Academic Honesty: The Department Policy applies: see overleaf.