'Cs 220 discrete structures' presentation slideshows

CS 220: Discrete Structures and their Applications

622 views • 34 slides

CS 220: Discrete Structures and their Applications

CS 220: Discrete Structures and their Applications. Functions Chapter 5 in zybooks. Functions. A function maps elements from one set X to elements of another set Y. r ange : {A, B, D}. A. d omain X = {Brian, Drew, Alan, Ben}. target Y = {A,B,C,D,F}. B. Brian. C. Drew.

344 views • 34 slides

CS 220: Discrete Structures and their Applications

335 views • 33 slides

CS 220: Discrete Structures and their Applications

CS 220: Discrete Structures and their Applications. Propositional Logic Sections 1.1-1.2 in zybooks. Logic in computer science. Used in many areas of computer science: Booleans and Boolean expressions in programs

299 views • 29 slides

CS 220: Discrete Structures and their Applications

CS 220: Discrete Structures and their Applications. Counting: the bijection rule zybooks 7.3. http:// www.xkcd.com /936/. counting subsets. Show that the number of different subsets of a finite set X is 2 |X|. counting subsets.

108 views • 10 slides

CS 220: Discrete Structures and their Applications

CS 220: Discrete Structures and their Applications. Recursive algorithms and induction 6.8 in zybooks. Induction and Recursion. Several of the inductive proofs we looked at lead to recursive algorithms: The triomino tiling problem Making postage using 3 and 5 cent stamps

85 views • 8 slides