ENGR-4300 Electronic Instrumentation Fall 2000
|
|
- Clinton Hodges
- 6 years ago
- Views:
Transcription
1 ENGR-400 Electronic Instrumentation Fall 000 Questions about Logic Gates Fall 004 Question : NAND Gate Circuit (6 points) Below is a picture of a series of NAND gates hooked together to form one of the basic gates we have studied and the PSpice output for the circuit OFFTIME = 0.5u DSTM ONTIME =.5uS CLK DELAY = 0 STARTAL = 0 OPPAL = A U0A C UA E U4A G OFFTIME = us DSTM ONTIME = us CLK DELAY = 0 STARTAL = 0 OPPAL = B UA D F U5A U6A a) Fill in the truth table for the circuit (0 points) A B C D E F G b) This circuit is a model for one of the gates we have seen in class. What single gate does it represent ( points)? c) Write a boolean expression for this circuit. Do not simplify. (4 points) K. A. Connor Revised: /0/005
2 ENGR-400 Electronic Instrumentation Fall 000 Fall 004 Solution (not available) K. A. Connor Revised: /0/005
3 ENGR-400 Electronic Instrumentation Fall 000 Spring 004 Question Logic Gates (0 points) a) Fill in the truth table for the circuit above: ( points) A B C D E F G H Q b) Write the Boolean expression for the circuit in a). Do not simplify. (6 points) c) What type of gate could the above circuit be replaced with to give the same results for Q based on A, B and C? ( points) ) Three input AND gate ) Three input OR gate ) Three input NOR gate 4) Three input NAND gate 5) none of the above K. A. Connor Revised: /0/005
4 ENGR-400 Electronic Instrumentation Fall 000 Extra credit ( point): Simplify the Boolean expression in b) using the rules of Boolean algebra on your crib sheet. K. A. Connor 4 Revised: /0/005
5 ENGR-400 Electronic Instrumentation Fall 000 Spring 004 solution Question Logic Gates (0 points) b) Fill in the truth table for the circuit above: ( points) A B C D E F G H Q b) Write the Boolean expression for the circuit in a). Do not simplify. (6 points) Q = ~{G + H} = ~{~F + (F&E)} = ~{~~(D+E) + (~(D+E)&E)} G = ~F H=F&E F=~(D+E) E= ~(B&C) D=~(A&B) Q = ~{ [ ~~(~(A&B) + ~(B&C))] + [~(~(A&B)+~(B&C)) & ~(B&C)] } c) What type of gate could the above circuit be replaced with to give the same results for Q based on A, B and C? ( points) ) Three input AND gate ) Three input OR gate ) Three input NOR gate K. A. Connor 5 Revised: /0/005
6 ENGR-400 Electronic Instrumentation Fall 000 4) Three input NAND gate 5) none of the above Extra credit ( point): Simplify the Boolean expression in b) using the rules of Boolean algebra on your crib sheet. expression rule Q=~{[ ~~(~(A&B) + ~(B&C))] + [~(~(A&B)+~(B&C)) & ~(B&C)]} given Q=~{[(~A&B) + ~(B&C)] + [~(~(A&B)+~(B&C)) & ~(B&C)]} ~~X = X Q=~{~[(A&B) & (B&C)] + [~~(A&B & B&C)) & ~(B&C)]} ~X&~Y=~(X&Y) Q=~{~[A&B&B&C] + [(A&B&B&C) & ~(B&C)]} ~~X = X Q=~{~[A&B&C] + [(A & (B&C) & ~(B&C)]} X&X=X Q=~{~[A&B&C] +[A&0]} X&~X=0 Q=~{~{A&B&C] + 0 } X&0=0 Q=~~{A&B&C} X+0=X Q= A&B&C ~~X=X QED K. A. Connor 6 Revised: /0/005
7 ENGR-400 Electronic Instrumentation Fall 000 Fall 00 Question Logic Gates (0 points) a) Match the gate on the left with an equivalent circuit on the right. (0 points) K. A. Connor 7 Revised: /0/005
8 ENGR-400 Electronic Instrumentation Fall 000 b) Fill in the truth table for the circuit below. (6 points) A B UA:Y UA:Y UA:Y Q c) Write the Boolean expression for the circuit in b. Do not simplify. (4 points) Extra credit ( point): Simplify the Boolean expression in c) using the rules of Boolean algebra on your crib sheet. K. A. Connor 8 Revised: /0/005
9 ENGR-400 Electronic Instrumentation Fall 000 Fall 00 Solution Question Logic Gates (0 points) a) Match the gate on the left with an equivalent circuit on the right. (0 points) A= B= C=5 D=4 E= and 5 are DeMorgan s Laws is ~(A and A) = ~A ~(A or A) = ~A too is ~(~A or ~B) = ~~(A and B) by DeMorgan s Law = (A and B) 4 is ~(~A and ~B) = ~~(A or B) by Demorgan s Law = (A or B) K. A. Connor 9 Revised: /0/005
10 ENGR-400 Electronic Instrumentation Fall 000 b) Fill in the truth table for the circuit below. (6 points) A B UA:Y UA:Y UA:Y Q c) Write the Boolean expression for the circuit in b. Do not simplify. (4 points) {( ) [ ( )] } A A + B A A Q = ( Extra credit ( point): Simplify the Boolean expression in c) using the rules of Boolean algebra on your crib sheet. Q = Q Q Q Q = = = = Q = {( ) [ ( )] } A A + ( B A A {( ) [ ( )] A + A + ( B A + A } {( A + A) + [( B ( A + A) ]} { + [( B ) ]} { + B} From DeMorgan' s Law X = part c) X X + X = X = X X + = K. A. Connor 0 Revised: /0/005
11 ENGR-400 Electronic Instrumentation Fall 000 Spring 00 Question ) Logic Gates (0 pts) a) In the circuit above, form the truth table for all marked points. ( pts each) A B C D E F G H I J b) Based on the truth table you formed, write a Boolean expression for D as a function of A. ( pt) c) Based on the truth table you formed, write a Boolean expression for H as a function of D and E. Your answer should involve only one gate operation. ( pts) d) Based on the truth table you formed, write a Boolean expression for J as a function of A, B and C. Your answer should involve only one gate operation. ( pts) K. A. Connor Revised: /0/005
12 ENGR-400 Electronic Instrumentation Fall 000 Spring 00 solution (not available) K. A. Connor Revised: /0/005
13 ENGR-400 Electronic Instrumentation Fall 000 Fall 00 Question ) NAND Gate Circuit (5 points) Below is a picture of a series of NAND gates hooked together to form one of the basic gates we have studied and the PSpice output for the circuit. OFFTIME = us DSTM ONTIME = us CLK DELAY = 0 STARTAL = 0 OPPAL = OFFTIME =.5us DSTM ONTIME =.5us CLK DELAY = 0 STARTAL = 0 OPPAL = A B UA C UA UA E D U4A F UA:A DSTM: UA:A UA:Y UA:Y U4A:Y 0s.0us 4.0us 6.0us 8.0us Time a) Fill in the truth table for the circuit (9 pts). A B C D E F b) What gate does this represent ( pts)? c) Write a boolean expression for this circuit. Do not simplify. (4 pts). K. A. Connor Revised: /0/005
14 ENGR-400 Electronic Instrumentation Fall 000 Fall 00 Solution Question ) NAND Gate Circuit (5 points) Below is a picture of a series of NAND gates hooked together to form one of the basic gates we have studied and the PSpice output for the circuit. OFFTIME = us DSTM ONTIME = us CLK DELAY = 0 STARTAL = 0 OPPAL = OFFTIME =.5us DSTM ONTIME =.5us CLK DELAY = 0 STARTAL = 0 OPPAL = A B UA C UA UA E D U4A F UA:A DSTM: UA:A UA:Y UA:Y U4A:Y 0s.0us 4.0us 6.0us 8.0us Time a) Fill in the truth table for the circuit (9 pts). A B C D E F b) What gate does this represent ( pts)? XOR a) Write a boolean expression for this circuit. Do not simplify. (4 pts). [( A B) A] [( A B) B] K. A. Connor 4 Revised: /0/005
15 ENGR-400 Electronic Instrumentation Fall 000 Spring 00 ) Logic Gates (0 points) You should recognize the digital gates in the following circuit as the ones introduced in the lab and/or in class. a) What kind of gate is UA? ( points) b) What is the truth table for gate UA? (6 points) c) Indicate which of the three plots on the following page represents the output of the circuit. Show any work below for partial credit. ( points) K. A. Connor 5 Revised: /0/005
16 ENGR-400 Electronic Instrumentation Fall 000 Circuits for question part c). A. DSTM: UA:Y UA:Y UA:B B. 0s us 4us 6us 8us 0us Time DSTM: UA:Y UA:Y UA:B 0s us 4us 6us 8us 0us Time C. DSTM: UA:A UA:B UA:Y 0s us 4us 6us 8us 0us Time K. A. Connor 6 Revised: /0/005
17 ENGR-400 Electronic Instrumentation Fall 000 ) Logic Gates (0 points) You should recognize the digital gates in the following circuit as the ones introduced in the lab and/or in class. a) What kind of gate is UA? ( points) Answer: UA is a three input NOR gate b) What is the truth table for gate UA? (6 points) Answer: A B C Y c) Indicate which of the three plots on the following page represents the output of the circuit. Show any work below for partial credit. ( points) work: DSTM UA:Y U5A:Y UA:Y UA:Y Note: UA:B is the same as UA:Y K. A. Connor 7 Revised: /0/005
18 ENGR-400 Electronic Instrumentation Fall 000 Circuits for question part c). A. DSTM: UA:Y UA:Y UA:B 0s us 4us 6us 8us 0us Time B. Answer: This one is CORRECT. DSTM: UA:Y UA:Y UA:B C. DSTM: UA:A UA:B UA:Y 0s us 4us 6us 8us 0us Time 0s us 4us 6us 8us 0us Time K. A. Connor 8 Revised: /0/005
19 ENGR-400 Electronic Instrumentation Fall 000 ) NAND Gate Circuits (0 points) It is possible to configure all standard gates using just NAND gates. The figure below show one such combination of NANDS. Clock OFFTIME =.5u DSTM ONTIME =.5u CLK DELAY = 0 STARTAL = 0 OPPAL = Clock OFFTIME =.5uS DSTM ONTIME =.5uS CLK DELAY = 0 STARTAL = 0 OPPAL = A B UA UA C D a. On the following plot, identify which signal goes with which location (6 points). UA E U4A F b. Draw a truth table for the circuit, showing the inputs, the output and as many steps in between as you need to determine how it works (0 points). c. Which single type of gate is this circuit equivalent to (4 points)? K. A. Connor 9 Revised: /0/005
20 ENGR-400 Electronic Instrumentation Fall 000 ) NAND Gate Circuits (0 points) It is possible to configure all standard gates using just NAND gates. The figure below show one such combination of NANDS. Clock OFFTIME =.5u DSTM ONTIME =.5u CLK DELAY = 0 STARTAL = 0 OPPAL = Clock OFFTIME =.5uS DSTM ONTIME =.5uS CLK DELAY = 0 STARTAL = 0 OPPAL = A B UA UA C D a. On the following plot, identify which signal goes with which location (6 points). UA E U4A F Answer: order from top to bottom: F,A,B,C,D,E b. Draw a truth table for the circuit, showing the inputs, the output and as many steps in between as you need to determine how it works (0 points). Answer: A B C D E F c. Which single type of gate is this circuit equivalent to (4 points)? Answer: two input NOR gate K. A. Connor 0 Revised: /0/005
21 ENGR-400 Electronic Instrumentation Fall 000 ) Combinational Logic (0 points) Draw the truth table for the circuit above: A B C D E F G H I Q K. A. Connor Revised: /0/005
22 ENGR-400 Electronic Instrumentation Fall 000 ) Combinational Logic (0 points) Draw the truth table for the circuit above: Answer: A B C D E F G H I Q K. A. Connor Revised: /0/005
23 ENGR-400 Electronic Instrumentation Fall 000 Spring 00 Sample Question: Boolean Algebra It is possible to configure all standard gates using just NAND gates. The figure below show one such combination of NANDS. Clock OFFTIME =.5u A DSTM UA ONTIME =.5u C CLK DELAY = 0 STARTAL = 0 OPPAL = UA E U4A F Clock OFFTIME =.5uS DSTM ONTIME =.5uS CLK DELAY = 0 STARTAL = 0 OPPAL = B UA D a. Identify which trace belongs to which point in the circuit. b. Write a boolean expression for this circuit (Do not simplify). K. A. Connor Revised: /0/005
24 ENGR-400 Electronic Instrumentation Fall 000 a. Properties of b. Rules of Combination c. DeMorgan s Laws Operations (a) A ٠ 0 = 0 (b) A ٠ B = B ٠ A (c) ~(A ٠ B) = ~A + ~B (a) A + 0 = A (b) A + B = B + A (c) ~(A + B) = ~A ٠ ~B (a) A ٠ = A (b) A ٠ (B+C) = (A٠B) + (A٠C) (a4) A + = (b4) A ٠ (B٠C) = (A٠B) ٠ C d. Other Rules (a5) A ٠ A = A (b5) A + (B+C) = (A+B) + C (d)a B = ~A٠B + A٠~B (a6) A + A = A (b6) A + (A٠B) = A (d)a XOR B = ~AandB + Aand~B (a7) A ٠ ~A = 0 (b7) A ٠ (A+B) = A (d) ~(A B) = ~A٠~B + A٠B (a8) A + ~A = (b8) A ٠ (~A + B) = A ٠ B (d) ~(A XOR B) = ~Aand~B + AandB (a9) ~(~A) = A (b9) A + (~A ٠ B) = A + B (b0) ~A + (A ٠ B) = ~A + B (b) ~A + (A ٠ ~B) = ~A + ~B Note that the NOT operation is indicated here by ~ instead of as a bar over the letter. You are free to use either notation. You can indicate the rule by the letter. [Note to students: Unfortunately, the PDF writer has trouble with the symbol font. In the above chart, the? in sections a, b and c are AND symbols and the meaning of the? in section d can be found in the restatement of the rule.] c. Using the Boolean Algebra rules shown above, prove that this combination of gates works as a NOR gate. K. A. Connor 4 Revised: /0/005
25 ENGR-400 Electronic Instrumentation Fall 000 Spring 00 solution Sample Question: Boolean Algebra ** ANSWER ** It is possible to configure all standard gates using just NAND gates. The figure below show one such combination of NANDS. Clock OFFTIME =.5u A DSTM UA ONTIME =.5u C CLK DELAY = 0 STARTAL = 0 OPPAL = UA E U4A F Clock OFFTIME =.5uS DSTM ONTIME =.5uS CLK DELAY = 0 STARTAL = 0 OPPAL = B UA D a. Identify which trace belongs to which point in the circuit. A = Clock; B=Clock; C = ~A = X; D = ~B = Y; E = ~(XandY) = Z; F=~E=W b) Write a boolean expression for this circuit (Do not simplify). F = ~[~( ~A and ~B )] K. A. Connor 5 Revised: /0/005
26 ENGR-400 Electronic Instrumentation Fall 000 a. Properties of b. Rules of Combination c. DeMorgan s Laws Operations (a) A ٠ 0 = 0 (b) A ٠ B = B ٠ A (c) ~(A ٠ B) = ~A + ~B (a) A + 0 = A (b) A + B = B + A (c) ~(A + B) = ~A ٠ ~B (a) A ٠ = A (b) A ٠ (B+C) = (A٠B) + (A٠C) (a4) A + = (b4) A ٠ (B٠C) = (A٠B) ٠ C d. Other Rules (a5) A ٠ A = A (b5) A + (B+C) = (A+B) + C (d)a B = ~A٠B + A٠~B (a6) A + A = A (b6) A + (A٠B) = A (d)a XOR B = ~AandB + Aand~B (a7) A ٠ ~A = 0 (b7) A ٠ (A+B) = A (d) ~(A B) = ~A٠~B + A٠B (a8) A + ~A = (b8) A ٠ (~A + B) = A ٠ B (d) ~(A XOR B) = ~Aand~B + AandB (a9) ~(~A) = A (b9) A + (~A ٠ B) = A + B (b0) ~A + (A ٠ B) = ~A + B (b) ~A + (A ٠ ~B) = ~A + ~B Note that the NOT operation is indicated here by ~ instead of as a bar over the letter. You are free to use either notation. You can indicate the rule by the letter. [Note to students: Unfortunately, the PDF writer has trouble with the symbol font. In the above chart, the? in sections a, b and c are AND symbols and the meaning of the? in section d can be found in the restatement of the rule.] c. Using the Boolean Algebra rules shown above, prove that this combination of gates works as a NOR gate. F = ~[~(~A and ~B)] F = ~A and ~B F = ~ (A or B) given rule a9 rule c This is a NOR gate. K. A. Connor 6 Revised: /0/005
27 ENGR-400 Electronic Instrumentation Fall 000 Fall 00 Solution K. A. Connor 7 Revised: /0/005
28 ENGR-400 Electronic Instrumentation Fall 000 K. A. Connor 8 Revised: /0/005
29 ENGR-400 Electronic Instrumentation Fall 000 K. A. Connor 9 Revised: /0/005
30 ENGR-400 Electronic Instrumentation Fall 000 K. A. Connor 0 Revised: /0/005
31 ENGR-400 Electronic Instrumentation Fall 000 Fall 000. Logic Gates You should recognize the logic gates in the figure below as those used in part of Experiment 0. If you performed the same kind of experiment as you did when you tested the gates on the protoboard, which of the following three figures is correct for the inputs shown? The digital clock represents the function generator and the other inputs are DC values obtained by connecting to the ground and CC rails on the protoboard. UA 740 DSTM CLK UA 740 5v R k 0 UA 7404 K. A. Connor Revised: /0/005
32 ENGR-400 Electronic Instrumentation Fall 000 DSTM: UA:Y UA:Y UA:Y 0s.0us.0us.0us 4.0us 5.0us Time UA:Y UA:Y UA:Y DSTM: 0s.0us.0us.0us 4.0us 5.0us Time DSTM: UA:Y UA:Y UA:Y 0s.0us.0us.0us 4.0us 5.0us Time K. A. Connor Revised: /0/005
33 ENGR-400 Electronic Instrumentation Fall 000 Fall 00 Solution:. Logic Gates You should recognize the logic gates in the figure below as those used in part of Experiment 0. If you performed the same kind of experiment as you did when you tested the gates on the protoboard, which of the following three figures is correct for the inputs shown? The digital clock represents the function generator and the other inputs are DC values obtained by connecting to the ground and CC rails on the protoboard. UA 740 DSTM CLK UA 740 5v R k 0 UA 7404 work: DSTM UA:Y UA:Y UA:Y K. A. Connor Revised: /0/005
34 ENGR-400 Electronic Instrumentation Fall 000 DSTM: UA:Y UA:Y UA:Y UA:Y UA:Y UA:Y DSTM: 0s.0us.0us.0us 4.0us 5.0us Time Answer: The one below is correct. 0s.0us.0us.0us 4.0us 5.0us Time DSTM: UA:Y UA:Y UA:Y 0s.0us.0us.0us 4.0us 5.0us Time K. A. Connor 4 Revised: /0/005
35 ENGR-400 Electronic Instrumentation Fall 000 Fall 000. Combinational Logic A UA 7404 UA U5A UA U6A Q B U4A 74 Which of the following truth tables is correct for this circuit? A B Q A B Q A B Q A B Q A B Q A B Q A B Q A B Q K. A. Connor 5 Revised: /0/005
36 ENGR-400 Electronic Instrumentation Fall 000 Fall 000 solution. Combinational Logic A UA 7404 UA U5A UA U6A Q B U4A 74 Which of the following truth tables is correct for this circuit? A B UA:Y UA:Y UA:Y U5A:Y U4A:Y U6A:Y Answer: the one below is correct A B Q A B Q A B Q A B Q A B Q A B Q A B Q A B Q K. A. Connor 6 Revised: /0/005
37 ENGR-400 Electronic Instrumentation Fall 000 Fall NAND Gate Circuits It is possible to configure all standard gates using just NAND gates. The figure below shows one such combination of NANDs. There are six voltages displayed on the transient voltage plot below. Identify which signal goes with which location. See if you can identify what the overall circuit is equivalent to. (You might want to construct the truth table for this purpose.) Remember that each standard gate comes in two forms, one that performs a particular logical function and one that performs the complement of (or NOT the) function. DSTM CLK DSTM CLK A B UA UA C D UA E U4A Q DSTM: DSTM: UA:Y UA:Y UA:Y U4A:Y 0s.0us.0us.0us 4.0us Time K. A. Connor 7 Revised: /0/005
38 ENGR-400 Electronic Instrumentation Fall 000 Fall 000 Solution 4. NAND Gate Circuits It is possible to configure all standard gates using just NAND gates. The figure below shows one such combination of NANDs. There are six voltages displayed on the transient voltage plot below. Identify which signal goes with which location. See if you can identify what the overall circuit is equivalent to. (You might want to construct the truth table for this purpose.) Remember that each standard gate comes in two forms, one that performs a particular logical function and one that performs the complement of (or NOT the) function. DSTM CLK DSTM CLK A B UA UA C D UA E U4A Q DSTM: DSTM: UA:Y UA:Y UA:Y U4A:Y 0s.0us.0us.0us 4.0us Time Answer : Method - Truth Table DSTM(A) DSTM(B) UA:Y(C) UA:Y(D) UA:Y(E) U4A:Y(Q) This is a NOR GATE Answer: Method Boolean Algebra A B = A B = A + B NOR GATE ~ ~ (~A ~B) = (~A ~B) = ~(A+B) NOR GATE K. A. Connor 8 Revised: /0/005
ENGR-4300 Fall 2008 Test 3. Name SOLUTION. Section 1(MR 8:00) 2(TF 2:00) (circle one) Question I (20 points) Question II (15 points)
ENGR-4300 Fall 008 Test 3 Name SOLUTION Section (MR 8:00) (TF :00) (circle one) Question I (0 points) Question II (5 points) Question III (0 points) Question I (0 points) Question (5 points) Total (00
More informationENGR4300 Fall 2005 Test 3A. Name. Section. Question 1 (25 points) Question 2 (25 points) Question 3 (25 points) Question 4 (25 points)
ENGR4 Test A Fall 5 ENGR4 Fall 5 Test A Name Section Question (5 points) Question (5 points) Question (5 points) Question 4 (5 points) Total ( points): Please do not write on the crib sheets. On all questions:
More informationENGR-2300 Electronic Instrumentation Quiz 3 Fall 2013 Name Section. Question III (25 Points) Question IV (25 Points) Total (100 Points)
ENGR-2300 Electronic Instrumentation Quiz 3 Fall 203 Name Section Question I (25 Points) Question II (25 Points) Question III (25 Points) Question I (25 Points) Total (00 Points) On all questions: SHOW
More informationThe logic is straightforward. Adding two 0s will result in 0. Adding two 1s results in 10 where 1 is the carry bit and 0 is the sum bit.
Adders Half adders Half adders represent the smallest block for adding in digital computers. What they do is very simple: they add two bits, producing a sum and a carry. The logic is straightforward. Adding
More informationENGR4300 Fall 2005 Test 3S. Name solution. Section. Question 1 (25 points) Question 2 (25 points) Question 3 (25 points) Question 4 (25 points)
ENGR400 Test S Fall 005 ENGR400 Fall 005 Test S Name solution Section uestion (5 points) uestion (5 points) uestion (5 points) uestion 4 (5 points) Total (00 points): Please do not write on the crib sheets.
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 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 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 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 informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Chapter 2 - Part 1 2 Chapter 2 - Part 1 3 Chapter 2 - Part 1 4 Chapter 2 - Part
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 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 informationUNIVERSITI TENAGA NASIONAL. College of Information Technology
UNIVERSITI TENAGA NASIONAL College of Information Technology BACHELOR OF COMPUTER SCIENCE (HONS.) FINAL EXAMINATION SEMESTER 2 2012/2013 DIGITAL SYSTEMS DESIGN (CSNB163) January 2013 Time allowed: 3 hours
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 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 informationCHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES
CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES This chapter in the book includes: Objectives Study Guide 7.1 Multi-Level Gate Circuits 7.2 NAND and NOR Gates 7.3 Design of Two-Level Circuits 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 informationCOS 140: Foundations of Computer Science
COS 140: Foundations of Computer Science Boolean Algebra Fall 2018 Introduction 3 Problem................................................................. 3 Boolean algebra...........................................................
More informationExam for Physics 4051, October 31, 2008
Exam for Physics 45, October, 8 5 points - closed book - calculators allowed - show your work Problem : (6 Points) The 4 bit shift register circuit shown in Figure has been initialized to contain the following
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 informationFundamentals of Digital Design
Fundamentals of Digital Design Digital Radiation Measurement and Spectroscopy NE/RHP 537 1 Binary Number System The binary numeral system, or base-2 number system, is a numeral system that represents numeric
More informationDigital Logic. Lecture 5 - Chapter 2. Outline. Other Logic Gates and their uses. Other Logic Operations. CS 2420 Husain Gholoom - lecturer Page 1
Lecture 5 - Chapter 2 Outline Other Logic Gates and their uses Other Logic Operations CS 2420 Husain Gholoom - lecturer Page 1 Digital logic gates CS 2420 Husain Gholoom - lecturer Page 2 Buffer A buffer
More informationChapter 3 Combinational Logic Design
Logic and Computer Design Fundamentals Chapter 3 Combinational Logic Design Part 1- Implementation Technology and Logic Design Overview Part 1-Implementation Technology and Logic Design Design Concepts
More informationCMSC 313 Lecture 17. Focus Groups. Announcement: in-class lab Thu 10/30 Homework 3 Questions Circuits for Addition Midterm Exam returned
Focus Groups CMSC 33 Lecture 7 Need good sample of all types of CS students Mon /7 & Thu /2, 2:3p-2:p & 6:p-7:3p Announcement: in-class lab Thu /3 Homework 3 Questions Circuits for Addition Midterm Exam
More informationOutline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) January 30, 2003 John Wawrzynek Outline Review of three representations for combinational logic:
More informationENGG 1203 Tutorial - 2 Recall Lab 2 - e.g. 4 input XOR. Parity checking (for interest) Recall : Simplification methods. Recall : Time Delay
ENGG 23 Tutorial - 2 Recall Lab 2 - e.g. 4 input XOR Parity checking (for interest) Parity bit Parity checking Error detection, eg. Data can be Corrupted Even parity total number of s is even Odd parity
More informationCS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman
CS 121 Digital Logic Design Chapter 2 Teacher Assistant Hanin Abdulrahman 1 2 Outline 2.2 Basic Definitions 2.3 Axiomatic Definition of Boolean Algebra. 2.4 Basic Theorems and Properties 2.5 Boolean Functions
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 informationIn Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y. Logic Gate. Truth table
Module 8 In Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y Logic Gate Truth table A B Y 0 0 0 0 1 1 1 0 1 1 1 0 In Module 3, we have learned about
More informationZ = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table
Lesson Objectives In this lesson, you will learn about What are combinational circuits Design procedure of combinational circuits Examples of combinational circuit design Combinational Circuits Logic circuit
More informationEE40 Lec 15. Logic Synthesis and Sequential Logic Circuits
EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html
More informationCs302 Quiz for MID TERM Exam Solved
Question # 1 of 10 ( Start time: 01:30:33 PM ) Total Marks: 1 Caveman used a number system that has distinct shapes: 4 5 6 7 Question # 2 of 10 ( Start time: 01:31:25 PM ) Total Marks: 1 TTL based devices
More informationMidterm Examination # 1 Wednesday, February 25, Duration of examination: 75 minutes
Page 1 of 10 School of Computer Science 60-265-01 Computer Architecture and Digital Design Winter 2009 Semester Midterm Examination # 1 Wednesday, February 25, 2009 Student Name: First Name Family Name
More informationEECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) September 5, 2002 John Wawrzynek Fall 2002 EECS150 Lec4-bool1 Page 1, 9/5 9am Outline Review of
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 informationSample Test Paper - I
Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:
More informationNAND, NOR and XOR functions properties
Laboratory NAND, NOR and XOR functions properties. Laboratory work goals Enumeration of NAND, NOR and XOR functions properties Presentation of NAND, NOR and XOR modules Realisation of circuits with gates
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 information11.1 As mentioned in Experiment 10, sequential logic circuits are a type of logic circuit where the output of
EE 2449 Experiment 11 Jack Levine and Nancy Warter-Perez CALIFORNIA STATE UNIVERSITY LOS ANGELES Department of Electrical and Computer Engineering EE-2449 Digital Logic Lab EXPERIMENT 11 SEQUENTIAL CIRCUITS
More informationENG2410 Digital Design Combinational Logic Circuits
ENG240 Digital Design Combinational Logic Circuits Fall 207 S. Areibi School of Engineering University of Guelph Binary variables Binary Logic Can be 0 or (T or F, low or high) Variables named with single
More informationCSC9R6 Computer Design. Practical Digital Logic
CSC9R6 Computer Design Practical Digital Logic 1 References (for this part of CSC9R6) Hamacher et al: Computer Organization App A. In library Floyd: Digital Fundamentals Ch 1, 3-6, 8-10 web page: www.prenhall.com/floyd/
More informationCARLETON UNIVERSITY. X = Y 0 0 X > Y 1 0 X < Y 0 1 never 1 1 happens. Examples
CARLETON UNIVERSITY Deparment of Electronics ELEC 2607 Switching Circuits January 17, 2005 Laboratory 1. Overview; A 4-Bit Binary Comparator X 3 X 2 X 1 X 0 COMPARATOR Y 3 Y 2 Y 1 Y 0 4 DATA BITS LEAST
More informationUC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits
2 Wawrzynek, Garcia 2004 c UCB UC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits 1 Introduction Original document by J. Wawrzynek (2003-11-15) Revised
More informationWEEK 2.1 BOOLEAN ALGEBRA
WEEK 2.1 BOOLEAN ALGEBRA 1 Boolean Algebra Boolean algebra was introduced in 1854 by George Boole and in 1938 was shown by C. E. Shannon to be useful for manipulating Boolean logic functions. The postulates
More informationChapter 2. Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates Basic Definitions A binary operator defined on a set S of elements is a rule that assigns, to each pair of elements from S, a unique element from S. The most common
More informationLecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions
EE210: Switching Systems Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions Prof. YingLi Tian Feb. 15, 2018 Department of Electrical Engineering The City College of New York The
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 informationLecture (02) NAND and NOR Gates
Lecture (02) NAND and NOR Gates By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU : Spring 2018, CSE303 Logic design II NAND gates and NOR gates In this section we will define NAND and NOR gates. Logic
More informationUnit 2 Session - 6 Combinational Logic Circuits
Objectives Unit 2 Session - 6 Combinational Logic Circuits Draw 3- variable and 4- variable Karnaugh maps and use them to simplify Boolean expressions Understand don t Care Conditions Use the Product-of-Sums
More informationThis form sometimes used in logic circuit, example:
Objectives: 1. Deriving of logical expression form truth tables. 2. Logical expression simplification methods: a. Algebraic manipulation. b. Karnaugh map (k-map). 1. Deriving of logical expression from
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 informationLogic Gates - Introduction
Logic Gates - Introduction Page 1 Overview Introduction Page 2 Digital Design underpins the creation of the myriad of imaginative digital devices that surround us Computers Calculators Phones Digital watches
More informationLab 3 Revisited. Zener diodes IAP 2008 Lecture 4 1
Lab 3 Revisited Zener diodes R C 6.091 IAP 2008 Lecture 4 1 Lab 3 Revisited +15 Voltage regulators 555 timers 270 1N758 0.1uf 5K pot V+ V- 2N2222 0.1uf V o. V CC V Vin s = 5 V Vc V c Vs 1 e t = RC Threshold
More informationMODULAR CIRCUITS CHAPTER 7
CHAPTER 7 MODULAR CIRCUITS A modular circuit is a digital circuit that performs a specific function or has certain usage. The modular circuits to be introduced in this chapter are decoders, encoders, multiplexers,
More informationWeek-I. Combinational Logic & Circuits
Week-I Combinational Logic & Circuits Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other logic operators IC families and
More informationChapter 2: Switching Algebra and Logic Circuits
Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used
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 informationEECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive
EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive March 30, 2010 John Wawrzynek Spring 2010 EECS150 - Lec19-cl1 Page 1 Boolean Algebra I (Representations of Combinational
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 informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More informationDigital Electronics Final Examination. Part A
Digital Electronics Final Examination Part A Spring 2009 Student Name: Date: Class Period: Total Points: /50 Converted Score: /40 Page 1 of 13 Directions: This is a CLOSED BOOK/CLOSED NOTES exam. Select
More informationCSE 140 Midterm I - Solution
CSE 140 Midterm I - Solution 1. Answer the following questions given the logic circuit below. (15 points) a. (5 points) How many CMOS transistors does the given (unsimplified) circuit have. b. (6 points)
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 information2. Associative Law: A binary operator * on a set S is said to be associated whenever (A*B)*C = A*(B*C) for all A,B,C S.
BOOLEAN ALGEBRA 2.1 Introduction Binary logic deals with variables that have two discrete values: 1 for TRUE and 0 for FALSE. A simple switching circuit containing active elements such as a diode and transistor
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 informationCS61c: Representations of Combinational Logic Circuits
CS61c: Representations of Combinational Logic Circuits J. Wawrzynek March 5, 2003 1 Introduction Recall that synchronous systems are composed of two basic types of circuits, combination logic circuits,
More informationReview Getting the truth table
Digital Circuits Review Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every input combination, figure out what an output bit should
More informationSchedule. ECEN 301 Discussion #25 Final Review 1. Date Day Class No. 1 Dec Mon 25 Final Review. Title Chapters HW Due date. Lab Due date.
Schedule Date Day Class No. Dec Mon 25 Final Review 2 Dec Tue 3 Dec Wed 26 Final Review Title Chapters HW Due date Lab Due date LAB 8 Exam 4 Dec Thu 5 Dec Fri Recitation HW 6 Dec Sat 7 Dec Sun 8 Dec Mon
More informationWORKBOOK. Try Yourself Questions. Electrical Engineering Digital Electronics. Detailed Explanations of
27 WORKBOOK Detailed Eplanations of Try Yourself Questions Electrical Engineering Digital Electronics Number Systems and Codes T : Solution Converting into decimal number system 2 + 3 + 5 + 8 2 + 4 8 +
More informationFloating Point Representation and Digital Logic. Lecture 11 CS301
Floating Point Representation and Digital Logic Lecture 11 CS301 Administrative Daily Review of today s lecture w Due tomorrow (10/4) at 8am Lab #3 due Friday (9/7) 1:29pm HW #5 assigned w Due Monday 10/8
More informationBOOLEAN ALGEBRA TRUTH TABLE
BOOLEAN ALGEBRA TRUTH TABLE Truth table is a table which represents all the possible values of logical variables / statements along with all the possible results of the given combinations of values. Eg:
More informationImplementation of Boolean Logic by Digital Circuits
Implementation of Boolean Logic by Digital Circuits We now consider the use of electronic circuits to implement Boolean functions and arithmetic functions that can be derived from these Boolean functions.
More informationBoolean Algebra, Gates and Circuits
Boolean Algebra, Gates and Circuits Kasper Brink November 21, 2017 (Images taken from Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc.) Outline Last week: Von
More informationNew Students Day Activity
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
More information3. Complete the following table of equivalent values. Use binary numbers with a sign bit and 7 bits for the value
EGC22 Digital Logic Fundamental Additional Practice Problems. Complete the following table of equivalent values. Binary. Octal 35.77 33.23.875 29.99 27 9 64 Hexadecimal B.3 D.FD B.4C 2. Calculate the following
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 informationTotal Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18
University of Waterloo Department of Electrical & Computer Engineering E&CE 223 Digital Circuits and Systems Midterm Examination Instructor: M. Sachdev October 23rd, 2007 Total Time = 90 Minutes, Total
More informationBoolean Algebra and Logic Gates
Boolean Algebra and Logic Gates ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2017 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines Basic
More informationChapter 4 BOOLEAN ALGEBRA AND THEOREMS, MINI TERMS AND MAX TERMS
Chapter 4 BOOLEAN ALGEBRA AND THEOREMS, MINI TERMS AND MAX TERMS Lesson 4 BOOLEAN EXPRESSION, TRUTH TABLE and SUM OF THE PRODUCTS (SOPs) [MINITERMS] 2 Outline SOP two variables cases SOP for three variable
More informationCover Sheet for Lab Experiment #3
The University of Toledo EECS:1100 R2 Digital Logic Design Dr. Anthony D. Johnson Cover Sheet for Lab Experiment #3 Student Names Course Section Anthony Phillips 003 Alexander Beck 003 Report turned in
More informationUniversity of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences EECS151/251A V. Stojanovic, J. Wawrzynek Fall 2015 10/13/15 Midterm Exam Name: ID
More informationUniversity of Toronto Faculty of Applied Science and Engineering Department of Electrical and Computer Engineering Midterm Examination
University of Toronto Faculty of Applied Science and Engineering Department of Electrical and Computer Engineering Midterm Eamination ECE 241F - Digital Systems Wednesday October 11, 2006, 6:00 7:30 pm
More informationChapter 2: Boolean Algebra and Logic Gates
Chapter 2: Boolean Algebra and Logic Gates Mathematical methods that simplify binary logics or circuits rely primarily on Boolean algebra. Boolean algebra: a set of elements, a set of operators, and a
More informationLogic Design. Chapter 2: Introduction to Logic Circuits
Logic Design Chapter 2: Introduction to Logic Circuits Introduction Logic circuits perform operation on digital signal Digital signal: signal values are restricted to a few discrete values Binary logic
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 4 Following the slides of Dr. Ahmed H. Madian محرم 439 ه Winter 28
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 informationUnit 2 Boolean Algebra
Unit 2 Boolean Algebra 2.1 Introduction We will use variables like x or y to represent inputs and outputs (I/O) of a switching circuit. Since most switching circuits are 2 state devices (having only 2
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 informationUnit 2 Boolean Algebra
Unit 2 Boolean Algebra 1. Developed by George Boole in 1847 2. Applied to the Design of Switching Circuit by Claude Shannon in 1939 Department of Communication Engineering, NCTU 1 2.1 Basic Operations
More informationChapter 2: Princess Sumaya Univ. Computer Engineering Dept.
hapter 2: Princess Sumaya Univ. omputer Engineering Dept. Basic Definitions Binary Operators AND z = x y = x y z=1 if x=1 AND y=1 OR z = x + y z=1 if x=1 OR y=1 NOT z = x = x z=1 if x=0 Boolean Algebra
More informationBinary Logic and Gates. Our objective is to learn how to design digital circuits.
Binary Logic and Gates Introduction Our objective is to learn how to design digital circuits. These circuits use binary systems. Signals in such binary systems may represent only one of 2 possible values
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 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 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 informationLecture 22 Chapters 3 Logic Circuits Part 1
Lecture 22 Chapters 3 Logic Circuits Part 1 LC-3 Data Path Revisited How are the components Seen here implemented? 5-2 Computing Layers Problems Algorithms Language Instruction Set Architecture Microarchitecture
More informationPhiladelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2017/2018 Dept. of Computer Engineering Course Title: Logic Circuits Date: 29/01/2018
More information6 Simplification of. Boolean Functions
6 Simplification of Boolean Functions This experiment demonstrates the relationship between a Boolean function and the corresponding logic diagram. The Boolean functions and their complements are simplified
More informationDigital Logic Design. Combinational Logic
Digital Logic Design Combinational Logic Minterms A product term is a term where literals are ANDed. Example: x y, xz, xyz, A minterm is a product term in which all variables appear exactly once, in normal
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 information