Announcements | | Course information | | Assignments | | Labs | | Slides |
Instructors and lectures:
Textbook: Discrete Mathematics and Its Applications: Kenneth H. Rosen.
Reference book:
Discrete Mathematics With Applications: Susanna S. Epp
Marking scheme: Lab quizzes 24% total (lowest mark dropped), 5 assignments of 6% each, a midterm test 15% (Oct 16th) and a final exam 31%. Note that the last assignment may be due during the last week of the semester (to provide adequate preparation for the final exam).
Course description
Logic has been called the "calculus of computer science": just as sciences
such as physics that deal with continuous realm rely on calculus techniques,
we rely on logic. Indeed, so many areas of our field are based on logic: from
designing circuits to determining complexity of problems; from verifying
correctness of algorithms and devising database queries to automated
reasoning in artificial intelligence.
This course is intended to be an introduction to mathematical logic with emphasis on Computer Science applications and methodologies. We will cover propositional and predicate logic with applications, including the Resolution proof technique, which is the basis of most modern-day automated problem solvers. Then we will discuss basic proof techniques such as mathematical induction, again with computer science applications. We will also touch upon basic combinatorics, counting methods and probability, and theory of computation.
Labs start on Sep 19th (Section 2) and Sep 21st (Section 1). Every lab will end with a quiz, worth 3%; the lowest quiz mark will be dropped. You have to be in the lab to write the quizzes. Tentative lab dates are as follows:
Assignments will be due on Sep 25, Oct 6, Oct 23, Nov 6 and Nov 20. All assignments should be uploaded to D2L by 10pm on the due date.
Assignment 1. ( LaTeX source ) Due Sep 25, at 10pm. |
Please type up your assignment and upload it on D2L as a pdf file. If you know how to use LaTeX (or want to learn an easy way to typeset mathematics), this would be a perfect choice; otherwise, use whichever word processor you are comfortable with.
Policy on collaboration: The work you submit must be your own. You may discuss problems from assignments with each other; however, you should prepare written solutions alone. Plagiarism is a serious academic offense and will be dealt with accordingly.
I will be posting slides as we go; you are welcome to check the slides from the previous semester.