4-1 LOGIC OPERATIONS In Chapter 3 we discussed the fact that data inside a computer is stored as patterns of bits. Logic operations refer to those operations.

Slides:



Advertisements
Similar presentations
INTRODUCTION LOGICAL OPERATIONS TRUTH TABLE AND RULES.
Advertisements

PHYS707: Special Topics C++ Lectures Lecture 2. Summary of Today’s lecture: 1.More data types 2.Flow control (if-else, while, do-while, for) 3.Brief introduction.
Cosc 2150: Computer Organization Chapter 3: Boolean Algebra and Digital Logic.
Data Storage – Part 1 CS 1 Introduction to Computers and Computer Technology Rick Graziani Fall 2013.
Section 4.2: Functions that Test Conditions (continued)
Boolean Algebra Discussion D6.1 Sections 13-3 – 13-6.
CSCI 3 Chapter 1 Data Storage. Bits  Today’s computer information is encoded as patterns of 0s and 1s.  These digits are called “bits” (binary digits)
Boolean Algebra Discussion D6.1 Appendix G. Boolean Algebra and Logic Equations George Boole Boolean Algebra Theorems Venn Diagrams.
Circuit Simplification: Boolean Algebra
Operations on data CHAPTER 4.
4 Operations On Data Foundations of Computer Science ã Cengage Learning.
GK-12 Student designed project (AP physics) Digital logic and Boolean algebra exercise. IC logic gates brought from Stevens were used in making simple.
Computer Science 101 Boolean Algebra. What’s next? A new type of algebra – Helps us A new type of algebra – Helps us With logical reasoningWith logical.
22C:19 Discrete Math Boolean Algebra & Digital Logic Fall 2010 Sukumar Ghosh.
1 CSC103: Introduction to Computer and Programming Lecture No 2.
Binary Codes Computers and other digital systems "work" with binary numbers. I/P & O/P is usually done using decimal numbers, alphabetics, special symbols.
OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Chapter 2: Binary Logic.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one.
1 Boolean Algebra & Logic Gates. 2 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple.
An Introduction to Programming Using Alice Boolean Logic.
Computer Science 210 Computer Organization Introduction to Boolean Algebra.
Valeria Urquijo Boolean Operators March 4, 2010
Boolean Algebra & Logic Prepared by Dr P Marais (Modified by D Burford)
Islamic University Of Gaza, Nael Aburas Data Storage Introduction to computer, 2nd semester, 2010/2011 Mr.Nael Aburas
Logic (continuation) Boolean Logic and Bit Operations.
BASIC LOGIC GATES. In studying digital in integrated circuits, one must start with the simples group of circuits, the SSIs or Small Scale Integrated Circuits.
Digital Logic. 2 Abstractions in CS (gates) Basic Gate: Inverter IO IO GNDI O Vcc Resister (limits conductivity) Truth Table.
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.
1 © 2002 John Urrutia. All rights reserved. Qbasic Chapter 4 IF Statements and READ & DATA.
Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer.
Appendix B: Digital Logic
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
Boolean Algebra Boolean algebra was introduced by George Boole in his first book The Mathematical Analysis of Logic (1847), perfected in the late 19th.
Logic Simplification-Using Boolean Laws Logic Design Laboratory EE 2121 Lectures By Manesh T EE2121-In Charge
CISSP Common Body of Knowledge Review by Alfred Ouyang is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License.
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.
Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.
Boolean Algebra. LO:  Understand why Boolean algebra is used  Understand basic Boolean algebra notation  Understand why Boolean algebra is used  Understand.
CS 111 – Aug. 27 Section 1.1 –Binary data and operations –Logic gates –Flip-flop –A binary shorthand: hexadecimal Commitment for next day: –Please read.
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.
Boolean Algebra & Logic Gates
CPS120 Introduction to Computer Science
Morgan Kaufmann Publishers
Computer Science 210 Computer Organization
CS Chapter 3 (3A and ) Part 1 of 8
Overview Register Transfer Language Register Transfer
CS Chapter 3 (3A and ) Part 1 of 8
Basic Logical Operations (Fascinating)
JavaScript conditional
Week 7: Gates and Circuits: PART II
Computer Science 210 Computer Organization
Dr. Clincy Professor of CS
CS Chapter 3 (3A and ) Part 3 of 8
Digital Logic.
CS Chapter 3 (3A and ) – Part 2 of 5
GCSE Computer Science – Logic Gates & Boolean Expressions
Introduction To Robot Decision Making
Digital Logic.
ECB2212-Digital Electronics Boolean algebra
Lab Instructors will overview the MSP430
Some basic electronics and truth tables
ECS15 boolean.
George Boole English Mathematician
XOR Function Logic Symbol  Description  Truth Table 
Truth tables Mrs. Palmer.
Millennium High School Agenda Calendar
Conditionals.
Presentation transcript:

4-1 LOGIC OPERATIONS In Chapter 3 we discussed the fact that data inside a computer is stored as patterns of bits. Logic operations refer to those operations that apply the same basic operation on individual bits of a pattern, or on two corresponding bits in two patterns. This means that we can define logic operations at the bit level and at the pattern level. A logic operation at the pattern level is n logic operations, of the same type, at the bit level where n is the number of bits in the pattern. 4.1 1

Boolean algebra and logic circuits are discussed in Appendix E. Logic operations at bit level A bit can take one of the two values: 0 or 1. If we interpret 0 as the value false and 1 as the value true, we can apply the operations defined in Boolean algebra to manipulate bits. Boolean algebra, named in honor of George Boole, belongs to a special field of mathematics called logic. Boolean algebra and its application to building logic circuits in computers are briefly discussed in Appendix E. In this section, we show briefly four bit-level operations that are used to manipulate bits: NOT, AND, OR, and XOR. i Boolean algebra and logic circuits are discussed in Appendix E. 4.2 2