1 / 25

Good Bye to Discrete Mathematics!!

Good Bye to Discrete Mathematics!!. CS340: Discrete Mathematics. Sets. Venn Diagrams Abstract visualization of a Universal set, U as a rectangle, with all subsets of U shown as circles. Shaded portion represents the corresponding set. , . Sets. Mathematical Logic. Example:

ishi
Download Presentation

Good Bye to Discrete Mathematics!!

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. Good Bye to Discrete Mathematics!! CS340: Discrete Mathematics

  2. Sets • Venn Diagrams • Abstract visualization of a Universal set, U as a rectangle, with all subsets of U shown as circles. • Shaded portion represents the corresponding set ,

  3. Sets

  4. Mathematical Logic • Example: • Determine whether statement formula A logically implies statement formula B. • Let A: (~(p ∨q )) and B: (q ∧p ) • Truth Table

  5. Relations

  6. Relations

  7. Matrices

  8. Calculate AB and BA

  9. Functions

  10. Basic Counting Principles

  11. Basic Counting Principles

  12. Permutation and Combination Permutation Combination

  13. Discrete Probability

  14. Algorithms and Time Complexity

  15. Algorithms and Time Complexity

  16. Graph Theory

  17. Graph Theory Euler Circuit Hamiltonian Cycle Many Algorithms

  18. Trees and Networks Traversal: Inorder, Preorder, Postorder

  19. Trees and Networks Network Flow

  20. Boolean Algebra

  21. Boolean Algebra

  22. Combinatorial Circuits • Many Basic Gates: • And Gate • Or Gate • Not Gate • NAnd Gate • NOr Gate • Some Circuits: • Half Adder • Full Adder

  23. Combinatorial Circuits

  24. Finite Automata and Languages

  25. Finite Automata and Languages

More Related