Course Outline
Discrete Mathematics for Computer Science
COMPSCI 1DM3
|
Instructor: Mahdee Jodayree jodayrem@mcmaster.ca |
|
|
Course Website |
|
|
Prerequisites |
MATH 1B03 or
1ZC3 with a result of at least B |
|
1st TA (Tutorials) |
Sparsh Poddar
poddas2@mcmaster.ca |
|
2nd TA (Tutorials) |
Laeek Ahmed shaikl3@mcmaster.ca |
|
Office Location |
ITB 208 |
|
Office Hours |
By appointment |
|
Course Material |
All course
material for this class will be posted in Microsoft Teams under the Files Tab. To ensure
access to the most recent course materials, installing Microsoft OneDrive and
syncing the Teams channel with your local disk is recommended. This will
enable automatic updates and file retrieval. |
|
Lectures June 20-Aug 3rd |
Attendance of
lectures is not mandatory. A video copy
of each lecture will be available in Microsoft Teams. |
|
Tutorials June 20-Aug 3rd |
Attendance of
tutorials is not mandatory but highly recommended. During the
tutorials, you will be solving exercises to
understand the lecture slides, and you can ask your questions. Tutorials
will help you to finish your assignment. A video copy
of each tutorial will be available in Microsoft Teams. |
|
Textbook |
Discrete
Mathematics and Its Applications Eighth Edition ISBN
9781259676512 Kenneth
H. Rosen |
|
Assignments 30% Assignment 1 Due Date July 7th Assignment 2 Due Date July 21st Assignment 3 Due Date August 5th |
There will be
three assignments, each 10% of your overall mark. You can scan
your handwritten notes, type your solution, or you can use a tablet to write
your solutions and submit them to Avenue to Learn in PDF format. I will post
the solutions to assignments in Microsoft Teams under the Files Tab. I suggest
utilizing the Microsoft Lenz PDF Scanner App, which is available for free, to scan
your assignments and convert them into PDF format. |
|
Midterm 20% July 25th |
The midterm
will be in person. One
double-sided cheat sheet will be allowed. You are
allowed to type and print your cheat sheet, or you can create a handwritten
one. |
|
Final Exam 50% |
The final
exam will be in person. One
double-sided cheat sheet will be allowed. You are
allowed to type and print your cheat sheet, or you can create a handwritten
one. |
|
Course Information |
1.
The Foundations Logic and Proofs (Ch. 1) 2.
Sets and functions (Ch. 2) 3.
Algorithms (Ch. 3) 4.
Modular Arithmetic and Number Theory (Ch. 4) 5.
Induction and recursion (Ch. 5) 6.
Counting principles (Ch. 6) 7.
Discrete probabilities (Ch. 7) 8.
Recurrence relations (Ch. 8) 9.
Relations (Ch. 9) 10.
Graphs (Ch. 10) 11.
Trees (Ch. 11) |
|
Conflicting Holidays |
|
|
Academic Dishonesty |
|
|
MSAF Policy |
For each MSAF,
the weight will be moved to the final exam. More information on the MSAF
procedure can be found at this link. |
|
SAS Policy |
The policies
and procedures of Student Accessibility Services (SAS) can be accessed
through the provided link. |