Homework 1 Due 21st May 2014.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Lecture 5 EGRE 254 1/28/09. 2 Boolean algebra a.k.a. “switching algebra” –deals with Boolean values -- 0, 1 Positive-logic convention –analog voltages.
Combinational Logic Circuits Chapter 2 Mano and Kime.
Morgan Kaufmann Publishers
Multiplexer as a Universal Function Generator Lecture L6.7 Section 6.2.
Chapter 2 Logic Circuits.
Multiplexer as a Universal Function Generator
Introduction to Computer Engineering by Richard E. Haskell Basic Logic Gates Module M1.1 Section 3.1.
1 Why study Boolean Algebra? 4 It is highly desirable to find the simplest circuit implementation (logic) with the smallest number of gates or wires. We.
EE2420 – Digital Logic Summer II 2013 Hassan Salamy Ingram School of Engineering Texas State University Set 4: Other Gates.
Logic Gates. Outline  Logic Gates  The Inverter  The AND Gate  The OR Gate  The NAND Gate  The NOR Gate  The XOR Gate  The XNOR Gate  Drawing.
Why? What’s Boolean algebra used for? –“The purpose of Boolean algebra is to facilitate the analysis and design of digital circuits.” Express a truth table.
Boolean Logic and Circuits ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
Physics 343 Advanced Electronics Engineering 343 Digital Systems Electronics Courses.
COE 202: Digital Logic Design Combinational Logic Part 4
1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.
©2004 Brooks/Cole FIGURES FOR CHAPTER 3 BOOLEAN ALGEBRA (continued) Click the mouse to move to the next page. Use the ESC key to exit this chapter. This.
Chap 2. Combinational Logic Circuits
Ahmad Almulhem, KFUPM 2010 COE 202: Digital Logic Design Combinational Logic Part 4 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
Chapter-3: BOOLEAN ALGEBRA & LOGIC GATES Analysis and logical design.
Lecture 18: Boolean Algebra Boolean Functions. w = Chris is allowed to watch television x = Chris's homework is finished y = it is a school night z =
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
 To find the numerical value of the expression, simply substitute the variables in the expression with the given number. Evaluate: 2x + 7, if x = 4 Substitute.
President UniversityErwin SitompulDigital Systems 4/1 Lecture 4 Digital Systems Dr.-Ing. Erwin Sitompul President University
Combinational Logic Weiqiang Sun. A brief review Logic gates Logic gates AND, OR, NOT AND, OR, NOT NAND, NOR, XOR, XNOR NAND, NOR, XOR, XNOR Boolean algebra.
ECE 331 – Digital System Design
Lecture 4 Topics Boolean Algebra Huntington’s Postulates Truth Tables
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
Chapter 5 Combinational Logic 组合逻辑
CS2100 Computer Organisation
CHAPTER 3 Simplification of Boolean Functions
Table 2.1 Postulates and Theorems of Boolean Algebra
Logic Gates and Logic Circuits
Eng. Mai Z. Alyazji October, 2016
Chapter 3 Notes – Part II Review Questions
DIGITAL LOGIC CIRCUITS
14:332:231 DIGITAL LOGIC DESIGN Boolean Algebra
CS2100 Computer Organisation
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 Instructor: Andrew B. Kahng (lecture)
EXAMPLES- Simplifying Radicals part 2
CHAPTER 3 BOOLEAN ALGEBRA (continued)
CHAPTER 2 Boolean Algebra
Introduction to Logic Gates
EI205 Lecture 5 Dianguang Ma Fall 2008.
5-4 The Triangle midsegment theorem
Computer Organization and Design Transistors & Logic - II
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Boolean Algebra and Combinational Logic
Princess Sumaya University
Boolean Algebra – Part 1 ECEn 224.
Lecture 2-1 Boolean Algebra
ECE 331 – Digital System Design
Dr. Clincy Professor of CS
Boolean Algebra Why study Boolean Algebra?
Boolean Algebra.
UNIVERSAL GATES.
Lecture 14: Boolean Algebra
Dr. Clincy Professor of CS
Universal gates.
Example Question: Consider the expressions: (a) F = XY + XY'
Lecture 4 Topics Boolean Algebra Huntington’s Postulates Truth Tables
Dr. Clincy Professor of CS
Introduction to Digital Systems
MINTERMS and MAXTERMS Week 3
CHAPTER 3 BOOLEAN ALGEBRA (continued)
Table 2.1 Postulates and Theorems of Boolean Algebra
Space groups Start w/ 2s and 21s 222.
Verifying Segment Relationships
Circuit Simplification and
Presentation transcript:

Homework 1 Due 21st May 2014

Prove the Dual of the following Consensus Theorem x.y + x’.z + y.z = x.y + x’.z Marks = 6

Note: The legend for the aforementioned symbols is as follows Prove whether the following Associativity Relationships are correct or incorrect? a ^ (b ^ c) = (a ^ b) ^ c a (b c) = (a b) c a (b c) = (a b) c Note: The legend for the aforementioned symbols is as follows ^ XOR NAND NOR Marks = 3 + 3 + 3

Convert the following SOP expression into a POS expression f = x.y + x’.y.z’ + y’.z’ Convert the following POS expression into a SOP expression f = ( x + y ).( x’ + y + z’ ).( y’ + z’ ) Marks = 3 + 3

Convert the following SOP expression into a C-SOP expression f = x.y + x’.y.z’ + y’.z’ Convert the following POS expression into a C-POS expression f = ( x + y ).( x’ + y + z’ ).( y’ + z’ ) Marks = 3 + 3

Implement This Function using two 8-to-1 Line Multiplexers two 4-to-1 Line Multiplexers two 2-to-1 Line Multiplexers two 8-to-1 Line Multiplexer s (where the Multiplexers are tree structures of smaller multiplexers) Marks = 3 + 3 + 3 + 4