{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CS280-Midterm-Review

CS280-Midterm-Review - Countability Functions Basic notions...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 280 Midterm Review
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Announcements Midterm Postponed to Monday, 11/12 Covers up to and including HW #5 (number theory) Homework #5
Background image of page 2
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
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Proof Techniques Proof by contradiction Proof by contraposition Existence proof Uniqueness proof Counterexamples Induction Weak, strong, structural Structuring your proof
Background image of page 4
Sets Know the notation and terminology Union, intersection, Cartesian product etc. Proving theorems in set theory
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 8
Background image of page 9
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Countability Functions Basic notions One-to-one Onto Inverse Composition Know the basic properties of the common functions Floor, ceiling, exponential, logarithm etc. Growth Rates Big-O notation Big-Ω notation Big-Θ notation Sequences/Summations Know the basics Arithmetic progressions Geometric progressions Number Theory Modular arithmetic and congruences Basic properties Finding the GCD, LCM Basic properties Euclid’s algorithm Linear congruences Chinese Remainder Theorem Fermat’s Little Theorem...
View Full Document

{[ snackBarMessage ]}