De Morgan s second theorem: The complement of a product is equal to the sum of the complements.
|
|
- Bertram Cross
- 5 years ago
- Views:
Transcription
1 Q. What is Gate? State and prove De Morgan s theorems. nswer: digital circuit having one or more input signals but only one output signal is called a gate. De Morgan s first theorem: The complement of a sum is equal to the product of the complements.. Proof: We know from oolean lgebra X X, X. X, X YZ ( X Y )( X Z) Let P and Q. P Q ( ) (. ) ( )( ) [ X YZ ( X Y )( X Z)] ( )( ). Therefore, Q P.. OR P. Q ( )..... Therefore, Q P.. De Morgan s second theorem: The complement of a product is equal to the sum of the complements.. Proof: We know from oolean lgebra X X, X. X, X YZ ( X Y )( X Z) Let P and Q P Q Q P ( ) ( )( ) ( )( ). Therefore, Q P OR P. Q.( ).. Therefore, Q P Q2. Differentiate analog and digital signals. nswer: nalog signals are continuous and all possible values are considered. In the figure below, temperature is measured for water in a container which is heated for particular duration at all possible instant of time as a continuous signal. Digital signal are only finite values at particular interval. In the figure below, temperature is measured for water in a container which is heated for particular duration at discrete interval of time as a digital signal. Page:
2 Temp (Centigrate) 6 4 Continuous Signal Temp (Centigrate) 6 4 Digital Siganal t (min.) 3 6 t (min.) Q3. Define (i) rise time (ii)fall time (iii)period (iv) frequency (v) duty cycle of a digital signal. nswer: (i) Rise Time: It is defined as the time required for a signal to rise from its low level to its high level. Rise Time is measured as the time required between. L and.9h as shown in the figure. For example, suppose H=4V and L=2V, then.l=2.2v and.9h=3.6v. (ii) Fall Time: It is defined as the time required for a signal to fall from its high level to its low level. Fall Time measured is as the time required between.9h and.l as shown in the figure.. volt H.9H.L L t(sec) t f t r Page: 2
3 (iii) Period (T): Time required to complete one high and one low. s shown in the figure, t H is the time required to complete one high and t L is the time required to complete one low. T=t H +t L (iv) Frequency (f): Frequency is the reciprocal of the time period. f=/t t (v) Duty Cycle: Duty cycle H= H t and Duty cycle L= L T T Duty cycle H is the ratio of time the signal is high to the time period. Duty cycle L is the ratio of time the signal is low to the time period. T H t H t L L Q4. (i) Prove that duty cycle of a symmetrical waveform is 5%. (ii) What is the value of high duty cycle (duty cycle H) if the frequency of a digital waveform is 5 MHz and the width of the positive pulse is.5 µs? (iii) n asymmetrical signal waveform is high for 2ms and low for 3ms. Find Frequency, Period, Duty cycle low, Duty cycle high nswer: For a symmetrical waveform, High period is T/2 and the Low period is T/2 where T is the time period. T T (i) Therefore, Duty Cycle H= 2 % 5% and Duty Cycle L= T 2 % 5% T ( ii) f 5 MHz Perriod, T =.2 s 6 f 5 Width of the high pulse.5 s t Duty cycle H.5 %=25%.2 ( iii) t Width of high signal 2 ms and t Width of low signal 3ms H Period, T t t 2 3 5ms H L Frequency, f 2Hz 3 T 5 tl 3ms Duty cycle low % 6% T 5 ms th 2ms Duty cycle high % 4% T 5ms L Page: 3
4 Q5. Describe positive logic and negative logic. List the equivalences in positive and negative logic. nswer: If a binary stands for low voltage and a binary stands for high voltage, then this is called positive logic. If a binary stands for low voltage and a binary stands for high voltage, then this is called negative logic. Let us consider the table below as an example: Y LOW LOW LOW LOW HIGH HIGH HIGH LOW HIGH HIGH HIGH HIGH If we use positive logic, the above table is converter to: Y This is the truth table for OR Gate If we negative logic, the same table is converted to: Y This is the truth table for ND Gate Therefore, positive OR negative ND Following are the equivalences in positive and negative logic: Positive OR Negative ND Positive ND Negative OR Positive NOR Negative NND Positive NND Negative NOR Q6. Prove that (a) Positive OR logic is equal to Negative ND logic (b) Positive ND logic is equal to Negative OR logic (c) Positive NOR logic is equal to Negative NND logic (d) Positive NND logic is equal to Negative NOR logic nswer: (a) Let us consider the table below: Y LOW LOW LOW LOW HIGH HIGH HIGH LOW HIGH HIGH HIGH HIGH Page: 4
5 If we use positive logic, the above table is converter to: Y This is the truth table for OR Gate If we negative logic, the same table is converted to: Y This is the truth table for ND Gate Therefore, Positive OR logic is equal to Negative ND logic: (b) : (a) Let us consider the table below: Y LOW LOW LOW LOW HIGH LOW HIGH LOW LOW HIGH HIGH HIGH If we use positive logic, the above table is converter to: Y This is the truth table for ND Gate If we negative logic, the same table is converted to: Y This is the truth table for OR Gate Therefore, Positive ND logic is equal to Negative OR logic (c) (a) Let us consider the table below: Y LOW LOW HIGH LOW HIGH LOW HIGH LOW LOW HIGH HIGH LOW Page: 5
6 If we use positive logic, the above table is converter to: Y This is the truth table for NOR Gate If we negative logic, the same table is converted to: Y This is the truth table for NND Gate Therefore, Positive NOR logic is equal to Negative NND (d) ) Let us consider the table below: Y LOW LOW HIGH LOW HIGH HIGH HIGH LOW HIGH HIGH HIGH LOW If we use positive logic, the above table is converter to: Y This is the truth table for NND Gate If we negative logic, the same table is converted to: Y This is the truth table for NOR Gate Therefore, Positive NND logic is equal to Negative NOR logic Q7. What is a universal gate? List the universal gates and prove their universalities. nswer: universal gate is a gate that can be used to realize any other gate and therefore, a universal gate can be used to realize any oolean function without using any other gate. Universal gates are NOR gate and NND gate. Page: 6
7 Proof of NND gate as universal gate: ny oolean function can be implemented using NOT gate, ND gate and OR gate. Therefore, if NOT gate, ND gate and OR gate are implemented using NND gate only, then it will be proved that NND gate is a universal gate. Implementing NOT using NND gate Implementing of ND gate using NND gates.. =. Implementing OR using NND gate.=+=+ Proof of NOR gate as universal gate: ny oolean function can be implemented using NOT gate, ND gate and OR gate. Therefore, if NOT gate, ND gate and OR gate are implemented using NOR gate only, then it will be proved that NOR gate is a universal gate. Page: 7
8 Implementing NOT using NOR gate Implementing of OR gate using NOR gates + += + Implementing ND using NOR gates + =.=. Q8. Realize the XOR gate using (i) NND gate (ii) NOR gate. nswer: (i) The following figure shows the realization of XOR gate with NND gates:... Y=(..).(..).. Y (.. ).(.. ) ( ).( ).. Page: 8
9 (ii)the following figure shows the realization of XOR gate with NOR gates: + Y=+++ + Y ( ).( ) ( ).( ) lternately, ++ + Y=+++++ Y= Y...( ).( ).. Q9. Implement the following functions using NND gate only: (i) (( ). C) (ii) Y (( ). C). D (iii) (( ).( )) nswer: (i).=+ + +.C +.C (ii) C + (+).C ((+).C).D ((+).C).D C D Page: 9
10 (iii) ( ).( )..... Y=..+.. =+ +.. Q. Implement the following functions using NOR gate only: (i) (( ). C) (ii) Y (( ). C). D (iii) (( ).( )) nswer: (i) + +=+ (+).C C C (ii) + (+).C ((+).C).D C C D D (iii) ( ).( ) Y=+++++ =+ ++ Y.( ).( ).( ).( ).. Page:
11 Q. Define canonical Minterm form and canonical Maxterm form. nswer: Minterm: minterm, denoted by m i, i<2 n, is a product of n variables in which each variable is complemented if the value assigned to it is. Let us consider a oolean function F f ( x, y, z) x yz xy z xyz xyz. Truth table of the above function along with the minterms is shown below: x y z Minterm F m =x y z m = x y z m 2 = x yz m 3 = x yz m 4 = xy z m 5 = xy z m 6 = xyz m 7 = xyz The above function can be expressed in term of minterms as F=m 3 +m 5 +m 6 +m 7 =Σm(3,5,6,7) The inverse of the function can be expressed as F = Σm(,,2,4) Maxterm: maxterm, denoted by M i, i <2 n, is a sum of n variables in which each variable is complemented if the value assigned to it is. Let us consider a oolean function F f ( x, y, z) ( x y z)( x y z )( x y z)( x y z) Truth table of the above function along with maxterm is shown below: x y z Maxterm F M =x+y+z M = x+y+z M 2 = x+y +z M 3 = x+y +z M 4 = x +y+z M 5 = x +y+z M 6 = x +y +z M 7 = x +y +z The above function can be expressed in term of maxterms as F=M.M.M 2.M 4 =ΠM(,,2,4) The inverse of the function can be expressed as F = ΠM(3,5,6,7).Q2. Express the function F=x+yz as the sum of its minterms and product of maxterms. nswer : F x yz x( y y )( z z ) yz( x x ) xyz xyz xy z xy z xyz x yz F xyz xyz xy z xy z x yz m7 m6 m5 m4 m3 m(3,4,5,6,7) gain, F x yz ( x y)( x z) ( x y zz )( x z yy ) F ( x y z)( x y z )( x z y)( x z y ) ( x y z)( x y z )( x y z) M. M. M M (,, 2) 2 Page:
12 Q3. Express the function F=(x+yz) as the sum of its minterms and product of maxterms. nswer : F ( x yz) ( x ( yz)) x.( yz) x.( y z ) x y x z x y ( z z ) x z ( y y ) F x y z x y z x yz x y z x y z x y z x yz m m m2 m(,, 2) gain, F ( x yz) ( x ( yz)) x.( yz) x.( y z ) ( x yy zz )( y z xx ) F ( x yy z)( x yy z )( y z x)( y z x ) F ( x y z)( x y z)( x y z )( x y z )( x y z )( x y z ) F ( x y z)( x y z)( x y z )( x y z )( x y z ) F M. M. M. M. M M (3,4,5,6,7) Q4, Convert the following 3-variable SOP to POS form. (i) Σm(3,5,6,7) (ii) Σm(,2,5,6) nswer: (i) Σm(3,5,6,7)=ΠM(,,2,4) (ii) Σm(,2,5,6)=ΠM(,3,4,7) Q5. Convert the following 4-variable POS to SOP form. (i) ΠM(,3,4,7) (ii) ΠM(,,2,4,,3,5) nswer: (i) ) ΠM(,3,4,7)=Σm(,2,5,6,8,9,,,2,3,4,5) (ii) ΠM(,,2,4,,3,5)=Σ(3,5,6,7,8,9,,2,4) Q6. Use K-Map to simplify the following functions: ( i) f (,, C, D) m(, 2,6,,,2,3) d(3,4,5,4,5) ( ii) f m(, 2, 6, 7,8,3,4,5) d(3,5,2) ( iii) f m(,3, 4,5,3,5) d(8,9,,) ( iv) f (,, C, D) ( C)( D)( C)( C) ( v) f (,, C, D) (, 2, 4,5,7,8,,,3, 4) nswer: (i) CD X X X X X f (,, C, D) CD C D Page: 2
13 (ii)let us consider the variables as,, C and D. CD X X X f (,, C, D) D C CD (iii) Let us consider the variables as,, C and D. CD X X X X f (,, C, D) D D C ( iv) f (,, C, D) ( C)( D)( C)( C) ( C D)( C D)( C D)( C D)( C D)( C D) ( C D)( C D)( C D)( C D)( C D)( C D) ( C D)( C D) M 3. M 2. M5. M3. M 7. M 5. M2. M 9. M 8. M. M M. M. M 2. M 3. M 5. M 7. M 8. M 9. M2. M3. M5 Page: 3
14 CD (v) CD f (,, C, D) ( )( C D)( D)( C) f ( C)( D)( C D)( C D)( C)( C D)( D)( C D) Q7, Simplify the Product of Sum expression below and provide the result in POS form. F(,, C, D) ( C D)( C D)( C D)( C D)( C D) ( C D)( C D) Page: 4
15 nswer: CD (+C+D) ++C+D ++C+D ++C+D ++C+D ++C+D ++C+D (C+D) +C+D ++C+D Therefore, the result in POS, F ( C D)( C D)( C D) Q8. Simplify the Product Of Sum expression below and provide the result in SOP form. F(,, C, D) ( C D)( C D)( C D)( C D)( C D) ( C D)( C D) nswer: CD Therefore, the result in SOP, F C D CD D Page: 5
16 Q9. Find the minimal SOP and minimal POS of the following oolean function using K-Map. f ( a, b, c, d) m(6,7,9,,3) d(, 4,5,) nswer: ab cd X X X X ab Minimal SOP is given by f ( a, b, c, d) ab cd abc cd X X X X Minimal POS is given by f ( a, b, c, d) ( a b)( c d)( a b c) Q2. Reduce the following oolean function using K-Map and realize the simplified expression using NND gates. T f ( a, b, c, d) m(,3, 4,5,3,5) d(8,9,,) Page: 6
17 nswer: ab cd X X X X T f ( a, b, c, d) cd ad bd abc Following diagram shows the realization of the above expression with NND gates a b c d T Page: 7
18 Q2. Simplify the following expressions using Karnaugh map. Implement the simplified circuit using the gates as indicated: ( i) f ( w, x, y, z) m(,5, 7,9,,3,5) d(8,,4) using NND gates. (ii) f (,, C, D) M (,, 2, 4,5, 6,8,9,2,3,4) using NOR gates. nswer: (i) wx yz X X X f ( w, x, y, z) yz wx xz Following is the implementation of the simplified circuit with NND gates. w x y z f Page: 8
19 (ii) CD f (,, C, D) C( D)( D) Following is the implementation of the simplified circuit with NOR gates. C D +D (+D)(+D) (+D)(+D) +D C f Page: 9
20 Q22. Simplify the following using Quine McClusky minimization technique: ( i) P f ( w, x, y, z) m(7,9,2,3,4,5) d(4,) ( ii) Y f ( a, b, c, d) (,, 2, 6, 7,9,,2) d(3,5). Verify the result using K-map. ( iii) f (,, C, D) m(,,2,3,,,2,3,4,5) ( iv) f ( W, X, Y, Z) m(,3,6,7,8,9,,2,3,4) nswer: (i) f(w,x,y,z)=σm(7,9,2,3,4,5)+d(4,) Stage Stage 2 Stage 3 wxyz wxyz wxyz (4) (9) (2) (7) ) (3) (4) (5) (4,2) (9,) (9,3) (2,3) (2,4) (7,5) (,5) (3,5) (4,5) (9,,3,5) (9,3,,5) (2,3,4,5) (2,4,3,5) wz (9,,3,5) wx (2,3,4,5) xy z (4,2) xyz (7,5) P f ( w, x, y, z) wz wx xyz Page: 2
21 Verification: yz wx X X P f ( w, x, y, z) wz wx xyz (ii) Y=f(a,b,c,d)=Σm(,,2,6,7,9,,2)+d(3,5) Stage Stage 2 Stage 3 abcd abcd abcd () () (2) (3) (5) (6) (9) () (2) (7) (,) (,2) (,3) (,5) (,9) (2,3) (2,6) (2,) (3,7) (5,7) (6,7) (,,2,3) (,2,,3) (,3,5,7) (,5,3,7) (2,3,6,7) (2,6,3,7) Page: 2
22 abc d (2) b c d(,9) b cd (2,) a b (,,2,3) a d(,3,5,7) a c(2,3,6,7) Y= abc d + b c d + b cd + a b + a c Verification: ab cd X X Y= abc d + b c d + b cd + a b + a c Page: 22
23 (iii) f(,,c,d)=σm(,,2,3,,,2,3,4,5) Stage Stage 2 Stage 3 CD CD CD () () (2) - - (,) (,2) (3) () (2) () (3) (4) (5) (,3) (2,3) (2,) (3,) (,) (,4) (2,3) (2,4) (,5) (3,5) (4,5) (,,2,3) (,2,,3) (2,3,,) (2,,3,) (,,4,5) (,4,,5) (2,3,4,5) (2,4,3,5) (,, 2,3) C(2,3,,) C (,,4,5) (2,3,4,5) f (,, C, D) C or f (,, C, D) C Verification: CD f (,, C, D) C Page: 23
24 (iv) f(w,x,y,z)=σm(,3,6,7,8,9,,2,3,4) Stage Stage 2 Stage 3 WXYZ WXYZ WXYZ () (8) (3) (6) (9) () (2) (7) (3) (4) (,3) (,9) (8,9) (8,) (8,2) (3,7) (6,7) (6,4) (9,3) (,4) (2,3) (2,4) (8,9,2,3) (8,,2,4) (8,2,,4) W X Z(,3) X Y Z(,9) W YZ(3,7) W XY (6,7) XYZ (6,4) WY Z (9,3) WY (8,9,2,3) WZ (8,,2,4) f ( W, X, Y, Z) W X Z W XY WY WZ Page: 24
25 Verification: WX YZ f ( W, X, Y, Z) W X Z W XY WY WZ Q23. What are static hazards? How to design a hazard free circuit? Explain with an example. nswer: When the input to a combinational circuit changes, unwanted switching transients may appear in the output. These transients occurs when different paths from input to output have different propagation delays. Static- hazard: This type of hazard occurs when makes a transition. Y type situation appears for a logic circuit and T =NOT gate delay Y T T 2 =OR gate delay Y T 2 n condition should always generate at the output i.e static-. ut the NOT gate output takes finite time to become following transition of. Thus for the OR gate there are two zeros appears at the input for that small duration resulting a at the output. The width of this zero is in nanosecond order and is called glitch. Designing static- hazard free circuit: Page: 25
26 C C C Y The karnaugh map shown above represented by Y C C Consider the circuit input = and = and then C makes transition. The output shows glitches. Now, consider the following grouping: C C C Y The above circuit includes one additional and from glitches. Static--hazard: Y C C. The additional ensures free This type of hazard occurs when Y kind of situation occurs in a logic circuit and makes a transition. condition should always generate at the output i.e static-. ut the NOT gate output takes finite time to become following a transition of. Thus for final ND gate there are two ones appearing at the inputs for small duration resulting a at its output. Page: 26
27 Y T T =NOT gate delay T 2 =ND gate delay T 2 Y The circuit below is with static- hazard: C Y Consider the circuit input = and = and then C makes transition. The output shows glitches. The circuit below is static- hazard free Y C Page: 27
Odd-Prime Number Detector The table of minterms is represented. Table 13.1
Odd-Prime Number Detector The table of minterms is represented. Table 13.1 Minterm A B C D E 1 0 0 0 0 1 3 0 0 0 1 1 5 0 0 1 0 1 7 0 0 1 1 1 11 0 1 0 1 1 13 0 1 1 0 1 17 1 0 0 0 1 19 1 0 0 1 1 23 1 0 1
More informationCHAPTER 3 BASIC & COMBINATIONAL LOGIC CIRCUIT
CHAPTER 3 BASIC & COMBINATIONAL LOGIC CIRCUIT CHAPTER CONTENTS 3.1 Introduction to Basic Gates 3.2 Analysing A Combinational Logic Circuit 3.3 Design A Combinational Logic Circuit From Boolean Expression
More informationSubject: Analog and Digital Electronics Code:15CS32
Subject: Analog and Digital Electronics Code:15CS32 Syllabus: The Basic Gates : Review of Basic Logic gates, Positive and Negative Logic, Introduction to HDL. Combinational Logic Circuits:Sum-of-Products
More informationEECS 150 Homework 4 Solutions Fall 2008
Problem 1: You have a 100 MHz clock, and need to generate 3 separate clocks at different frequencies: 20 MHz, 1kHz, and 1Hz. How many flip flops do you need to implement each clock if you use: a) a ring
More informationChapter 3 Digital Logic Structures
Chapter 3 Digital Logic Structures Transistor: Building Block of Computers Microprocessors contain millions of transistors Intel Pentium 4 (2): 48 million IBM PowerPC 75FX (22): 38 million IBM/Apple PowerPC
More informationUniversity of Technology
University of Technology Lecturer: Dr. Sinan Majid Course Title: microprocessors 4 th year Lecture 7 & 8 NAND and XOR Implementations Combinational Design Procedure NAND-NAND & NOR-NOR Networks DeMorgan
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd hapter 5 Floyd, Digital Fundamentals, th ed 28 Pearson Education 29 Pearson Education, Upper Saddle River, NJ 7458. ll Rights Reserved ombinational Logic ircuits
More informationECE380 Digital Logic
ECE38 Digital Logic Optimized Implementation of Logic Functions: Karnaugh Maps and Minimum Sum-of-Product Forms Dr. D. J. Jackson Lecture 7- Karnaugh map The key to finding a minimum cost SOP or POS form
More informationEE260: Digital Design, Spring n More Logic Gates n NAND and NOR Gates
EE26: igital esign, Spring 28 -eb-8 EE 26: Introduction to igital esign oolean lgebra: Logic Synthesis and Timing Hazards ao Zheng epartment of Electrical Engineering University of Hawaiʻi at Mānoa Overview
More information6.1 In this section, you will design (but NOT build) a circuit with 4 inputs,
EE 2449 Experiment 6 Jack Levine and Nancy Warter-Perez //208 CALIFORNIA STATE UNIVERSITY LOS ANGELES Department of Electrical and Computer Engineering EE-2449 Digital Logic Lab EXPERIMENT 6 COMBINATIONAL
More informationAnalysis procedure. To obtain the output Boolean functions from a logic diagram, proceed as follows:
Combinational Logic Logic circuits for digital systems may be combinational or sequential. combinational circuit consists of input variables, logic gates, and output variables. 1 nalysis procedure To obtain
More informationUNIT-2: BOOLEAN EXPRESSIONS AND COMBINATIONAL LOGIC CIRCUITS
UNIT-2: BOOLEAN EXPRESSIONS AND COMBINATIONAL LOGIC CIRCUITS STRUCTURE 2. Objectives 2. Introduction 2.2 Simplification of Boolean Expressions 2.2. Sum of Products 2.2.2 Product of Sums 2.2.3 Canonical
More informationDEPARTMENT OF ELETRONICS AND COMMUNICATION ENGINEERING COURSE NOTES FACULTY NAME/DESIGNATION: SUGAPRIYAA.THA / LECTURER
DEPARTMENT OF ELETRONICS AND COMMUNICATION ENGINEERING COURSE NOTES SUBJECT: DIGITAL ELECTRONICS SUBJECT CODE: EC2203 FACULTY NAME/DESIGNATION: SUGAPRIYAA.THA / LECTURER CLASS: II YEAR ECE UNIT-I MINIMISATION
More informationCombinational Logic Design CH002
Combinational Logic Design CH002 Figure 2.1 Circuit as a black box with inputs, outputs, and specifications Figure 2.2 Elements and nodes Figure 2.3 Combinational logic circuit Figure 2.4 Two OR implementations
More informationAsst. Prof. Thavatchai Tayjasanant, PhD. Power System Research Lab 12 th Floor, Building 4 Tel: (02)
2145230 Aircraft Electricity and Electronics Asst. Prof. Thavatchai Tayjasanant, PhD Email: taytaycu@gmail.com aycu@g a co Power System Research Lab 12 th Floor, Building 4 Tel: (02) 218-6527 1 Chapter
More informationLogic Symbols with Truth Tables INVERTER A B NAND A B C NOR C A B A B C XNOR A B C A B Digital Logic 1
Slide Logic Symbols with Truth Tables UFFER INVERTER ND NND OR NOR XOR XNOR 6.7 Digital Logic Digital logic can be described in terms of standard logic symbols and their corresponding truth tables. The
More informationDigital. Design. R. Ananda Natarajan B C D
Digital E A B C D 0 1 2 3 4 5 6 Design 7 8 9 10 11 12 13 14 15 Y R. Ananda Natarajan Digital Design Digital Design R. ANANDA NATARAJAN Professor Department of Electronics and Instrumentation Engineering
More information(a) (b) (c) (d) (e) (a) (b) (c) (d) (e)
Exercises 97 Exercises Exercise 2. Write a oolean equation in sum-of-products canonical form for each of the truth tables in Figure 2.8. (d) (e) C C C D Figure 2.8 Truth tables for Exercises 2. and 2.3
More informationDigital Circuits Introduction
Lecture #6 OUTLINE Logic inary representations Combinatorial logic circuits Chap 7-7.5 Reading EE4 Summer 25: Lecture 6 Instructor: Octavian lorescu Digital Circuits Introduction nalog: signal amplitude
More informationCS302 Digital Logic Design Solved Objective Midterm Papers For Preparation of Midterm Exam
CS302 Digital Logic Design Solved Objective Midterm Papers For Preparation of Midterm Exam MIDTERM EXAMINATION 2011 (October-November) Q-21 Draw function table of a half adder circuit? (2) Answer: - Page
More informationDr. Nicola Nicolici COE/EE2DI4 Midterm Test #1 Oct 18, 2006
COE/EE2DI4 Midterm Test #1 Fall 2006 Page 1 Dr. Nicola Nicolici COE/EE2DI4 Midterm Test #1 Oct 18, 2006 Instructions: This examination paper includes 10 pages and 20 multiple-choice questions starting
More informationCombinational logic. ! Regular logic: multiplexers, decoders, LUTs and FPGAs. ! Switches, basic logic and truth tables, logic functions
Combinational logic! Switches, basic logic and truth tables, logic functions! Algebraic expressions to gates! Mapping to different gates! Discrete logic gate components (used in labs and 2)! Canonical
More informationTime: 3 hours Max. Marks: 70 Answer any FIVE questions All questions carry equal marks
Code: 9A02401 PRINCIPLES OF ELECTRICAL ENGINEERING (Common to EIE, E.Con.E, ECE & ECC) Time: 3 hours Max. Marks: 70 1 In a series RLC circuit, R = 5 Ω, L = 1 H and C = 1 F. A dc v ltage f 20 V is applied
More informationName: Class: Date: 1. As more electronic systems have been designed using digital technology, devices have become smaller and less powerful.
Name: Class: Date: DE Midterm Review 2 True/False Indicate whether the statement is true or false. 1. As more electronic systems have been designed using digital technology, devices have become smaller
More informationDIGITAL ELECTRONICS: LOGIC AND CLOCKS
DIGITL ELECTRONICS: LOGIC ND CLOCKS L 9 INTRO: INTRODUCTION TO DISCRETE DIGITL LOGIC, MEMORY, ND CLOCKS GOLS In this experiment, we will learn about the most basic elements of digital electronics, from
More informationECE 172 Digital Systems. Chapter 2 Digital Hardware. Herbert G. Mayer, PSU Status 6/30/2018
ECE 172 Digital Systems Chapter 2 Digital Hardware Herbert G. Mayer, PSU Status 6/30/2018 1 Syllabus l Term Sharing l Standard Forms l Hazards l Decoders l PLA vs. PAL l PROM l Bibliography 2 Product Term
More informationDigital Logic Circuits
Digital Logic Circuits Let s look at the essential features of digital logic circuits, which are at the heart of digital computers. Learning Objectives Understand the concepts of analog and digital signals
More informationFunction Table of an Odd-Parity Generator Circuit
Implementation of an Odd-Parity Generator Circuit The first step in implementing any circuit is to represent its operation in terms of a Truth or Function table. The function table for an 8-bit data as
More informationChapter 2 Combinational Circuits
Chapter 2 Combinational Circuits SKEE2263 Digital Systems Mun im/ismahani/izam {munim@utm.my,e-izam@utm.my,ismahani@fke.utm.my} February 23, 26 Why CMOS? Most logic design today is done on CMOS circuits
More informationNumber system: the system used to count discrete units is called number. Decimal system: the number system that contains 10 distinguished
Number system: the system used to count discrete units is called number system Decimal system: the number system that contains 10 distinguished symbols that is 0-9 or digits is called decimal system. As
More informationModule 4: Design and Analysis of Combinational Circuits 1. Module-4. Design and Analysis of Combinational Circuits
1 Module-4 Design and Analysis of Combinational Circuits 4.1 Motivation: This topic develops the fundamental understanding and design of adder, substractor, code converter multiplexer, demultiplexer etc
More informationIn this lecture: Lecture 8: ROM & Programmable Logic Devices
In this lecture: Lecture 8: ROM Programmable Logic Devices Dr Pete Sedcole Department of EE Engineering Imperial College London http://caseeicacuk/~nps/ (Floyd, 3 5, 3) (Tocci 2, 24, 25, 27, 28, 3 34)
More informationSYNTHESIS OF COMBINATIONAL CIRCUITS
HPTER 6 SYNTHESIS O OMINTIONL IRUITS 6.1 Introduction oolean functions can be expressed in the forms of sum-of-products and productof-sums. These expressions can also be minimized using algebraic manipulations
More informationCourse Overview. Course Overview
Course Overview Where does this course fit into the Electrical Engineering curriculum? Page 5 Course Overview Where does this course fit into the Computer Engineering curriculum? Page 6 3 Course Content
More informationLogic Circuit Design
Logic Circuit Design we have studied Truth Tables Logic gates Logic algebra K-maps 1 All these are tools Tools Truth Tables Logic gates Logic algebra K-maps 2 All these are tools Tools Truth Tables Logic
More informationLaboratory Manual CS (P) Digital Systems Lab
Laboratory Manual CS 09 408 (P) Digital Systems Lab INDEX CYCLE I A. Familiarization of digital ICs and digital IC trainer kit 1 Verification of truth tables B. Study of combinational circuits 2. Verification
More informationI. Digital Integrated Circuits - Logic Concepts
I. Digital Integrated Circuits - Logic Concepts. Logic Fundamentals: binary mathematics: only operate on and (oolean algebra) simplest function -- inversion = symbol for the inverter INPUT OUTPUT EECS
More informationCombinational Logic. Rab Nawaz Khan Jadoon DCS. Lecturer COMSATS Lahore Pakistan. Department of Computer Science
Combinational Logic Rab Nawaz Khan Jadoon DCS COMSATS Institute of Information Technology Lecturer COMSATS Lahore Pakistan Digital Logic and Computer Design 2 Combinational logic A combinational circuit
More informationEE40 Lecture 35. Prof. Chang-Hasnain. 12/5/07 Reading: Ch 7, Supplementary Reader
EE4 Lecture 35 2/5/7 Reading: Ch 7, Supplementary Reader EE4 all 26 Slide Week 5 OUTLINE Need for Input Controlled Pull-Up CMOS Inverter nalysis CMOS Voltage Transfer Characteristic Combinatorial logic
More information(CSC-3501) Lecture 6 (31 Jan 2008) Seung-Jong Park (Jay) CSC S.J. Park. Announcement
Seung-Jong Park (Jay) http://www.csc.lsu.edu/~sjpark Computer Architecture (CSC-3501) Lecture 6 (31 Jan 2008) 1 Announcement 2 1 Reminder A logic circuit is composed of: Inputs Outputs Functional specification
More informationBOOLEAN ALGEBRA AND LOGIC FAMILIES
C H A P T E R 7 Learning Objectives Unique Feature of Boolean Algebra Laws of Boolean Algebra Equivalent Switching Circuits DeMorgan s Theorem s The Sum-of-Products (SOP) Form The Standard SOP Form The
More informationLecture 15 Analysis of Combinational Circuits
Lecture 15 Analysis of Combinational Circuits Designing Combinational Logic Circuits A logic circuit having 3 inputs, A, B, C will have its output HIGH only when a majority of the inputs are HIGH. Step
More informationEncoders. Lecture 23 5
-A decoder with enable input can function as a demultiplexer a circuit that receives information from a single line and directs it to one of 2 n possible output lines. The selection of a specific output
More informationIntroduction to Digital Logic Missouri S&T University CPE 2210 Exam 1 Logistics
Introduction to Digital Logic Missouri S&T University CPE 2210 Exam 1 Logistics Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and
More information2 Logic Gates THE INVERTER. A logic gate is an electronic circuit which makes logic decisions. It has one output and one or more inputs.
2 Logic Gates A logic gate is an electronic circuit which makes logic decisions. It has one output and one or more inputs. THE INVERTER The inverter (NOT circuit) performs the operation called inversion
More informationModule 4: Combinational Logic Glitches and Hazards
Module 4: Combinational Logic Glitches and Hazards Wakerly: Chapter 4 (part 3) : ECEN 3233 r. Keith. Teague Spring 23 23 TIME RESPONSE in Combinational Networks emphasis on timing behavior of circuits
More informationCombinational Logic. Combinational Logic Design Process, Three State Buffers, Decoders, Multiplexers, Encoders, Demultiplexers, Other Considerations
Combinational Logic Combinational Logic Design Process, Three State Buffers, Decoders, Multiplexers, Encoders, Demultiplexers, Other Considerations Copyright (c) 2012 Sean Key Combinational Logic Design
More informationB.C.A 2017 DIGITAL ELECTRONICS BCA104T MODULE SPECIFICATION SHEET. Course Outline
Course Outline B.C.A 2017 DIGITAL ELECTRONICS BCA104T MODULE SPECIFICATION SHEET The purpose of the course is to teach principles of digital electronics. This course covers varieties of topics including
More informationFormal Foundation of Digital Design
Chapter 2: Switching Algebra and Logic Circuits 78 22 Digital Logic Design @ Department of Computer Engineering KKU. Formal Foundation of Digital Design In 854 George Boole published An investigation into
More informationUnit 3. Logic Design
EE 2: Digital Logic Circuit Design Dr Radwan E Abdel-Aal, COE Logic and Computer Design Fundamentals Unit 3 Chapter Combinational 3 Combinational Logic Logic Design - Introduction to Analysis & Design
More informationNUMBER SYSTEM AND CODES
NUMBER SYSTEM AND CODES INTRODUCTION:- The term digital refers to a process that is achieved by using discrete unit. In number system there are different symbols and each symbol has an absolute value and
More informationExperiment # 4. Binary Addition & Subtraction. Eng. Waleed Y. Mousa
Experiment # 4 Binary Addition & Subtraction Eng. Waleed Y. Mousa 1. Objectives: 1. To study adder and subtractor circuits using logic gates. 2. To construct and test various adders and subtractor circuits.
More informationSynthesis of Combinational Logic
Synthesis of ombinational Logic 6.4 Gates F = xor Handouts: Lecture Slides, PS3, Lab2 6.4 - Spring 2 2/2/ L5 Logic Synthesis Review: K-map Minimization ) opy truth table into K-Map 2) Identify subcubes,
More informationUC Berkeley CS61C : Machine Structures
CS61C L22 Representations of Combinatorial Logic Circuits (1) inst.eecs.berkeley.edu/~cs61c UC Berkeley CS61C : Machine Structures Lecture 22 Representations of Combinatorial Logic Circuits 27-3-9 TA David
More information14:332:231 DIGITAL LOGIC DESIGN. Gate Delays
4:332:23 DIGITAL LOGIC DESIGN Ivan Marsic, Rutgers University Electrical & Computer Engineering all 23 Lecture #8: Timing Hazards Gate Delays hen the input to a logic gate is changed, the output will not
More informationGATE Online Free Material
Subject : Digital ircuits GATE Online Free Material 1. The output, Y, of the circuit shown below is (a) AB (b) AB (c) AB (d) AB 2. The output, Y, of the circuit shown below is (a) 0 (b) 1 (c) B (d) A 3.
More informationObjective Questions. (a) Light (b) Temperature (c) Sound (d) all of these
Objective Questions Module 1: Introduction 1. Which of the following is an analog quantity? (a) Light (b) Temperature (c) Sound (d) all of these 2. Which of the following is a digital quantity? (a) Electrical
More informationGeometry. 6.1 Perpendicular and Angle Bisectors.
Geometry 6.1 Perpendicular and Angle Bisectors mbhaub@mpsaz.org 6.1 Essential Question What conjectures can you make about a point on the perpendicular bisector of a segment and a point on the bisector
More informationFunction Table of 74LS138, 3-to-8 Decoder +5V 6 G1 4 G2A 5 G2B. 4-to-16 Decoder using two 74LS139, 3-to-8 Decoder
CS0 Digital Logic Design The XX8 -to-8 Decoder The -to-8, XX8 Decoder is also commonly used in logical circuits. Similar, to the -to- Decoder, the -to-8 Decoder has active-low outputs and three extra NOT
More informationCMSC 2833 Lecture 26. Step Expression Justification
omputer Organiation I. Karnaugh Maps and Minimiation MS Lecture Minimiation with Theorems onsider the Boolean function: FF(xx, yy, ) = xxʹyyʹ + xyʹʹ + xyʹ + xxxxʹ + xxxxxx Step Expression Justification.
More informationDIGITAL CIRCUITS AND SYSTEMS ASSIGNMENTS 1 SOLUTIONS
DIGITAL CIRCUITS AND SYSTEMS ASSIGNMENTS 1 SOLUTIONS 1. Analog signal varies continuously between two amplitudes over the given interval of time. Between these limits of amplitude and time, the signal
More informationUC Berkeley CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c UC Berkeley CS61C : Machine Structures Lecture 22 Representations of Combinatorial Logic Circuits Lecturer SOE Dan Garcia www.cs.berkeley.edu/~ddgarcia 100 MPG Car contest!
More informationDIGITAL LOGIC COMPUTER SCIENCE
29 DIGITL LOGIC COMPUTER SCIENCE Unit of ENGINEERS CREER GROUP Head O ce: S.C.O-2-22 - 23, 2 nd Floor, Sector-34/, Chandigarh-622 Website: www.engineerscareergroup.in Toll Free: 8-27-4242 E-Mail: ecgpublica
More informationFirst Optional Homework Problem Set for Engineering 1630, Fall 2014
First Optional Homework Problem Set for Engineering 1630, Fall 014 1. Using a K-map, minimize the expression: OUT CD CD CD CD CD CD How many non-essential primes are there in the K-map? How many included
More informationBy: Dr. Ahmed ElShafee
Lecture (03) COMBINATIONAL CIRCUIT DESIGN AND SIMULATION USING GATES By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU : Spring 2018, CSE303 Logic design II Design of Circuits with Limited Gate Fan In In
More informationLecture 2: Digital Logic Basis
Lecture 2: Digital Logic Basis Xufeng Kou School of Information Science and Technology ShanghaiTech University 1 Outline Truth Table Basic Logic Operation and Gates Logic Circuits NOR Gates and NAND Gates
More informationClass Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: Introduction to UnitII 2. SKILLS ADDRESSED: Learning I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi
More informationLarger 5 & 6variable Karnaugh maps
Larger 5 & 6variable Karnaugh maps Larger Karnaugh maps reduce larger logic designs. How large is large enough? That depends on the number of inputs, fan-ins, to the logic circuit under consideration.
More informationEE 330 Lecture 5. Basic Logic Circuits Complete Logic Family Other Logic Styles. complex logic gates
EE 330 Lecture 5 asic Logic Circuits Complete Logic Family Other Logic Styles complex logic gates Review from Last Time The key patents that revolutionized the electronics field: Jack Kilby (34 years old
More informationCombinational Logic Gates in CMOS
Combinational Logic Gates in CMOS References: dapted from: Digital Integrated Circuits: Design Perspective, J. Rabaey UC Principles of CMOS VLSI Design: Systems Perspective, 2nd Ed., N. H. E. Weste and
More informationLIST OF EXPERIMENTS. KCTCET/ /Odd/3rd/ETE/CSE/LM
LIST OF EXPERIMENTS. Study of logic gates. 2. Design and implementation of adders and subtractors using logic gates. 3. Design and implementation of code converters using logic gates. 4. Design and implementation
More informationDigital Electronic Concepts
Western Technical College 10662137 Digital Electronic Concepts Course Outcome Summary Course Information Description Career Cluster Instructional Level Total Credits 4.00 Total Hours 108.00 This course
More informationGeometry Chapter 8 8-5: USE PROPERTIES OF TRAPEZOIDS AND KITES
Geometry Chapter 8 8-5: USE PROPERTIES OF TRAPEZOIDS AND KITES Use Properties of Trapezoids and Kites Objective: Students will be able to identify and use properties to solve trapezoids and kites. Agenda
More informationChapter 3 Combinational Logic Design
Logic and Computer Design Fundamentals Chapter 3 Combinational Logic Design Part 2 Combinational Logic Overview Part -Implementation Technology and Logic Design Design Concepts Fundamental concepts of
More informationMaxima and Minima. Terminology note: Do not confuse the maximum f(a, b) (a number) with the point (a, b) where the maximum occurs.
10-11-2010 HW: 14.7: 1,5,7,13,29,33,39,51,55 Maxima and Minima In this very important chapter, we describe how to use the tools of calculus to locate the maxima and minima of a function of two variables.
More informationSolutions. ICS 151 Final. Q1 Q2 Q3 Q4 Total Credit Score. Instructions: Student ID. (Last Name) (First Name) Signature
ICS 151 Final Name Student ID Signature :, (Last Name) (First Name) : : Instructions: 1. Please verify that your paper contains 19 pages including this cover and 3 blank pages. 2. Write down your Student-Id
More informationDigital Fundamentals
07/ago/2017 Digital Fundamentals ELEVENTH EDITION CHPTER 1 Introductory Concepts Digital electronics uses circuits that have two states, which are represented by two different voltage levels called HIGH
More informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) SUMMER-16 EXAMINATION Model Answer
Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model answer and the answer written by candidate
More informationDigital Electronics Course Objectives
Digital Electronics Course Objectives In this course, we learning is reported using Standards Referenced Reporting (SRR). SRR seeks to provide students with grades that are consistent, are accurate, and
More informationEE100Su08 Lecture #16 (August 1 st 2008)
EESu8 Lecture #6 (ugust st 28) OUTLINE Project next week: Pick up kits in your first lab section, work on the project in your first lab section, at home etc. and wrap up in the second lab section. USE
More informationICS 151 Final. (Last Name) (First Name)
ICS 151 Final Name Student ID Signature :, (Last Name) (First Name) : : Instructions: 1. Please verify that your paper contains 19 pages including this cover and 3 blank pages. 2. Write down your Student-Id
More informationLOGIC DIAGRAM: HALF ADDER TRUTH TABLE: A B CARRY SUM. 2012/ODD/III/ECE/DE/LM Page No. 1
LOGIC DIAGRAM: HALF ADDER TRUTH TABLE: A B CARRY SUM K-Map for SUM: K-Map for CARRY: SUM = A B + AB CARRY = AB 22/ODD/III/ECE/DE/LM Page No. EXPT NO: DATE : DESIGN OF ADDER AND SUBTRACTOR AIM: To design
More informationSKP Engineering College
SKP Engineering College Tiruvannamalai 606611 A Course Material on Digital Electronics By Dr.N.Nandhagopal Associate Professor Electronics and Communication Engineering Department Electronics and Communication
More informationECE380 Digital Logic
ECE38 Digital Logic Introduction Dr. D. J. Jackson Lecture - Digital hardware Logic circuits are used to build computer hardware as well as other products (digital hardware) Late 96 s and early 97 s saw
More informationEE 330 Lecture 5. Basic Logic Circuits Complete Logic Family Other Logic Styles. Improved Device Models. complex logic gates pass transistor logic
EE 330 Lecture 5 asic Logic Circuits Complete Logic Family Other Logic Styles complex logic gates pass transistor logic Improved Device Models Review from Last Time The key patents that revolutionized
More informationSatish Chandra, Assistant Professor, P P N College, Kanpur 1
8/7/4 LOGIC GTES CE NPN Transistor Circuit COMINTIONL LOGIC Satish Chandra ssistant Professor Department of Physics P PN College, Kanpur www.satish4.weebly.com circuit with an output signal that is logical
More informationUC Berkeley CS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c UC Berkeley CS61C : Machine Structures Lecture 25 Representations of Combinational Logic Circuits Senior Lecturer SOE Dan Garcia www.cs.berkeley.edu/~ddgarcia Conway s Life
More informationMAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI
MAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI 6 DEPARTMENT: ECE QUESTION BANK SUBJECT NAME: DIGITAL SYSTEM DESIGN SEMESTER III SUBJECT CODE: EC UNIT : Design of Combinational Circuits PART -A ( Marks).
More informationOBJECTIVE TYPE QUESTIONS FOR PRACTICAL EXAMINATION Subject : Electronics-I ( EC 112)
OBJECTIVE TYPE QUESTIONS FOR PRACTICAL EXAMINATION Subject : Electronics-I ( EC 112) 1. Which mathematical notation specifies the condition of periodicity for a continuous time signal? a. x(t) = x( t +T)
More informationSection 14.3 Partial Derivatives
Section 14.3 Partial Derivatives Ruipeng Shen March 20 1 Basic Conceptions If f(x, y) is a function of two variables x and y, suppose we let only x vary while keeping y fixed, say y = b, where b is a constant.
More informationELECTRONIC CIRCUITS. Time: Three Hours Maximum Marks: 100
EC 40 MODEL TEST PAPER - 1 ELECTRONIC CIRCUITS Time: Three Hours Maximum Marks: 100 Answer five questions, taking ANY TWO from Group A, any two from Group B and all from Group C. All parts of a question
More informationDepartment of Electronics and Communication Engineering
Department of Electronics and Communication Engineering Sub Code/Name: BEC3L2- DIGITAL ELECTRONICS LAB Name Reg No Branch Year & Semester : : : : LIST OF EXPERIMENTS Sl No Experiments Page No Study of
More informationEMT1250 LABORATORY EXPERIMENT. EXPERIMENT # 4: Combinational Logic Circuits. Name: Date:
EXPERIMENT # 4: Combinational Logic Circuits Name: Date: Equipment/Parts Needed: 5V DC Power Supply Digital Trainer (Logic Probe) Breadboard DIP Switch 7400 NAND gate 7402 NOR gate 7404 Inverter 7408 AND
More informationa b y UC Berkeley CS61C : Machine Structures Hello Helo,world!
CS61C L23 Representations of Combinatorial Logic Circuits (1) inst.eecs.berkeley.edu/~cs61c UC Berkeley CS61C : Machine Structures Lecture 23 Representations of Combinatorial Logic Circuits 2006-10-20
More informationlogic system Outputs The addition of feedback means that the state of the circuit may change with time; it is sequential. logic system Outputs
Sequential Logic The combinational logic circuits we ve looked at so far, whether they be simple gates or more complex circuits have clearly separated inputs and outputs. A change in the input produces
More informationElectronics. Digital Electronics
Electronics Digital Electronics Introduction Unlike a linear, or analogue circuit which contains signals that are constantly changing from one value to another, such as amplitude or frequency, digital
More informationChapter # 1: Introduction
Chapter # : Randy H. Katz University of California, erkeley May 993 ฉ R.H. Katz Transparency No. - The Elements of Modern Design Representations, Circuit Technologies, Rapid Prototyping ehaviors locks
More informationCOMPUTER ORGANIZATION & ARCHITECTURE DIGITAL LOGIC CSCD211- DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF GHANA
COMPUTER ORGANIZATION & ARCHITECTURE DIGITAL LOGIC LOGIC Logic is a branch of math that tries to look at problems in terms of being either true or false. It will use a set of statements to derive new true
More informationLogic Design I (17.341) Fall Lecture Outline
Logic Design I (17.341) Fall 2011 Lecture Outline Class # 07 October 31, 2011 / November 07, 2011 Dohn Bowden 1 Today s Lecture Administrative Main Logic Topic Homework 2 Course Admin 3 Administrative
More informationComputer Hardware Engineering (IS1200) Computer Organization and Components (IS1500) Fall 2017 Lecture 7: Combinational Logic
Computer Hardware ngineering (I2) Computer Organization and Components (I5) Fall 27 Lecture 7: Combinational Logic Optional for I2, compulsory for I5 Fredrik Lundevall lides by David roman and Fredrik
More information