MATH 2113
Discrete Structures
Lec 01 selected
This course continues CSCI 2112.03/MATH 2112.03. This course covers some basic concepts in discrete mathematics which are of particular relevance to students of computer science, engineering, and mathematics. The topics to be covered will include solution of recurrence relations, generating functions, number theory, Chinese remainder theorem, trees and graphs, finite state machines, abstract algorithms, Boolean algebra.
Sections
Lecture
Lec 01
Mon, Wed, Fri 9:35-10:25
From the syllabus
From the Winter 2025 syllabus by Hasan Mahmood. Winter 2027 is taught by Brown J., so details may differ. Open the PDF
Grading
10%ParticipationClass participation
20%HomeworkLowest score dropped
20%Midterms (2)10% each
40%Final examIn person, in April
Textbook
- Discrete and Combinatorial Mathematics: An Applied Introduction, Ralph P. Grimaldi
Course rules
- Late homework
- The lowest homework score is dropped; no extensions or makeups are granted without proper documentation.
- Missed midterm
- There are no makeup midterms; with proper documentation, the missed midterm's weight transfers to the final exam.
- Homework format
- Submit one PDF on Brightspace, with each question starting on a new page and in the correct order.
- Independent work
- Students may collaborate while studying but must complete and submit assessments independently.
- Attendance
- Students are advised and encouraged to attend all classes.
Have a more recent syllabus for MATH 2113? Sign in to share it