1 / 16

Slides for a Course Based on the Text Discrete Mathematics & Its Applications (5 th Edition) by Kenneth H. Rosen

University of Florida Dept. of Computer & Information Science & Engineering COT 3100 Applications of Discrete Structures Dr. Michael P. Frank. Slides for a Course Based on the Text Discrete Mathematics & Its Applications (5 th Edition) by Kenneth H. Rosen.

rufina
Download Presentation

Slides for a Course Based on the Text Discrete Mathematics & Its Applications (5 th Edition) by Kenneth H. Rosen

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. University of FloridaDept. of Computer & Information Science & EngineeringCOT 3100Applications of Discrete StructuresDr. Michael P. Frank Slides for a Course Based on the TextDiscrete Mathematics & Its Applications (5th Edition)by Kenneth H. Rosen Slides are online at http://www.cise.ufl.edu/~mpf/cot3100lecs (c)2001-2004, Michael P. Frank

  2. Module #0:Course Overview A few general slides about the subject matter of this course. 14 slides, ½ lecture (c)2001-2004, Michael P. Frank

  3. What is Mathematics, really? • It’s not just about numbers! • Mathematics is much more than that: • But, these concepts can be about numbers, symbols, objects, images, sounds, anything! Mathematics is, most generally, the study of any and allabsolutely certain truths about any and allperfectly well-defined concepts. (c)2001-2004, Michael P. Frank

  4. Physics from Mathematics • Starting from simple structures of logic & set theory, • Mathematics builds up structures that include all the complexity of our physical universe… • Except for a few “loose ends.” • One theory of philosophy: • Perhaps our universe is nothing other than just a complex mathematical structure! • It’s just one that happens to include us! From Max Tegmark, ‘98 (c)2001-2004, Michael P. Frank

  5. So, what’s this class about? What are “discrete structures” anyway? • “Discrete” ( “discreet”!) - Composed of distinct, separable parts. (Opposite of continuous.)discrete:continuous :: digital:analog • “Structures” - Objects built up from simpler objects according to some definite pattern. • “Discrete Mathematics” - The study of discrete, mathematical objects and structures. (c)2001-2004, Michael P. Frank

  6. Propositions Predicates Proofs Sets Functions Orders of Growth Algorithms Integers Summations Sequences Strings Permutations Combinations Relations Graphs Trees Logic Circuits Automata Discrete Structures We’ll Study (c)2001-2004, Michael P. Frank

  7. Relationships Between Structures • “→” :≝ “Can be defined in terms of” Programs Proofs Groups Trees Operators Complex numbers Propositions Graphs Real numbers Strings Functions Integers Matrices Relations Naturalnumbers Sequences Infiniteordinals Bits n-tuples Vectors Sets Not all possibilitiesare shown here. (c)2001-2004, Michael P. Frank

  8. Some Notations We’ll Learn (c)2001-2004, Michael P. Frank

  9. Why Study Discrete Math? • The basis of all of digital information processing is: Discrete manipulations of discrete structures represented in memory. • It’s the basic language and conceptual foundation for all of computer science. • Discrete math concepts are also widely used throughout math, science, engineering, economics, biology, etc., … • A generally useful tool for rational thought! (c)2001-2004, Michael P. Frank

  10. Advanced algorithms & data structures Programming language compilers & interpreters. Computer networks Operating systems Computer architecture Database management systems Cryptography Error correction codes Graphics & animation algorithms, game engines, etc.… I.e., the whole field! Uses for Discrete Math in Computer Science (c)2001-2004, Michael P. Frank

  11. Logic (§1.1-4) Proof methods (§1.5) Set theory (§1.6-7) Functions (§1.8) Algorithms (§2.1) Orders of Growth (§2.2) Complexity (§2.3) Number theory (§2.4-5) Number theory apps. (§2.6) Matrices (§2.7) Proof strategy (§3.1) Sequences (§3.2) Summations (§3.2) Countability (§3.2) Inductive Proofs (§3.3) Recursion (§3.4-5) Program verification (§3.6) Combinatorics (ch. 4) Probability (ch. 5) Recurrences (§6.1-3) Relations (ch. 7) Graph Theory (chs. 8+9) Boolean Algebra (ch. 10) Computing Theory (ch.11) Instructors: customize topic content & order for your own course Course Outline (as per Rosen) (c)2001-2004, Michael P. Frank

  12. Topics Not Covered Other topics we might not get to this term: 21. Boolean circuits (ch. 10) - You could learn this in more depth in a digital logic course. 22. Models of computing (ch. 11) - Many of these are obsolete for engineering purposes now anyway • Linear algebra (not in Rosen, see Math dept.) - Advanced matrix algebra, general linear algebraic systems 24. Abstract algebra (not in Rosen, see Math dept.) - Groups, rings, fields, vector spaces, algebras, etc. (c)2001-2004, Michael P. Frank

  13. Course Objectives • Upon completion of this course, the student should be able to: • Check validity of simple logical arguments (proofs). • Check the correctness of simple algorithms. • Creatively construct simple instances of valid logical arguments and correct algorithms. • Describe the definitions and properties of a variety of specific types of discrete structures. • Correctly read, represent and analyze various types of discrete structures using standard notations. Think! (c)2001-2004, Michael P. Frank

  14. A Proof Example • Theorem:(Pythagorean Theorem of Euclidean geometry)For anyreal numbers a, b, and c, if a and b are the base-length and height of a right triangle, and c is the length of its hypo-tenuse, then a2 + b2 = c2. • Proof: See next slide. Pythagoras of Samos(ca. 569-475 B.C.) b a (c)2001-2004, Michael P. Frank

  15. Proof of Pythagorean Theorem • Proof. Consider the below diagram: • Exterior square area = c2, the sum of the following regions: • The area of the 4 triangles = 4(½ab) = 2ab • The area of the small interior square = (b−a)2 = b2−2ab+a2. • Thus, c2 = 2ab + (b2−2ab+a2) = a2 + b2. ■ Note: It is easy to show that the exterior and interior quadrilaterals in this construction are indeed squares, and that the side length of the internal square is indeed b−a (where b is defined as the length of the longer of the two perpendicular sides of the triangle). These steps would also need to be included in a more complete proof. c a ½ab c b b a ½ab (b−a)2 ½ab a b b c ½ab a c Areas in this diagram are in boldface; lengths are in a normal font weight. (c)2001-2004, Michael P. Frank

  16. Finally: Have Fun! (c)2001-2004, Michael P. Frank

More Related