This course presents materials to augment the students’ theoretical foundation for computer science in the subject areas of formal logic, mathematical proof techniques, sets, combinatorics, functions and relations, trees and graphs, and graph algorithms.
Judith L. Gersting, Mathematical Structures for Computer Science, 7th edition, W.H. Freeman and Company, 2014.
Reference Book (optional) :
Kenneth Rosen, Discrete Mathematics and Its applications, 6the edition, McGraw Hill Publishing Company, 2007.
All the lecture notes, homework assignments, and solutions will be posted on the web.Grading:
There will be NO make-up exams or quizzes unless the instructor has been notified in advance, and then only under extenuating circumstances as determined by the instructor, whose decision is final. The three exams are not inclusive and each will cover approximately one third of the lecture materials. Exam are closed book, closed notes, and closed internet/phone access. All the exams will be one hour and 20 minutes long.
It is the student’s responsibility to read and review the assigned sections in the textbook.
There will be 5 fifteen-minute quizzes. (closed book, closed notes, closed internet/phone access.)
Assignments are due in or before class on the date indicated on the class website. Late assignments will not be accepted and extensions will only be granted in extreme situations.
Cheating, plagiarism, or collusion will not be tolerated. A Statement of Ethics is provided for you to read, sign, return, and follow. Violators of the ethics code will be reported to the dean. If academic dishonesty is suspected, the case may be referred to the VP for Student Affairs for resolution.