CS 2800: Mathematical Foundations of Computing
CS 2800 builds the mathematical toolkit you'll use throughout the CS major at Cornell. Topics include propositional and predicate logic, formal proof techniques (direct proof, contradiction, induction), basic set theory, combinatorics, discrete probability,…
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: CS 2800
Study Resources for Mathematical Foundations of Computing
Midterm (Exam 1) 2017
Midterm (Exam 2) 2017
Final Exam 2016
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 9
Assessment Inventory for CS 2800 (11 Documents)
| Document | Format | Year | Access |
|---|---|---|---|
| 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 |
| Final Exam 2016 | Final | 2016 | Illustrative Archive |
| Study Guide 2 | Study Guide | — | Illustrative Archive |
| Quiz 9 | 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
CS 2800 builds the mathematical toolkit you'll use throughout the CS major at Cornell. Topics include propositional and predicate logic, formal proof techniques (direct proof, contradiction, induction), basic set theory, combinatorics, discrete probability, modular arithmetic, and an introduction to graph theory.
This archive catalogs 11 free educational resources and past exams for CS 2800 (Mathematical Foundations of Computing) at Cornell University, containing 8 midterm papers, 1 final examination, 1 quiz, and 1 study guide. Dated documents represent 5 distinct academic years between 2016 and 2020.
Core Exam Topics & Learning Objectives
- Propositional logic, truth tables, logical equivalences, and predicate quantifiers
- Proof techniques: direct proof, proof by contradiction, and mathematical induction
- Set theory, relations, equivalence relations, and partial orders
- Counting principles: permutations, combinations, the Pigeonhole Principle, and inclusion-exclusion
- Discrete probability: sample spaces, conditional probability, Bayes' Theorem, and random variables
- Modular arithmetic, GCD algorithms, and introductory graph theory (trees, connectivity, Euler paths)
Frequently Asked Questions
Which assessment formats are cataloged in this CS 2800 archive?
This collection for CS 2800 at Cornell 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 CS 2800 collection?
Dated materials in this archive span from 2016 to 2020, representing 5 distinct academic years. Coverage varies by the records currently cataloged for this course.
How can students access these free CS 2800 past exams?
All cataloged CS 2800 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 Cornell University course syllabus.