725-310-0 Mathematical Foundations of Computer Science
Basic concepts of finite and structural mathematics. Sets, axiomatic systems, the propositional and predicate calculi, and graph theory. Application to computer science: sequential machines, formal grammars, and software design. Prerequisites: 725-110 or 725-111 and 435-214-3. Prerequisite for: 725-322, 725-332, 725-339, 725-343, 725-351.
|Name||Miguel A. Lerma||Pin Ren|
|Office||Lunt 203||Computer Science Dept. Room 230
1890 Maple Ave.
|mlerma at math dot northwestern dot email@example.com|
|Office Hours||by appointment
||M 3:00-5:00PM or by appointment|
|Teaching in||ANN G29||ANN G29|
Richard Johnsonbaugh: Discrete Mathematics, Fifth Edition, 2001, Prentice Hall.
Miguel A. Lerma: Notes on Discrete Mathematics. (See bellow.)
The problem sessions will be held on Tuesdays under the TA's supervision.
The homework assignments will be posted on this web page.
There will be one one-hour Midterm Exam and one two-hour Final Exam.
No make-up exams will be given. In the event of an extreme and well documented absence (such as hospitalization) the final may be weighted to count for the missing exam. In the case of a missed exam, contact the instructor as soon as possible.
The course will be graded as follows:
The lowest homework score will be dropped in calculating the homework grade.
If you want to change sections, or add/drop the course, please do so at the CS Department Office.
Depending on various circumstances, the schedule shown bellow may experiment small modifications.
The "sections" listed on the 4th column are from Johnsonbaugh's book.
The "Suggested Exercises" column contains some exercises from the book that you may find useful to try. They are not homework nor need to be turned in.
The complete set of notes is here. However I do not recommend to download the whole set until the end of the quarter, since I may still make some changes to the notes.
Email: mlerma at math dot northwestern dot edu