MATH 240: Discrete Structures
Discrete mathematics tailored for computer science and mathematics students. Topics include propositional and predicate logic, proof techniques, mathematical induction, set theory, relations and functions, combinatorics, graph theory basics, and recurrence…
Independent study archive Learn more
Materials are uploaded by users for self-study purposes. PwnHero is an independent platform, not affiliated with, sponsored by, or endorsed by any university or institution.
Common aliases: MATH 240
Study Resources for Discrete Structures
Midterm (Exam 1) 2017
Midterm (Exam 2) 2017
Final Exam 2020
Midterm (Exam 1) 2018
Midterm (Exam 2) 2018
Midterm (Exam 1) 2019
Midterm (Exam 2) 2019
Midterm (Exam 1) 2020
Midterm (Exam 2) 2020
Study Guide 2
Quiz 6
Assessment Inventory for MATH 240 (11 Documents)
| Document | Format | Year | Access |
|---|---|---|---|
| Final Exam 2020 | Final | 2020 | Illustrative Archive |
| Midterm (Exam 1) 2020 | Midterm | 2020 | Illustrative Archive |
| Midterm (Exam 2) 2020 | Midterm | 2020 | Illustrative Archive |
| Midterm (Exam 1) 2019 | Midterm | 2019 | Illustrative Archive |
| Midterm (Exam 2) 2019 | Midterm | 2019 | Illustrative Archive |
| Midterm (Exam 1) 2018 | Midterm | 2018 | Illustrative Archive |
| Midterm (Exam 2) 2018 | Midterm | 2018 | Illustrative Archive |
| Midterm (Exam 1) 2017 | Midterm | 2017 | Illustrative Archive |
| Midterm (Exam 2) 2017 | Midterm | 2017 | Illustrative Archive |
| Study Guide 2 | Study Guide | — | Illustrative Archive |
| Quiz 6 | Quiz | — | Illustrative Archive |
Complete inventory of all 11 assessments (sorted by most recent). Select any document to inspect or use the search bar above to filter.
Course Overview & Exam Syllabus
Course Description
Discrete mathematics tailored for computer science and mathematics students. Topics include propositional and predicate logic, proof techniques, mathematical induction, set theory, relations and functions, combinatorics, graph theory basics, and recurrence relations.
This archive catalogs 11 free educational resources and past exams for MATH 240 (Discrete Structures) at McGill University, containing 8 midterm papers, 1 final examination, 1 quiz, and 1 study guide. Dated documents represent 4 distinct academic years between 2017 and 2020.
Core Exam Topics & Learning Objectives
- Mathematical logic and proof techniques: propositional/predicate logic, direct proofs, contraposition, and induction in MATH 240
- Set theory and combinatorics: permutations, combinations, pigeonhole principle, binomial theorem, and inclusion-exclusion
- Relations and discrete structures: equivalence relations, partial orders, recurrence relations, and generating functions
- Graph theory foundations: Eulerian and Hamiltonian circuits, graph coloring, trees, and planar graph models in Discrete Structures
Frequently Asked Questions
Which assessment formats are cataloged in this MATH 240 archive?
This collection for MATH 240 at McGill University catalogs 11 total resources across the following formats: Midterms, Finals, Quizzes, Study Guides. Each document is listed in the assessment inventory table with its individual format tag and academic year where recorded.
What academic years are covered in this MATH 240 collection?
Dated materials in this archive span from 2017 to 2020, representing 4 distinct academic years. Coverage varies by the records currently cataloged for this course.
How can students access these free MATH 240 past exams?
All cataloged MATH 240 past exams and study materials are free to request. The catalog, metadata, assessment inventory, and illustrative thumbnails are public; source documents are not shown on this page. Use the connect options to request a study resource, and confirm current course topics and grading policies with the McGill University course syllabus.