'Discrete mathematics cs 2610' presentation slideshows

Discrete Mathematics CS 2610

Discrete Mathematics CS 2610. August 21, 2008. Agenda. Nested quantifiers Rules of inference Proofs. Review. A predicate P , or propositional function, is a function that maps objects in the universe of discourse to propositions

464 views • 27 slides

Discrete Mathematics CS 2610

Discrete Mathematics CS 2610. August 24, 2006. Agenda. Last class Introduction to predicates and quantifiers This class Nested quantifiers Proofs. Overview of last class.

354 views • 22 slides

Discrete Mathematics CS 2610

Discrete Mathematics CS 2610. September 16, 2008. Monotonic Real Functions. Let f : A ? B such that A,B ? R f is strictly increasing iff for all x,y ? A, x > y ? f(x) > f(y) f is strictly decreasing iff for all x,y ? A, x > y ? f(x) < f(y) Example:

403 views • 19 slides

Discrete Mathematics CS 2610

321 views • 18 slides

Discrete Mathematics CS 2610

Discrete Mathematics CS 2610. February 24, 2009 -- part 3. Cardinality. Def.: The cardinality of a set is the number of elements in the set. Def.: Let A and B be two sets. A and B have the same cardinality iff there is a one-to-one correspondence (bijection) between A and B.

127 views • 10 slides

Discrete Mathematics CS 2610

Discrete Mathematics CS 2610. February 19, 2009. X. X+Y. Y. Logic Gates: the basic elements of circuits. Electronic circuits consist of so-called gates connected by wires. x. x. Inverter (NOT gate ). OR gate. x. xy. AND gate. y. Multiway Logical Gates.

191 views • 9 slides