New Students Day Activity
|
|
- Delphia Burns
- 5 years ago
- Views:
Transcription
1 Course: S ELECTRONICS New Students Day ctivity Introduction: In S Level Electronics you need to gain an understanding of the electronic circuits so that you can then start to design your own circuits like the one shown below. You will set up and test circuits in the electronics laboratory using electronics kits as well as computer software programs. t the beginning of the level course we will be concentrating on the fundamentals of digital and analogue circuits. We should start by ensuring that you understand the difference between a digital signal and an analogue signal. 1
2 n analogue signal. This is a signal that can have any value between the minimum and maximum of the power supply. Voltage (V) Max signal. Min time (s) digital This is a signal that can only have two finite values, usually at the minimum and maximum of the power supply. Voltage (V) Max For Min time being we will concentrate on digital systems. time (s) the When an input or output signal is at the minimum power supply voltage (usually 0V) this is referred to as a LOW signal or LOGIC 0 signal. When an input or output signal is at the maximum power supply voltage this is referred to as a HIGH signal or LOGIC 1 signal. Logic Gates The term logic gate actually gives a clue as to the function of these devices in an electronic circuit. Logic implies some sort of rational thought process taking place and a gate in everyday language allows something through when it is opened. 2
3 logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs and one output. They are the decision making units in electronic systems and there are many different types for different applications. 1.The NOT gate (or inverter) This is the simplest form of logic gate and has only 1 input and 1 output. So how can it make a decision if it only has 1 input? Simply the purpose of this gate is to invert the input signal so if a Logic 0 is at the input, the output will be at Logic 1 and vice versa. The symbol for a NOT gate is as follows. You will notice that the input has been given the letter and the output the letter. Traditionally inputs are given letters from the start of the alphabet,, C etc. but this is more a rule of thumb and is not written in stone. The output of a logic gate can also be summarised in the form of a table, called a Truth Table. The truth table for a NOT gate is the simplest of all Truth Tables and is shown below. Input Output There is also a shorthand way of writing down the function of this logic gate, using a special type of algebra called oolean lgebra. The oolean expression for a NOT gate is The bar over the indicates that the output is the opposite of. We will now consider four of the most common logic gates in use in electronic circuits. These are the : ND gate OR gate NND gate NOR gate EXOR gate 2. The ND gate. 3
4 We will start with a 2 input ND gate. The symbol for a 2 input ND gate is as follows. The truth table for the 2 input ND gate is shown below We can see that the output is only at a Logic 1 when Input ND Input are at a Logic 1. The oolean expression for a 2 input ND gate is. The. between the and means ND in oolean lgebra. Real World Example: The ND function can be demonstrated by thinking about a door with two locks. The only way to get through this door is to unlock lock 1 ND to unlock lock 2. Otherwise you will be stuck outside. 3.The OR gate. We will start with a 2 input OR gate. The symbol for a 2 input OR gate is as follows. The truth table for the 2 input OR gate is shown below
5 1 1 1 We can see that the output is at a Logic 1 when Input OR Input OR both are at a Logic 1. The oolean expression for a 2 input OR gate is The + between the and means OR in oolean lgebra. Real World Example: Picture a house that has a doorbell at the front door and a doorbell at the back door. oth doorbells are connected to the same buzzer inside the house. This buzzer will ring when EITHER OR OTH of the doorbells are pressed. 5
6 4.The NND gate. We will start with a 2 input NND gate. The symbol for a 2 input NND gate is as follows. The truth table for the 2 input NND gate is shown below If you compare this truth table with that for the ND gate, you will find that the output is the exact opposite to the ND. The oolean expression for a 2 input NND gate is s before the. between the and invert the output in oolean lgebra.. means ND, and the bar means 6
7 5.The NOR gate. We will start with a 2 input NOR gate. The symbol for a 2 input NOR gate is as follows. The truth table for the 2 input NOR gate is shown below If you compare this truth table with that for the OR gate, you will find that the output is the exact opposite of the OR. The oolean expression for a 2 input NOR gate is s before the + between the and invert the result in oolean lgebra. means OR and the bar means Now we will consider a 3 input NOR gate. 7
8 6.The EXOR gate. The EXOR gate has 2 inputs and is a specialised version of the OR gate. The symbol for a 2 input EXOR gate is as follows. The truth table for the 2 input EXOR gate is shown below Comparison with the 2 input OR gate will reveal that is a Logic 1 when either or is a Logic 1, but not when and are Logic 1. The oolean expression for a 2 input EXOR gate is alternatively The between the and means Exclusive OR, however the alternative form will prove to be more useful later on in the course when simplifying oolean expressions... Real World Example: n example of an XOR gate would be a game show buzzer. If two contestants buzz in, only one of them, the first to buzz, will activate the circuit. The other contestant will be locked out from buzzing. Now try this: 1. Look at the following logic symbols labelled G. 8
9 i. Which is the correct symbol for an ND gate. ii. Which is the correct symbol for a NOT gate. iii. Which is the correct symbol for a NOR gate. iv. Which is the correct symbol for an EXOR gate. v. Which is the correct symbol for a NND gate. vi. Which is the correct symbol for an OR gate. 1. Complete the following truth tables. i. ND gate
10 ii. NOR gate iii. NND gate iv. OR gate The oolean equations labelled I, below are to be used to answer the following questions. 10 ). ) C) D).. E) F).. G)
11 H). i. Which expression is correct for an ND gate. ii. Which expression is correct for a NOT gate. iii. Which expression is correct for a NOR gate. iv. Which two expressions are correct for an EXOR gate. & v. Which expression is correct for a NND gate. vi. Which expression is correct for an OR gate. 11
Having read this workbook you should be able to: design a logic circuit from its Boolean equation or truth table.
Objectives Having read this workbook you should be able to: analyse a given logic circuit by deriving its oolean equation and completing its truth table. design a logic circuit from its oolean equation
More informationLecture 10: 09//25/03 A.R. Neureuther Version Date 09/14/03 EECS 42 Introduction to Digital Electronics Andrew R. Neureuther
EECS 42 Intro. Digital Electronics Fall 23 Lecture : 9//25/3.R. Neureuther Version Date 9/4/3 EECS 42 Introduction to Digital Electronics ndrew R. Neureuther Lecture # Prof. King: asic Digital locks 2
More informationChapter 1: Logic systems
Chapter 1: Logic systems 1: Logic gates Learning Objectives: At the end of this topic you should be able to: identify the symbols and truth tables for the following logic gates: NOT AND NAND OR NOR XOR
More informationBoole Algebra and Logic Series
S1 Teknik Telekomunikasi Fakultas Teknik Elektro oole lgebra and Logic Series 2016/2017 CLO1-Week2-asic Logic Operation and Logic Gate Outline Understand the basic theory of oolean Understand the basic
More informationLogic Gates and Boolean Algebra
Logic Gates and oolean lgebra The ridge etween Symbolic Logic nd Electronic Digital Computing Compiled y: Muzammil hmad Khan mukhan@ssuet.edu.pk asic Logic Functions and or nand nor xor xnor not 2 Logic
More informationCHAPTER 3 LOGIC GATES & BOOLEAN ALGEBRA
CHPTER 3 LOGIC GTES & OOLEN LGER C H P T E R O U T C O M E S Upon completion of this chapter, student should be able to: 1. Describe the basic logic gates operation 2. Construct the truth table for basic
More informationDigital electronic systems are designed to process voltage signals which change quickly between two levels. Low time.
DIGITL ELECTRONIC SYSTEMS Digital electronic systems are designed to process voltage signals which change quickly between two levels. High Voltage Low time Fig. 1 digital signal LOGIC GTES The TTL digital
More informationEGC221: Digital Logic Lab
Division of Engineering Programs EGC221: Digital Logic Lab Experiment #1 Basic Logic Gate Simulation Student s Name: Student s Name: Reg. no.: Reg. no.: Semester: Fall 2016 Date: 07 September 2016 Assessment:
More informationWhy digital? Overview. Number Systems. Binary to Decimal conversion
Why digital? Overview It has the following advantages over analog. It can be processed and transmitted efficiently and reliably. It can be stored and retrieved with greater accuracy. Noise level does not
More informationPart 5: Digital Circuits
Characteristics of any number system are: Part 5: Digital Circuits 5.: Number Systems & Code Conversions. ase or radix is equal to the number of possible symbols in the system 2. The largest value of digit
More informationBoolean Algebra. Boolean Variables, Functions. NOT operation. AND operation. AND operation (cont). OR operation
oolean lgebra asic mathematics for the study of logic design is oolean lgebra asic laws of oolean lgebra will be implemented as switching devices called logic gates. Networks of Logic gates allow us to
More informationLogic. Basic Logic Functions. Switches in series (AND) Truth Tables. Switches in Parallel (OR) Alternative view for OR
TOPIS: Logic Logic Expressions Logic Gates Simplifying Logic Expressions Sequential Logic (Logic with a Memory) George oole (85-864), English mathematician, oolean logic used in digital computers since
More informationLecture 9: Digital Electronics
Introduction: We can classify the building blocks of a circuit or system as being either analog or digital in nature. If we focus on voltage as the circuit parameter of interest: nalog: The voltage can
More informationCombinational logic systems
Combinational logic systems Learners should be able to: (a) recognise 1/0 as two-state logic levels (b) identify and use NOT gates and 2-input AND, OR, NAND and NOR gates, singly and in combination (c)
More informationComputer organization
Computer organization Levels of abstraction Assembler Simulator Applications C C++ Java High-level language SOFTWARE add lw ori Assembly language Goal 0000 0001 0000 1001 0101 Machine instructions/data
More informationIntroduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra
oolean lgebra Introduction 1854: Logical algebra was published by George oole known today as oolean lgebra It s a convenient way and systematic way of expressing and analyzing the operation of logic circuits.
More informationDigital Electronics. Delay Max. FF Rate Power/Gate High Low (ns) (MHz) (mw) (V) (V) Standard TTL (7400)
P57/67 Lec9, P Digital Electronics Introduction: In electronics we can classify the building blocks of a circuit or system as being either analog or digital in nature. If we focus on voltage as the circuit
More informationLecture 3. Title goes here 1. level Networks. Boolean Algebra and Multi-level. level. level. level. level
Lecture 3 Dr Richard Reilly Dept. of Electronic & Electrical Engineering Room 53, Engineering uilding oolean lgebra and Multi- oolean algebra George oole, little formal education yet was a brilliant scholar.
More information12/31/2010. Overview. 05-Boolean Algebra Part 3 Text: Unit 3, 7. DeMorgan s Law. Example. Example. DeMorgan s Law
Overview 05-oolean lgebra Part 3 Text: Unit 3, 7 EEGR/ISS 201 Digital Operations and omputations Winter 2011 DeMorgan s Laws lgebraic Simplifications Exclusive-OR and Equivalence Functionally omplete NND-NOR
More informationof Digital Electronics
26 Digital Electronics 729 Digital Electronics 26.1 Analog and Digital Signals 26.3 Binary Number System 26.5 Decimal to Binary Conversion 26.7 Octal Number System 26.9 Binary-Coded Decimal Code (BCD Code)
More informationTheorem/Law/Axioms Over (.) Over (+)
material prepared by: MUKESH OHR Follow me on F : http://www.facebook.com/mukesh.sirji4u OOLEN LGER oolean lgebra is a set of rules, laws and theorems by which logical operations can be mathematically
More informationChapter 7 Combinational Logic Networks
Overview Design Example Design Example 2 Universal Gates NND-NND Networks NND Chips Chapter 7 Combinational Logic Networks SKEE223 Digital Electronics Mun im/rif/izam KE, Universiti Teknologi Malaysia
More informationLOGIC GATES A Y=A+B. Logic symbol of OR gate B The Boolean expression of OR gate is Y = A + B, read as Y equals A 'OR' B.
LOGIC GTS J-Physics INTRODUCTION : logic gate is a digital circuit which is based on certain logical relationship between the input and the output voltages of the circuit. The logic gates are built using
More informationDigital Logic (2) Boolean Algebra
Digital Logic (2) Boolean Algebra Boolean algebra is the mathematics of digital systems. It was developed in 1850 s by George Boole. We will use Boolean algebra to minimize logic expressions. Karnaugh
More informationLearning Objectives. Boolean Algebra. In this chapter you will learn about:
Ref. Page Slide /78 Learning Objectives In this chapter you will learn about: oolean algebra Fundamental concepts and basic laws of oolean algebra oolean function and minimization Logic gates Logic circuits
More informationLOGIC GATES (PRACTICE PROBLEMS)
LOGIC GTES (PRCTICE PROLEMS) Key points and summary First set of problems from Q. Nos. 1 to 9 are based on the logic gates like ND, OR, NOT, NND & NOR etc. First four problems are basic in nature. Problems
More informationElectronics. Overview. Introducction to Synthetic Biology
Electronics Introducction to Synthetic iology E Navarro Montagud P Fernandez de Cordoba JF Urchueguía Overview Introduction oolean algebras Logical gates Representation of boolean functions Karnaugh maps
More informationMealy & Moore Machines
Mealy & Moore Machines Moore Machine is a finite-state machine whose output values are determined solely by its current state and can be defined as six elements (S, S 0, Σ, Λ, T, G), consisting of the
More informationLecture 2. Notes. Notes. Notes. Boolean algebra and optimizing logic functions. BTF Electronics Fundamentals August 2014
Lecture 2 Electronics ndreas Electronics oolean algebra and optimizing logic functions TF322 - Electronics Fundamentals ugust 24 Exercise ndreas ern University of pplied Sciences Rev. 946f32 2. of oolean
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd hapter 5 Modified by Yuttapong Jiraraksopakun Floyd, Digital Fundamentals, 10 th 2008 Pearson Education ENE, KMUTT ed 2009 2009 Pearson Education, Upper Saddle
More informationProve that if not fat and not triangle necessarily means not green then green must be fat or triangle (or both).
hapter : oolean lgebra.) Definition of oolean lgebra The oolean algebra is named after George ool who developed this algebra (854) in order to analyze logical problems. n example to such problem is: Prove
More informationLecture 1. Notes. Notes. Notes. Introduction. Introduction digital logic February Bern University of Applied Sciences
Output voltage Input voltage 3.3V Digital operation (Switch) Lecture digital logic February 26 ern University of pplied Sciences Digital vs nalog Logic =? lgebra Logic = lgebra oolean lgebra Exercise Rev.
More informationGates and Flip-Flops
Gates and Flip-Flops Chris Kervick (11355511) With Evan Sheridan and Tom Power December 2012 On a scale of 1 to 10, how likely is it that this question is using binary?...4? What s a 4? Abstract The operation
More informationActivity Truth Tables & Logic Expressions
Activity 2.1.3 Truth Tables & Logic Expressions Introduction The first step in designing a new product is creating a design specifications document. These design specifications detail all of the features
More informationBOOLEAN ALGEBRA INTRODUCTION SUBSETS
BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations
More informationGoals for Lecture. Binary Logic and Gates (MK 2.1) Binary Variables. Notation Examples. Logical Operations
Introduction to Electrical Engineering, II LETURE NOTES #2 Instructor: Email: Telephone: Office: ndrew. Kahng (lecture) abk@ucsd.edu 858-822-4884 office 3802 P&M lass Website: http://vlsicad.ucsd.edu/courses/ece20b/wi04/
More informationEvery time has a value associated with it, not just some times. A variable can take on any value within a range
Digital Logic Circuits Binary Logic and Gates Logic Simulation Boolean Algebra NAND/NOR and XOR gates Decoder fundamentals Half Adder, Full Adder, Ripple Carry Adder Analog vs Digital Analog Continuous»
More informationDigital Design 2. Logic Gates and Boolean Algebra
Digital Design 2. Logic Gates and oolean lgebra József Sütő ssistant Lecturer References: [1] D.M. Harris, S.L. Harris, Digital Design and Computer rchitecture, 2nd ed., Elsevier, 213. [2] T.L. Floyd,
More informationBoolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.
The Laws of Boolean Boolean algebra As well as the logic symbols 0 and 1 being used to represent a digital input or output, we can also use them as constants for a permanently Open or Closed circuit or
More informationBoolean Logic Prof. James L. Frankel Harvard University. Version of 3:20 PM 29-Aug-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved.
Boolean Logic Prof. James L. Frankel Harvard University Version of 3:20 PM 29-Aug-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved. Logic Levels Logic 0 Also called GND Low Off False Logic
More informationDigital Circuits. 1. Inputs & Outputs are quantized at two levels. 2. Binary arithmetic, only digits are 0 & 1. Position indicates power of 2.
Digital Circuits 1. Inputs & Outputs are quantized at two levels. 2. inary arithmetic, only digits are 0 & 1. Position indicates power of 2. 11001 = 2 4 + 2 3 + 0 + 0 +2 0 16 + 8 + 0 + 0 + 1 = 25 Digital
More informationChapter 2. Digital Logic Basics
Chapter 2 Digital Logic Basics 1 2 Chapter 2 2 1 Implementation using NND gates: We can write the XOR logical expression B + B using double negation as B+ B = B+B = B B From this logical expression, we
More informationPhysics 2020 Lab 5 Intro to Circuits
Physics 2020 Lab 5 Intro to Circuits Name Section Tues Wed Thu 8am 10am 12pm 2pm 4pm Introduction In this lab, we will be using The Circuit Construction Kit (CCK). CCK is a computer simulation that allows
More informationCMSC 313 Lecture 16 Postulates & Theorems of Boolean Algebra Semiconductors CMOS Logic Gates
CMSC 33 Lecture 6 Postulates & Theorems of oolean lgebra Semiconductors CMOS Logic Gates UMC, CMSC33, Richard Chang Last Time Overview of second half of this course Logic gates & symbols
More informationCOSC3330 Computer Architecture Lecture 2. Combinational Logic
COSC333 Computer rchitecture Lecture 2. Combinational Logic Instructor: Weidong Shi (Larry), PhD Computer Science Department University of Houston Today Combinational Logic oolean lgebra Mux, DeMux, Decoder
More informationLecture 21: Boolean Logic. To Wrap up AVR
18 100 Lecture 21: oolean Logic S 15 L21 1 James C. Hoe Dept of ECE, CMU pril 7, 2015 Today s Goal: Introduce oolean logic nnouncements: Read Rizzoni 12.3 and 11.5 HW8 due Thursday Office Hours: Wed 12:30~2:30
More informationBoolean Algebra & Digital Logic
Boolean Algebra & Digital Logic Boolean algebra was developed by the Englishman George Boole, who published the basic principles in the 1854 treatise An Investigation of the Laws of Thought on Which to
More informationEEE130 Digital Electronics I Lecture #4
EEE130 Digital Electronics I Lecture #4 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi Topics to be discussed 4-1 Boolean Operations and Expressions 4-2 Laws and Rules of Boolean
More informationDesigning Information Devices and Systems II Spring 2016 Anant Sahai and Michel Maharbiz Homework 5. This homework is due February 29, 2016, at Noon.
EECS 16 Designing Information Devices and Systems II Spring 2016 nant Sahai and Michel Maharbiz Homework 5 This homework is due February 29, 2016, at Noon. 1. Homework process and study group Who else
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and oolean lgebra) cknowledgements: Materials in this lecture are courtesy of the following people and used with permission. - Randy H. Katz (University of
More informationExperiment 7: Magnitude comparators
Module: Logic Design Lab Name:... University no:.. Group no: Lab Partner Name: Experiment 7: Magnitude comparators Mr. Mohamed El-Saied Objective: Realization of -bit comparator using logic gates. Realization
More informationCOMP2611: Computer Organization. Introduction to Digital Logic
1 OMP2611: omputer Organization ombinational Logic OMP2611 Fall 2015 asics of Logic ircuits 2 its are the basis for binary number representation in digital computers ombining bits into patterns following
More informationAlgebraic Methods for the Analysis and Synthesis
lgebraic ethods for the nalysis and Synthesis Fundaentals of oolean lgebra asic Postulates. oolean algebra is closed algebraic syste containing a set K of two or ore eleents and two operators and, ND and
More informationCHAPTER1: Digital Logic Circuits Combination Circuits
CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits Combination Circuits 1 PRIMITIVE LOGIC GATES Each of our basic operations can be implemented in hardware using a primitive logic gate.
More informationDIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA
DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA 1 Learning Objectives Understand the basic operations and laws of Boolean algebra. Relate these operations and laws to circuits composed of AND gates, OR gates, INVERTERS
More informationComputer Organization: Boolean Logic
Computer Organization: Boolean Logic Representing and Manipulating Data Last Unit How to represent data as a sequence of bits How to interpret bit representations Use of levels of abstraction in representing
More informationBoolean Algebra & Logic Gates. By : Ali Mustafa
Boolean Algebra & Logic Gates By : Ali Mustafa Digital Logic Gates There are three fundamental logical operations, from which all other functions, no matter how complex, can be derived. These Basic functions
More informationXOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.
XOR - XNOR Gates Lesson Objectives: In addition to AND, OR, NOT, NAND and NOR gates, exclusive-or (XOR) and exclusive-nor (XNOR) gates are also used in the design of digital circuits. These have special
More informationECE 342 Electronic Circuits. Lecture 34 CMOS Logic
ECE 34 Electronic Circuits Lecture 34 CMOS Logic Jose E. Schutt-Aine Electrical & Computer Engineering University of Illinois jesa@illinois.edu 1 De Morgan s Law Digital Logic - Generalization ABC... ABC...
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and oolean lgebra) cknowledgements: Lecture material adapted from Chapter 2 of R. Katz, G. orriello, Contemporary Logic Design (second edition), Pearson Education,
More informationDigital electronics form a class of circuitry where the ability of the electronics to process data is the primary focus.
Chapter 2 Digital Electronics Objectives 1. Understand the operation of basic digital electronic devices. 2. Understand how to describe circuits which can process digital data. 3. Understand how to design
More informationDIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA (CONT.)
DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA (CONT.) 1 Learning Objectives 1. Apply the laws and theorems of Boolean algebra to to the manipulation of algebraic expressions to simplifying an expression, finding
More informationUnit 8A Computer Organization. Boolean Logic and Gates
Unit 8A Computer Organization Boolean Logic and Gates Announcements Bring ear buds or headphones to lab! 15110 Principles of Computing, Carnegie Mellon University - CORTINA 2 Representing and Manipulating
More informationGates. Quiz 1 will cover up to and including this lecture. The book says something about NAND... maybe an in-law. Is he talking about BILL??? 6.
Gates Is he talking about ILL??? The book says something about NND... maybe an in-law. WRD & HLSTED 6.4 NERD KIT Quiz will cover up to and including this lecture 6.4 - Fall 22 9/7/2 L4 - Gates Quick Review
More informationGates and Logic: From switches to Transistors, Logic Gates and Logic Circuits
Gates and Logic: From switches to Transistors, Logic Gates and Logic Circuits Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University See: P&H ppendix C.2 and C.3 (lso, see C.0 and
More informationProf.Manoj Kavedia 2 Algebra
` Logic Gates and Boolean 2 Algebra Chapter-2 (Hours:06 Marks:14 )( 12064 Digital Techniques) Logic Gates And Boolean Algebra 2.1 Logical symbol, logical expression and truth table of AND, OR, NOT, NAND,
More informationDigital- or Logic Circuits. Outline Logic Circuits. Logic Voltage Levels. Binary Representation
Outline Logic ircuits Introduction Logic Systems TTL MOS Logic Gates NOT, OR, N NOR, NN, XOR Implementation oolean lgebra ombinatorial ircuits Multipleer emultipleer rithmetic ircuits Simplifying Logic
More informationAppendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring
- Principles of Computer rchitecture Miles Murdocca and Vincent Heuring 999 M. Murdocca and V. Heuring -2 Chapter Contents. Introduction.2 Combinational Logic.3 Truth Tables.4 Logic Gates.5 Properties
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 3 Additional Gates and Circuits Overview Part 1 Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra
More information4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra
4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra To design a digital circuit that will perform a required function, it is necessary to manipulate and combine the various input signals in certain
More informationChapter 2 Part 7 Combinational Logic Circuits
University of Wisconsin - Madison EE/omp Sci 352 Digital Systems Fundamentals Kewal K. Saluja and u Hen Hu Spring 2002 hapter 2 Part 7 ombinational Logic ircuits Originals by: harles R. Kime and Tom Kamisnski
More informationCHAPTER 12 Boolean Algebra
318 Chapter 12 Boolean Algebra CHAPTER 12 Boolean Algebra SECTION 12.1 Boolean Functions 2. a) Since x 1 = x, the only solution is x = 0. b) Since 0 + 0 = 0 and 1 + 1 = 1, the only solution is x = 0. c)
More informationElectrical Circuits. Winchester College Physics. makptb. c D. Common Time man. 3rd year Revision Test
Name... Set... Don.... manner~ man makptb Winchester College Physics 3rd year Revision Test Electrical Circuits Common Time 2011 Mark multiple choice answers with a cross (X) using the box below. I A B
More information. T SHREE MAHAPRABHU PUBLIC SCHOOL & COLLEGE NOTES FOR BOARD EXAMINATION SUBJECT COMPUTER SCIENCE (Code: 083) Boolean Algebra
. T SHREE MAHAPRABHU PUBLIC SCHOOL & COLLEGE NOTES FOR BOARD EXAMINATION 2016-17 SUBJECT COMPUTER SCIENCE (Code: 083) Boolean Algebra Introduction to Boolean Algebra Boolean algebra which deals with two-valued
More informationChapter 5. Digital systems. 5.1 Boolean algebra Negation, conjunction and disjunction
Chapter 5 igital systems digital system is any machine that processes information encoded in the form of digits. Modern digital systems use binary digits, encoded as voltage levels. Two voltage levels,
More informationBuilding a Computer Adder
Logic Gates are used to translate Boolean logic into circuits. In the abstract it is clear that we can build AND gates that perform the AND function and OR gates that perform the OR function and so on.
More informationXI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.
2017-18 XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL HALF ADDER 1. The circuit that performs addition within the Arithmetic and Logic Unit of the CPU are called adders. 2. A unit that adds two
More informationSchool of Computer Science and Electrical Engineering 28/05/01. Digital Circuits. Lecture 14. ENG1030 Electrical Physics and Electronics
Digital Circuits 1 Why are we studying digital So that one day you can design something which is better than the... circuits? 2 Why are we studying digital or something better than the... circuits? 3 Why
More information1 Boolean Algebra Simplification
cs281: Computer Organization Lab3 Prelab Our objective in this prelab is to lay the groundwork for simplifying boolean expressions in order to minimize the complexity of the resultant digital logic circuit.
More informationLab 4. Current, Voltage, and the Circuit Construction Kit
Physics 2020, Spring 2009 Lab 4 Page 1 of 8 Your name: Lab section: M Tu Wed Th F TA name: 8 10 12 2 4 Lab 4. Current, Voltage, and the Circuit Construction Kit The Circuit Construction Kit (CCK) is a
More informationNumber System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary
Number System Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary BOOLEAN ALGEBRA BOOLEAN LOGIC OPERATIONS Logical AND Logical OR Logical COMPLEMENTATION
More information10/14/2009. Reading: Hambley Chapters
EE40 Lec 14 Digital Signal and Boolean Algebra Prof. Nathan Cheung 10/14/2009 Reading: Hambley Chapters 7.1-7.4 7.4 Slide 1 Analog Signals Analog: signal amplitude is continuous with time. Amplitude Modulated
More informationENGR 303 Introduction to Logic Design Lecture 3. Dr. Chuck Brown Engineering and Computer Information Science Folsom Lake College
Introduction to Logic Design Lecture 3 Dr. Chuck rown Engineering and Computer Information Science Folsom Lake College Outline for Todays Lecture Logic Circuits SOP / POS oolean Theorems DeMorgan s Theorem
More informationMC9211 Computer Organization
MC92 Computer Organization Unit : Digital Fundamentals Lesson2 : Boolean Algebra and Simplification (KSB) (MCA) (29-2/ODD) (29 - / A&B) Coverage Lesson2 Introduces the basic postulates of Boolean Algebra
More informationCombinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
More informationEEL 3701 Fall Multiply out the following logic expressions to obtain the Sum of Products.
Page 1/5 Version: 7/30/17 1. Multiply out the following logic expressions to obtain the Sum of Products.. (/W /X Y) (W /Z) (/W X /Z) (W X) (W Y /Z). (/W /Y Z) (/W Y) (X /Y /Z) (/W X Y) (Y Z) 2. Using oolean
More information33. SOLVING LINEAR INEQUALITIES IN ONE VARIABLE
get the complete book: http://wwwonemathematicalcatorg/getfulltextfullbookhtm 33 SOLVING LINEAR INEQUALITIES IN ONE VARIABLE linear inequalities in one variable DEFINITION linear inequality in one variable
More informationMODULE- 07 : FLUIDICS AND FLUID LOGIC
MODULE- 07 : FLUIDICS AND FLUID LOGIC LECTURE- 26 : INTRODUCTION TO FLUID LOGIC INTRODUCTION Fluidics (also known as Fluidic logic) is the use of a fluid or compressible medium to perform analog or digital
More informationDepartment of Electrical and Computer Engineering University of Wisconsin - Madison. ECE/CS 352 Digital System Fundamentals.
Last (family) name: First (given) name: Student I.D. #: Circle section: Lipasti Kim Department of Electrical and Computer Engineering University of Wisconsin - Madison ECE/CS 352 Digital System Fundamentals
More informationAdditional Gates COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals
Additional Gates COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals Presentation Outline Additional Gates and Symbols Universality of NAND and NOR gates NAND-NAND
More informationCS 226: Digital Logic Design
CS 226: Digital Logic Design 0 1 1 I S 0 1 0 S Department of Computer Science and Engineering, Indian Institute of Technology Bombay. 1 of 29 Objectives In this lecture we will introduce: 1. Logic functions
More informationUnit 4: Computer as a logic machine
Unit 4: Computer as a logic machine Propositional logic Boolean algebra Logic gates Computer as a logic machine: symbol processor Development of computer The credo of early AI Reference copyright c 2013
More informationLogic Gate Level. Part 2
Logic Gate Level Part 2 Constructing Boolean expression from First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result column of the truth table Works best for table with relatively
More information1.10 (a) Function of AND, OR, NOT, NAND & NOR Logic gates and their input/output.
Chapter 1.10 Logic Gates 1.10 (a) Function of AND, OR, NOT, NAND & NOR Logic gates and their input/output. Microprocessors are the central hardware that runs computers. There are several components that
More informationDigital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.
CS211 Computer Architecture Digital Logic l Topics l Transistors (Design & Types) l Logic Gates l Combinational Circuits l K-Maps Figures & Tables borrowed from:! http://www.allaboutcircuits.com/vol_4/index.html!
More informationChapter 7 Logic Circuits
Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary
More informationMAT2345 Discrete Math
Fall 2013 General Syllabus Schedule (note exam dates) Homework, Worksheets, Quizzes, and possibly Programs & Reports Academic Integrity Do Your Own Work Course Web Site: www.eiu.edu/~mathcs Course Overview
More informationSequential Logic (3.1 and is a long difficult section you really should read!)
EECS 270, Fall 2014, Lecture 6 Page 1 of 8 Sequential Logic (3.1 and 3.2. 3.2 is a long difficult section you really should read!) One thing we have carefully avoided so far is feedback all of our signals
More informationChapter 2 Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates Huntington Postulates 1. (a) Closure w.r.t. +. (b) Closure w.r.t.. 2. (a) Identity element 0 w.r.t. +. x + 0 = 0 + x = x. (b) Identity element 1 w.r.t.. x 1 =
More informationDigital Logic Design ABC. Representing Logic Operations. Dr. Kenneth Wong. Determining output level from a diagram. Laws of Boolean Algebra
Digital Logic Design ENGG1015 1 st Semester, 2011 Representing Logic Operations Each function can be represented equivalently in 3 ways: Truth table Boolean logic expression Schematics Truth Table Dr.
More information