Instructor: Hamid Behmard
Office: MNB 119, phone: 838-8869, email: email@example.com
Office Hours: 2:00-3:00 Mon, Tues, Wed; 1:00-2:00 Tue; 3:00-4:00 Wed; other times by appointment.
Text: Discrete Mathematical, by Richard Johnsonbaugh( ISBN-10 0-13-159318-8 or ISBN-13 978-0-13-159318-3)
Who: This class is intended for students who are majored in computer
science and have passed Math 231 with a grade of C- or better.
I strongly advise you against taking this
course if you have not satisfied the prerequisite.
Goal: We will cover selected sections of chapters 4, 5, 6, 7, and 8. The topics include but not limited to Euclidean Algorithm, permutations, combinations, recurrence relations, pigeonhole principle, and graph theory.
Homework: Since homework is our main tool for learning, it is the most important activity of the course. You will be assigned homework every class day. I will collect the assignments as announced in class.
Attendance: If you miss class, it is your responsibility to ask a classmate for notes on the material that you have missed. I will also try to have a copy of the class notes posted on our class page on Moodle.
Midterm Exams: There will be two in class midterm exams on January 30 and February 27.
Final exam: A comprehensive third exam will be given on Friday March 22 at 12:00. The final is required for all students. There is no early final exam.
There is no make-up for any missed homework, or midterms.
Nonacademic electronic devices and tardiness policies: You are not allowed to use any nonacademic electronic devices (Ipod, MP3 players, cell phones, etc.) during the class time. If you bring your cell phone into the class, you MUST turn it off. If you need to have your cell phone on, you need to talk to me prior to class. If you are consistently late to class (3 minutes or more), I will ask you not to attend the class until you resolve your time conflict.
Midterms 40% (two at 20% each)
Grades will be assigned according to the following scale:
Where to get help:
General guidelines for success: