CS3233 "Discrete Mathematical Structures"
Syllabus
Instructor: Dr. Razvan Andonie
Office: SB 3.02.01 E
Office
hours: Monday, Wednesday
Phone: 458-5689
Grader: Parul Mehta
Office: SB 3.02.04
Office
hours: Tuesday, Thursday
Textbook: K. Rosen, "Discrete Mathematics and Its Applications", 4th Edition, McGraw-Hill, 1999.
Discrete Mathematics Website: www.mhhe.com/math/advmath/rosen/
Prerequisites: MAT1223 Calculus II , CS1723 Data Structures.
COURSE DESCRIPTION AND OBJECTIVES
This course is a survey and development of the theoretical tools suitable for algorithmic applications. Major topics covered include propositional and predicate calculus, mathematical induction, proofs, set theory, and finite state automata. The objectives of this course are to introduce you to several mathematical concepts for analysing computer programs and to give you experience in the use of these concepts.
COURSE SCHEDULE
Midterm Exam: March 7.
Final Exam: May 10,
GRADING
Grading will be based on the weighted average scores as shown below:
Midterm Exam 25%
Final Exam 35%
Homeworks, Pop
Quizzes, Attendence 40%
This score will be translated into a grade as shown in the following table. A course curve may be implemented at the instructor’s discretion.
Average Grade
90 - 100 A
80 - 89.999 B
70 - 79.999 C
60 - 69.999 D
0 - 59.999 F
Attendance in class is very important, and will count toward your grade. During each lecture period, information regarding assignments, due dates, explanation and clarification of assignments, and material that is not covered in the assigned texts will typically be presented. If you miss a class for any reason, it is your responsibility to become familiar with the missed material. Obtaining a copy of the class notes of a fellow student is recommended in such cases.