Your SlideShare is downloading. ×
  • Like
Ch 4 structure of algorithms
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×

Now you can save presentations on your phone or tablet

Available for both IPhone and Android

Text the download link to your phone

Standard text messaging rates apply

Ch 4 structure of algorithms

  • 246 views
Published

 

  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Be the first to comment
    Be the first to like this
No Downloads

Views

Total Views
246
On SlideShare
0
From Embeds
0
Number of Embeds
0

Actions

Shares
Downloads
4
Comments
0
Likes
0

Embeds 0

No embeds

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
    No notes for slide

Transcript

  • 1. Boolean Logic
  • 2. George Boole
    • In1854, George Boole published “ An investigation into the Laws of Thought, on which are founded the Mathematical Theories of Logic and Probabilities.”
    • Boole outlined a system of logic and a corresponding algebraic language dealing with true and false values.
    100 th Anniverary Edition
  • 3. Boolean Logic
    • Boolean logic is a form of mathematics in which the only values used are true and false.
    • Boolean logic is the basis of all modern computing.
    • There are three basic operations in Boolean logic – AND, OR, and NOT.
    100 th Anniverary Edition
  • 4. The AND Operation
    • The AND operation is a binary operation, meaning that it needs two operands.
    • c = a AND b
    • Both a and b must be true for the result to be true.
    100 th Anniverary Edition F F F F T T b F T a AND
  • 5. The OR Operation
    • The OR operation is also a binary operation with two operands.
    • c = a OR b
    • If either a OR b is true, then the result is true.
    100 th Anniverary Edition F T F T T T B F T a OR
  • 6. The NOT Operation
    • The NOT operation is a unary operation with only one operand.
    • c = NOT (a)
    • It simply reverses the true or false value of the operand.
    100 th Anniverary Edition T F F T a NOT