1 / 8

CS 2800 Midterm Review Guide: Key Topics and Resources

Prepare for the CS 2800 Midterm on Tuesday, 11/3 at 7:30 PM in UP B17. This review covers materials up to HW #4, focusing on induction, logic (propositional and predicate), proof techniques (contradiction, contraposition, existence, uniqueness), set theory (notation, union, intersection, Cartesian product), functions (one-to-one, onto, composition), and growth rates (Big-O, Big-Ω, Big-Θ). Practice problems, graded homeworks, and a cheat sheet are available to aid your study. Don't miss Craig Mundie’s talk in Philips 101 at 4 PM.

cosette
Télécharger la présentation

CS 2800 Midterm Review Guide: Key Topics and Resources

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS 2800 Midterm Review

  2. Announcements • Midterm • Tuesday, 11/3, 7:30PM, UP B17 • Covers up to and including HW #4 (induction) • Practice Prelim / Homework Solutions • Graded homeworks • Cheat sheet • Craig Mundie’s talk • Philips 101, 4PM

  3. Logic • Propositional Logic / Predicate Logic • Know the notation/terminology • Meanings of operators • Translating to and from English • Know how to write a proof • Presentation • Equivalences, inference rules

  4. Proof Techniques • Proof by contradiction • Proof by contraposition • Existence proof • Uniqueness proof • Counterexamples • Induction • Weak, strong, structural • Structuring your proof

  5. Sets • Know the notation and terminology • Union, intersection, Cartesian product etc. • Proving theorems in set theory • Countability

  6. Functions • Basic notions • One-to-one • Onto • Inverse • Composition • Know the basic properties of the common functions • Floor, ceiling, exponential, logarithm etc.

  7. Growth Rates • Big-O notation • Big-Ω notation • Big-Θ notation

  8. Sequences/Summations • Know the basics • Arithmetic progressions • Geometric progressions

More Related