CSC 107 – Programming For Science. George Boole  Mathematician from English middle-class  Lived from 1815 – 1864  Started work at age 16 as a teaching.

Slides:



Advertisements
Similar presentations
DAT2343 Basic Logic Gates © Alan T. Pinck / Algonquin College; 2003.
Advertisements

INTRODUCTION LOGICAL OPERATIONS TRUTH TABLE AND RULES.
Sahar Mosleh PageCalifornia State University San Marcos 1 Introductory Concepts This section of the course introduces the concept of digital circuits and.
Data Storage – Part 1 CS 1 Introduction to Computers and Computer Technology Rick Graziani Fall 2013.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 3 Dr. Shi Dept. of Electrical and Computer Engineering.
Section 10.3 Logic Gates.
Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.
Boolean Algebra and Truth Table The mathematics associated with binary number system (or logic) is call Boolean: –“0” and “1”, or “False” and “True” –Calculation.
Programming for GCSE Topic 3.3: Boolean Logic and Truth Tables
Logic Gate A logic gate is an electronic circuit which makes logic decisions. It has one output and one or more inputs. The output signal appears only.
3. DIGITAL ELECTRONICS..
Boolean Logic By: Arthur Brooks February 25, 2003 Think, Speak, and Write Computer Science.
Computer Science 101 The Boolean System. George Boole British mathematician ( ) Boolean algebra –Logic –Set theory –Circuits –Conditions in if.
OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Chapter 2: Binary Logic.
Lecture 7 How computers process data (Number Systems) PRESENTED BY MD. MAHBUBUL ALAM, PHD 1.
CSC 107 – Programming For Science. Follow-Up From Last Lecture.
CSC Intro. to Computing Lecture 5: Boolean Logic, Gates, & Circuits.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
Computer Science 210 Computer Organization Introduction to Boolean Algebra.
CSC Intro. to Computing Lecture 5: Boolean Logic, Gates, & Circuits.
Discrete Mathematics and Its Applications.  The English mathematician George Boole ( ) sought to give symbolic form to Aristotle's system of.
Homework - Write Truth Tables for toy car. You will design a simple digital circuit to make a toy car follow a flashlight. The car has three light sensors.
CSC 107 – Programming For Science. Announcements.
Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
D75P 34R - HNC Computer Architecture Week 6 Boolean Logic © C Nyssen/Aberdeen College 2004 All images © C Nyssen /Aberdeen College unless otherwise stated.
CSC 107 – Programming For Science. Announcements  Memorization is not important, but…  … you will all still be responsible for information  Instead.
A-Level Computing#BristolMet Session Objectives#6 MUST understand and produce simple logic diagrams using the operations NOT, AND and OR SHOULD explain.
CSC 107 – Programming For Science. The Week’s Goal.
Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.
Some basic electronics and truth tables Some material on truth tables can be found in Chapter 3 of Digital Principles (Tokheim)
June 10, 2002© Howard Huang1 Number systems To get started, we’ll discuss one of the fundamental concepts underlying digital computer design:
Lecture 4 Boolean Algebra. Logical Statements °A proposition that may or may not be true: Today is Monday Today is Sunday It is raining °Compound Statements.
Chapter 4 Fundamentals of Computer Logic 1 Chapter 4: Fundamental of Computer Logic - IE337.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
DIGITAL ELECTRONICS. Everything in digital world is based on binary system. Numerically it involves only two symbols 0 or 1. –0 = False = No –1 = True.
CSC 107 – Programming For Science. Announcements  Lectures may not cover all material from book  Material that is most difficult or challenging is focus.
Minute Paper 4/4/04 Z=50+j86.7=100
BOOLEAN ALGEBRA BIRLA VISHVAKARMA MAHAVDYALAYA V. V. NAGAR Guided By: Prof. P. B. Swadas Prepared By:
Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
Dr. ClincyLecture Slide 1 CS6020- Chapter 3 (3A and ) Dr. Clincy Professor of CS First Exam - Tuesday, September 6th Coverage: All subjects up to.
Logic Gates Unit 16.
Computer Programming Boolean Logic.
Logic gates.
3 – Boolean Logic and Logic Gates 4 – Binary Numbers
Morgan Kaufmann Publishers
Logic Gates.
Computer Science 210 Computer Organization
A mechanism for deciding whether an action should be taken
COMPUTING FUNDAMENTALS
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
3.4 Computer systems Boolean logic Lesson 2.
Computer Science 210 Computer Organization
Lecture 20: Combinatorial Circuits I
Boolean Logic Boolean Logic is considered to be the basic of digital electronics. We know that a computer’s most basic operation is based on digital electronics.
KS4 Electricity – Electronic systems
CS Chapter 3 (3A and ) – Part 2 of 5
GCSE Computer Science – Logic Gates & Boolean Expressions
ECB2212-Digital Electronics Boolean algebra
Binary Logic.
Lecture 5 Binary Operation Boolean Logic. Binary Operations Addition Subtraction Multiplication Division.
Some basic electronics and truth tables
Truth tables Mrs. Palmer.
Introductory Concepts
Copyright © Cengage Learning. All rights reserved.
Computer Programming Boolean Logic Trade & Industrial Education
Boolean Algebra and Gate Networks
Conditionals.
Presentation transcript:

