CSCI 2610 Discrete Mathematics

CSCI 2610 Discrete Mathematics for Computer Science

Spring 2011: Tuesdays and Thursdays 12:30pm - 1:45pm, Wednesdays 12:20pm - 1:10pm, Boyd GSRC 208

Instructor: Prof. Khaled Rasheed
Telephone: 542-3444
Office Hours: Tuesday: 1:50-3pm and Wednesday: 4:35-6:00pm or by email appointment
Office Location: Room 219B, Boyd GSRC
Email: khaled@cs.uga.edu

Teaching Assistant: Anirban Mukhopadhyay
Office Hours: Monday: 12:30-1:30pm
Office Location: Room 207A, Boyd GSRC
Email: anirban1@uga.edu

Prerequisites:

MATH 1113, CSCI 1301-1301L. (Strictly enforced)

Topics to be Covered:

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; graphs and trees; introductory linear algebra, with applications in computer science.

Expected Work:

Reading; homework assignments; four hourly exams; and final. All assignments and all exams must be done entirely on your own. Attendance in all lectures is expected. You are responsible for all material taught in class even if you are absent and it is not in the book. Attendance in the hourly exams is mandatory with no possibility for makeup exams.

Academic Honesty and Integrity:

All academic work must meet the standards contained in "A Culture of Honesty." Students are responsible for informing themselves about those standards before performing any academic work. The penalties for academic dishonesty are severe and ignorance is not an acceptable defence.

Grading Policy:

  • Assignments: 15% (homeworks and attendance)
  • Hourly Examinations: 60%
  • Final Examination: 25%

    Assignment Submission Policy

    Assignments must be turned in by the assigned deadline in class. Late assignments will not be accepted. Rare exceptions may be made by the instructor only under extenuating circumstances and in accordance with the university policies.

    Course Home-page

    The Class Home-page is at http://cobweb.cs.uga.edu/~khaled/DMcourse/. Materials including announcements, handouts, lecture notes and assignments will be posted there. Announcements may be posted between class meetings. You are responsible for being aware of whatever information is posted there.

    Lecture Notes

    Copies of some of Dr. Rasheed's lecture notes will be available at the bottom of the class home page. Not all the lectures will have electronic notes though and the students should be prepared to take notes inside the lecture at any time.

    Textbook in Bookstore (Required)

    Discrete Mathematics and its Applications, by Kenneth H. Rosen.
    McGraw-Hill Science/Engineering/Math, 6th Edition
    ISBN-10: 0073312711
    ISBN-13: 978-0073312712.
    The book has an excellent companion online student learning center.

    Announcements:

  • [3-31-2011] The third exam will be on Wednesday April 13th. It will cover Chapters 3 and 4. Only the sections and topics disscussed in class will be included. The exam is closed book closed notes.
  • [3-10-2011] The due date for Homework 6 has been extended to Thursday 3-24. Your projected letter grades will be emailed to you some time next week.
  • [3-5-2011] The second exam will be on Wednesday March 9th. It will cover Chapter 2 and Boolean Algebra (Chapter 11 in the regular text and 10 in some international editions. Only the first three sections of the Boolean Algebra chapter are covered). The exam is closed book closed notes. Please bring a calculator to the exam. Also the lecture on Tuesday will include a review of the homework and other problems in preparation for the exam.
  • [3-5-2011] The TA's office hour next week only will be held on Wednesday from 2:20pm to 3:20pm.
  • [3-2-2011] Please note that there is a difference between the regular text book and one of the international editions (the black and white one). There is one missing chapter in that international edition. As a result, Boolean Algebra is chapter 10 rather than 11 in that international edition. The sections and the problems are the same though.
  • [2-24-2011] Starting next week, attendance may be taken at any lecture and it will affect homework grades.

    Assignments:

  • Homework Assignment 10

    Lecture Notes:

  • Lecture Notes 1:Propositional Logic
  • Lecture Notes 2:Predicate Logic
  • Lecture Notes 3:Proof Techniques
  • Lecture Notes 4:Set Theory
  • Lecture Notes 5:Functions
  • Lecture Notes 6:Sequences and Summations
  • Lecture Notes 7:Boolean Algebra
  • Lecture Notes 8:Algorithms
  • Lecture Notes 9:Number Theory
  • Lecture Notes 10:Mathematical
  • Lecture Notes 11:Recursive Definitions and structural Induction
  • Lecture Notes 12:Counting
  • Lecture Notes 13:Probability
  • Lecture Notes 14:Bayes' Theorem
  • Lecture Notes 15:Relations
    The course syllabus is a general plan for the course; deviations announced to the class by the instructor may be necessary.

    Last modified: April 21, 2011.

    Khaled Rasheed (khaled [at] cs.uga.edu)