good bye to discrete mathematics n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Good Bye to Discrete Mathematics!! PowerPoint Presentation
Download Presentation
Good Bye to Discrete Mathematics!!

Loading in 2 Seconds...

play fullscreen
1 / 25

Good Bye to Discrete Mathematics!! - PowerPoint PPT Presentation


  • 94 Views
  • Uploaded on

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:

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Good Bye to Discrete Mathematics!!' - ishi


Download Now 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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
good bye to discrete mathematics

Good Bye to Discrete Mathematics!!

CS340: Discrete Mathematics

slide2
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

,

mathematical logic
Mathematical Logic
  • Example:
    • Determine whether statement formula A logically implies statement formula B.
    • Let A: (~(p ∨q )) and B: (q ∧p )
    • Truth Table
permutation and combination
Permutation and Combination

Permutation

Combination

graph theory1
Graph Theory

Euler Circuit

Hamiltonian Cycle

Many Algorithms

trees and networks
Trees and Networks

Traversal: Inorder, Preorder, Postorder

trees and networks1
Trees and Networks

Network Flow

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