CSC 107 – Programming For Science

George Boole  Mathematician from English middle-class  Lived from 1815 – 1864  Started work at age 16 as a teaching assistant  Held two assistantships to support family  Opened own school after many years of work  Reached pinnacle of any job -- named a Professor  Wrote Mathematical Analysis of Logic in 1847

Mathematical Analysis of Logic  Boole’s book proposed new logical system  World began with 2 values– though more created  Devised rules to add, subtract, & multiply  Work ignored during Boole’s lifetime  System only had 2 values, so what was the point?  Basis for most technology in the modern age  All it took was a simple little discovery…

Gate  Combines input(s) to generate output signal  Like most electronics, uses “on-off” state  Input is "off", if line drops below 2 volts  From volts, an input is considered on  Gate is deep fried silicon if line goes above 5 volts,  Like Boole’s logic, electronics have 2 values  Simple gates combine to make modern circuitry  All initially part of Boolean algebra  Basis of programming at the lowest, rawest level

Truth Table  Normal way that Boolean functions presented  All combinations of inputs shown in this table  This is really easy, inputs must be true or false  Output shown for each of the possible inputs  Given how it sounds, not at all complicated  Very simple rules to follow to construct  Does requires you count up to 2

NOT Gate  Simplest gate: computes opposite of input  Output false when input true;  Output true when input false;  Written in C++ as !a  a is gate’s input  x is gate’s output ax!a!a true false a x

OR Gate  Equivalent to addition in Boolean algebra  If either input is true is going to be checked  True when either a OR b are true; false otherwise  Written in C++ as a || b  a & b are inputs; x is output abx a || b false true false true a b x

AND Gate  Equivalent to multiplication in Boolean algebra  If both inputs are true is going to be checked  True when a AND b are true; false otherwise  Written in C++ as a && b  a & b are inputs; x is output abxa && b false true false true a b x

Gates in Computers  Computers more comfortable using numbers  Plus, far less to write down in truth tables  Use 0 to stand for false; Use 1 rather than true  For example of this, consider power symbol  Just a combination of 0 & 1  Ultimately, gate’s meaning does not change  Use what is easier: C++ switches back and forth

Your Turn  Get in groups of 3 & work on following activity

For Next Lecture  Read sections 7.2 – for Monday  How can we differ what our program does?  How are bool variables and operations used?  Why are if - else statements so important  Week #3 weekly assignment due Tuesday  Problems available on Angel  If problem takes more than 10 minutes, TALK TO ME!