Number Systems 1(Solutions for Vol 1_Classroom Practice Questions)

Size: px
Start display at page:

Download "Number Systems 1(Solutions for Vol 1_Classroom Practice Questions)"

Transcription

1

2 Chapter Number Systems (Solutions for Vol _Classroom Practice Questions). ns: (d) 5 x + 44 x = x ( x + x + 5 x )+( x +4 x + 4 x ) = x + x + x x +x+5+x +4x+4 = x + x + x 5x 6 = (x6) (x+ ) = (ase cannot be negative) Hence x = 6. (OR) s per the given number x must be greater than 5. Let consider x = 6 (5) 6 = (59) (44) 6 = (64) () 6 = () (59) + (64) = () So that x = 6. ns: (a) 8-bit representation of. ns: (c) In s complement representation the sign bit can be extended towards left any number of times without changing the value. In given number the sign bit is X, hence it can be extended left any number of times. 4. ns: (c) inary representation of +(59) : (+59) =( ) = ( ) S complement Hexadecimal equivalent (DE5) H +7 = () s complement representation of 7 =. s complement representation of 7 =. No. of s in s complement of 7 = m = No. of s in s complement of 7 = n = m: n = : CE Engg. Publications 5. ns: 5 Symbols used in this equation are,,, Hence base or radix can be 4 or higher () x = () x (.) x x + x +x = (x+) (x+x +x - ) x +x+ = (x) x x x + x + = x + 6x + x 5x = x(x 5) = x = (or) x = 5 x must be x >, So x = 5 Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

3 : : Number Systems 6. ns: 5 = x8 y = x.y + 8 y = xy+8 xy = Possible solutions: i. x =, y = ii. x =, y = 5 iii. x =, y = possible solutions exists. 7. ns: The range (or) distinct values For s complement ( n )to +( n ) For sign magnitude ( n ) to +( n ) Let n = in s complement ( ) to + ( ) to +,,, + X = 4 n = in sign magnitude to + Y = X Y = CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

4 Chapter Logic Gates & oolean lgebra. ns: (c) Given s complement numbers of sign bits are x & y. z is the sign bit obtained by adding above two numbers. Overflow is indicated by = x y z x y z Examples. = +7 = +7 4 x y z. = +7 = +5 x y z. = 7 = 7 4 x y z 4. = 7 = 5 x y z. ns: (b) Truth table of XOR o/p Stage : X X o/p For second XOR gate o/p =. Similarly for third XOR gate o/p = X & for fourth o/p = For Even number of XOR gates o/p = For XOR gates cascaded o/p =.. ns: (b) w,x y,z 4. ns: (c) f f y z v = v = x x w,x y,z f 4 Stage : Given one i/p = lways. X o/p = X = X CE Engg. Publications For First XOR gate o/p = X x f f f 4 = f. f + f 5. ns: (d) Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata f P Q R

5 t t P t Q t R t : 5 : Logic Gates and oolean lgebra = m (,, 4,7) M (x, y, z) = a b c Where x = M (a, b,c), y = M(a,b, c ), z = c 8. ns: 4 () (C) (without delay) t = t = t = 4 t = 6 t = 8 t(ns) 6. ns: (c) x x x x x x x x 4 x x 4 x x 4 x x x x 4 y z, when y = z option (c) is true For all cases option,, D not satisfy. 7. ns: (b) M(a,b,c) = ab + bc + ca M (a, b,c) = bc a b a c M(a, b, c ) = ab + b c + c a M( M (a, b,c), M(a,b, c ), c) = bc ab a c (ab bc ac) ab bc ca)c ( bc ab bc ab a c (ab bc ac) = abc abc abc abc = c[ab ab] c[ab ab] y z a cc bc ab a c(c) abc (with delay) (with delay) Z(without delay) Z (with delay) 4 n sec Z is for 4 nsec 9. ns: (c) Logic gates X Y XY XY Where Y Y It is a NND gate and thus the gate is Universal gate. CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

6 Chapter K Maps. ns: (b) yz wx f xz xz SOP SOP: x y + y w POS: y(x + w) wz xy wy = xy+yw xy. ns: (b). POS ab cd b d f b d b c x + w wz xy = y(x+w) b c y 4. ns: (a) For n-variable oolean expression, Maximum number of minterms = n Maximum number of implicants = n Maximum number of prime implicants = n 5. ns: (c) C F(,, C) = C C 6. ns: fter minimization = C D = CD only one minterm. = n CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

7 : 7 : K-Maps 7. ns: w z w xy x yz wx yz CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

8 4 Chapter Combinational Circuits. ns: (d) Let the output of first MUX is F F = I +I Where is selection line, I, I = MUX Inputs F S.W S.W S Output of second MUX is F.I F S. I.F S. F F S F ut F S F S S W W i.e., F W S S W. ns: 5 X Y Y X Y X Y X Z 4 F Z F Z F Z F Z S S S S Initially all the output values are, at t =, the inputs to the 4-bit adder are changed to X X X X =, Y Y Y Y = indicates critical path delay to get the output CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

9 : 9 : ECE - Postal Coaching Solutions X Y S = [t= ns] is updated as after ns 5 5 C Z = [t= ns] is updated again to (or) is not changed, i.e. Z is t= ns Z = X Y S = [t= ns] is updated again to (or) is not changed 5 5 C C Z = [t= ns] is updated again to (or) is not changed, i.e. Z is t= ns Z = X Y S = [t= ns] is updated again to (or) is not changed Z = 5 5 C Z = [t=5ns, t =5ns] is updated to after 5 ns X Y S = [t=ns] is updated again to (or) is not changed 5 5 C Z 4 = [t=5ns, t =5ns] is updated as after 5ns when Z is arrived Z = Total time taken = t + t = 5 ns i.e. critical time (or) maximum time is taken for Z 4 to get final output as CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

10 : : Digital. ns: (a) The given circuit is binary parallel adder/subtractor circuit. It performs +, but not + operations. K C Operation + (addition) ++(addition with carry) + ( s complement addition) + +( s complement subtraction) 4. ns: (d) It is expansion of :4 decoders to :8 demultiplexer, must be connected to S, S i.e.., R = S, S = S Q must be connected to S i.e., Q = S P is serial input must be connected to D in 5. ns: 6 T = NOR MUX MUX ns.5ns.5ns Delay = ns +.5ns +.5ns = 5ns T = NOT MUX NOR MUX ns.5ns ns.5ns Delay = ns +.5ns + ns +.5ns = 6ns Hence, the maximum delay of the circuit is 6ns 6. ns: When all bits in register is, then only it gives highest delay. in 8 bit notation of s complement is CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

11 5 Chapter Sequential Circuits. ns: (c) Given Clk, X, X Output of First D-FF is Q Output of Second D-FF is Q 4 clk X X Q Q s the clear input is given to be synchronous so it waits upto the next clock pulse to clear the counter & hence the counter get s cleared during the 7 th clock pulse. mod of counter = 7 4. ns: (b) The given circuit is a mod 4 ripple down counter. Q is coming to after the delay of t. CLK Q Q 4 Y=Q Q. ns: 4 In the given first loop of states, zero has repeated times. So, minimum 4 number of Flip-flops are needed.. ns: 7 The counter is cleared when Q D Q C Q Q = Clk Q D Q C Q Q ns: (c) ssume n = clk -bit counter Q Q 4 decoder Outputs of counter is connected to inputs of decoder Counter outputs Decoder inputs Decoder outputs Q Q a b d d d d The overall circuit acts as 4-bit ring counter n = k = = 4, k-bit ring counter CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

12 : : Digital & Microprocessors 6. ns: (b) CLK Serial in= C D C D fter 7 clock pulses content of shift register become again 7. ns: (b) J K Q n Q T J Q K Q n. =. =. =. =. =. =. =. = Q n+ J KQ n n Q n Q n T = J Q +KQ n = (J+Q n ) (K + Q ) n n 8. ns:.5 Clk Q Q Q Q 4 Q 5 Y= Q + Q The waveform at OR gate output, Y is [ = +5V] verage power V T o Lt T 5T P T y (t) dt o R R T dt T dt RT T.T 5. (T T) (5T T).5mw RT R(5T) 5 CE Engg. Publications T T T 4T 5T T = 5T Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

13 : : Postal Coaching Solutions 9. ns: (b) Present Next State Output (Y) State X = X = X = X = E C C D E C Step (): Step (): y replacing state as state C then state, C are equal. Reducing state table Present state D E Next state X = X = Reducing state table Present state D E E Next state X = X = E State D, E are equal, remove state E and replace E with D in next state. Reducing state table Present state D D Next state X = X = D Finally reduced state table is Reduced state table Present state D Next state X = X = D states are present in the reduced state table. ns: (c) State table for the given state diagram State Input Output S S S S Output is s complement of input.. ns: (c) In state (C), when XYZ =, then mbiguity occurs ecause, from state (C) When X =, Z = N.S is () When Y =, Z = N.S is () CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

14 Chapter 6 Logic Gate Families. ns: (b) V OH (min):- (High level output voltage) The minimum voltage level at a Logic circuit output in the logic state under defined load conditions. V OL (max):- (Low level output voltage) The maximum voltage level at a logic circuit output in the Logical state under defined load conditions. V IL (max):- (Low level input voltage) The maximum voltage level required for a logic at an input. ny voltage above this level will not be accepted as a Low by the logic circuit. V IH (min) :- (High level Input voltage) The minimum voltage level required for logic at an input. ny voltage below this level will not be accepted as a HIGH by the Logic circuit. I OH + + I IH. ns: (b) Fan out is minimum in DTL (High Fan-out = CMOS) Power consumption is minimum in CMOS. Propagation delay is minimum in ECL (fastest = ECL). ns: (b) When V i =.5V, Q is in reverse active region Q is in saturation region Q is in saturation region Q 4 is in cut-off region 4. ns: (d) The given circuit can be redrawn as below: P P Q Q NOT gate V dd OUT CE Engg. Publications V OH V - - IH I OL + V OL - High Low Fig: currents and voltages in the two logic states. I IL + V IL - OUT PQ PQ = P ND Q 5. ns: (b) s per the description of the question, when the transistor Q and diode both are OFF then only output z =. X Y Z Remarks Q is OFF, Diode is ON Q is OFF, Diode is OFF Q is ON, Diode is OFF Q is ON, Diode is OFF Hence Z = X Y Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

15 7 Chapter Semiconductor Memories. ns: (b) Square of a 4 - bit number can be at most 8 - bit number. { i.e () = (5) [(5) ] = (5) }. Therefore ROM requires 8 data lines. Data is with size of 4 bits ROM must require 4 address lines and 8 data lines ROM = n m n = inputs (address lines), m = output lines n = 4, m = 8.. ns: (a) ROM is used to design a combinational circuit. The number of address lines of the ROM is equal to the number of input variables in the truth table. ROM is represented as n m where n inputs and m output lines. [Where n = address bits]. ns: (b) i/p s o/p s X X X X Y Y Y Y 4 Outputs ns: (c) C C E ROM t the rising edge of the First clock pulse the content of location () = 6 appears on the data bus, at the rising of the second clock pulse the content of location () = appears on the data bus. 5. ns: (b) bit SRM memory cell is WL t t time L CMOS Inverters L In Inverters, output of the st Inverter is connected to Gate Input of nd Inverter and vice versa. The outputs are in 4 CD number CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

16 8 Chapter /D & D/ Converters. ns: (b) CLK Counter Decoder Q Q Q D D D D V R ns: (b) R R R R I/ R R R I/4 I/8 I/6 R 8 9 R equ = (((((R R)+R) R)+R) R)+R) R) R equ = R = k. V I = R V = = m. R k Current division at 6 I = 6 = 6.5. ns: (c) Net current at inverting terminal, I I 5I I i = + = I V = I i R = k 6 5 = =.5V 6 4. ns: (d) Given that V DC = n n b n Volts V DC = b b b b V DC =.5b + b + b + 4b Initially counter is in state Up counter o/p b b b b V DC (V) o/p of comparator When V DC = 6.5 V, the o/p of comparator is. t this instant, the clock pulses to the counter are stopped and the counter remains in state. The stable reading of the LED display is. CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

17 : 7 : Digital & Microprocessors 5. ns: (b) The magnitude of error between V DC & V in at steady state is 6. ns: (a) In Dual slope V V = DC DC Vin T VR.T VR T Vin T in =. V mv 7. ms ms DVMindicates.4 7. ns: (d) Ex: f in = khz f s = khz f in = 5 khz f s = 5 khz. Max conversion time = N+ T =. s = 48 s. Sampling period = T s maximum conversion time T s 48 s. Sampling rate f s = 6 Ts 48 f s 488 f s 5 Hz f 4. f in = s 5Hz CE Engineering cademy Hyderabad Delhi hopal Pune hubaneswar Lucknow Patna engaluru Chennai Vijayawada Vizag Tirupati Kukatpally

18 Chapter 9 rchitecture, Pin Details of 885 & Interfacing with 885. ns: (a) chip select is an active low signal for chipselect ; the inputs for NND gate must be let us see all possible cases for chipselect condition =EH X X X X X X X X X X X X X X X X X X X X X X X X The only option that suits hare is option(a) & are used for line selection to 7 are used for chip selection ddress space is 6H to 6H o to are used for line selection to 5 are used for chip selection 6H ( =) 6H( =) Chipselect =EFFFH. ns: (d) oth the chips have active high chip select inputs. Chip is selected when 8 =, 9 = Chip is selected when 8 =, 9 = Chips are not selected for combination of & of 8 & 9 Upon observing 8 & 9 of given address Ranges, F8 to F9FF is not represented. ns: (d) The I/O device is interfaced using Memory Mapped I/O technique. The address of the Input device is =F8F8 H The Instruction for correct data transfer is = LD F8F8H 4. ns: (b) Out put of 8 Decoder is used for selecting the output port. Select code is H This mapping is memory mapped I/O CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

19 : 9 : Digital & Microprocessors 5. ns: (d) =8H =FFH =8H =FFH =8H =FFH =8H =FFH 6. ns: (a) ddress Range given is cs 8 k ROM H FFFH To provide cs as low, The condition is 5 = 4 = and = (or) () i.e 5 = 4 = and shouldn t be,. Thus it is [ +, ] CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

20 : : Digital & Microprocessors 7. ns: (a) 5 :8 Decoder 4 5, 4 are used for chip selection,, are used for input of decoder Enable of Input of decoder ddress of decoder chip Size of each memory block = = K CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

21 Chapter Instruction set of 885 & Programming with 885. ns: (c) 6H : LXI H,879H ; (HL) = 879H 6H : MOV, L ; ()(L) = 79 64H : DD H ; () = + ; (H) = ; () = CY =, C = 65H : D ; 66 dded to () since CY= & C = ; () = 69H 66H : MOV H, ; (H)() =69H 67H : PCHL ; (PC)(HL) = 6979H. ns: (c) H : LXI SP, FFH ; (SP) = FFH H : LXI H, 7 H ; (HL) = 7H 6H : MVI, H ; () = H 8H : SU M ; ()()-(7) ; (7) = H ; () = H The contents of ccumulator is H. ns: (c) SU : MVI, H H CLL SU program will shifted to SU address location SU : INR H RET returned to the main program The contents of ccumulator after execution of the above SU is H 4. ns: (c) The loop will be executed until the value in register equals to zero, then, Execution time =9(7T+4T+4T+T)+( 7T+4T+4T+7T)+7T = 54T 5. ns: (d) H=55 : L = 55, 54, 5, ---- H=54 : L =, 55, 54, H= : L =,55,54,5,--- H= : In first iteration (with H=55), the value in L is decremented from 55 to i.e., 55 times In further remaining 54 iterations, the value in L is decremented from to i.e., 56 times DCRL instruction gets executed for [ 55 (54 56)] 6579 times 6. ns: (a) ST 4H is a -yte Instruction and it requires 4 Machine cycles (Opcode fetch, Operand Read, Operand Read, Memory write). The Higher order ddress ( 5 8 ) sent in 4 machine cycles is as follows Given ST 4 is stored at FFEH CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

22 : : Digital & Microprocessors i.e., ddress Instruction FFE, FFF, : ST 4H Machine cycle. Opcode fetch. Operand Read. Operand Read 4. Memory Write ddress ( 5 - ) FFEH FFFH H 4H Higher order address ( 5-8 ) FH FH H H i.e. Higher order ddress sent on 5-8 for 4 Machine Cycles are FH, FH, H, H. 7. ns: (d) The operation SI E H indicates -E where indicates accumulator Thus the result of the subtraction operation is stored in the accumulator and the contents of accumulator are changed. 8. ns: (c) If the content in register is to be multiplied with the content in register C, the contents of register is added to the accumulator (initial value of accumulator is ) for C times. CE Engg. Publications Hyderabad Delhi hopal Pune hubaneswar engaluru Lucknow Patna Chennai Vijayawada Vizag Tirupati Kukatpally Kolkata

Delhi Noida Bhopal Hyderabad Jaipur Lucknow Indore Pune Bhubaneswar Kolkata Patna Web: Ph:

Delhi Noida Bhopal Hyderabad Jaipur Lucknow Indore Pune Bhubaneswar Kolkata Patna Web:     Ph: Serial : 5SP_CS_W_Digital Logic_598 Delhi Noida hopal Hyderabad Jaipur Lucknow Indore Pune hubaneswar Kolkata Patna Web: Email: info@madeeasy.in Ph: 452462 CLSS TEST 289 COMPUTER SCIENCE & IT Subject :

More information

Delhi Noida Bhopal Hyderabad Jaipur Lucknow Indore Pune Bhubaneswar Kolkata Patna Web: Ph:

Delhi Noida Bhopal Hyderabad Jaipur Lucknow Indore Pune Bhubaneswar Kolkata Patna Web:     Ph: Serial : S_CS_C_Digital Logic_588 Delhi Noida hopal Hyderabad Jaipur Lucknow Indore Pune hubaneswar Kolkata Patna Web: E-mail: info@madeeasy.in Ph: -56 CLASS TEST 8-9 COMPUTER SCIENCE & IT Subject : Digital

More information

Why digital? Overview. Number Systems. Binary to Decimal conversion

Why digital? Overview. Number Systems. Binary to Decimal conversion Why digital? Overview It has the following advantages over analog. It can be processed and transmitted efficiently and reliably. It can be stored and retrieved with greater accuracy. Noise level does not

More information

Digital Circuits. 1. Inputs & Outputs are quantized at two levels. 2. Binary arithmetic, only digits are 0 & 1. Position indicates power of 2.

Digital Circuits. 1. Inputs & Outputs are quantized at two levels. 2. Binary arithmetic, only digits are 0 & 1. Position indicates power of 2. Digital Circuits 1. Inputs & Outputs are quantized at two levels. 2. inary arithmetic, only digits are 0 & 1. Position indicates power of 2. 11001 = 2 4 + 2 3 + 0 + 0 +2 0 16 + 8 + 0 + 0 + 1 = 25 Digital

More information

Lecture 9: Digital Electronics

Lecture 9: Digital Electronics Introduction: We can classify the building blocks of a circuit or system as being either analog or digital in nature. If we focus on voltage as the circuit parameter of interest: nalog: The voltage can

More information

S.Y. Diploma : Sem. III [DE/ED/EI/EJ/EN/ET/EV/EX/IC/IE/IS/IU/MU] Principles of Digital Techniques

S.Y. Diploma : Sem. III [DE/ED/EI/EJ/EN/ET/EV/EX/IC/IE/IS/IU/MU] Principles of Digital Techniques S.Y. Diploma : Sem. III [DE/ED/EI/EJ/EN/ET/EV/EX/IC/IE/IS/IU/MU] Principles of Digital Techniques Time: 3 Hrs.] Prelim Question Paper Solution [Marks : 100 Q.1(a) Attempt any SIX of the following : [12]

More information

Vidyalankar S.E. Sem. III [EXTC] Digital Electronics Prelim Question Paper Solution ABCD ABCD ABCD ABCD ABCD ABCD ABCD ABCD = B

Vidyalankar S.E. Sem. III [EXTC] Digital Electronics Prelim Question Paper Solution ABCD ABCD ABCD ABCD ABCD ABCD ABCD ABCD = B . (a). (b). (c) S.E. Sem. III [EXTC] igital Electronics Prelim Question Paper Solution ABC ABC ABC ABC ABC ABC ABC ABC = B LHS = ABC ABC ABC ABC ABC ABC ABC ABC But ( ) = = ABC( ) ABC( ) ABC( ) ABC( )

More information

Sample Test Paper - I

Sample 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 information

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering TIMING ANALYSIS Overview Circuits do not respond instantaneously to input changes

More information

Vidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution

Vidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution . (a) (i) ( B C 5) H (A 2 B D) H S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution ( B C 5) H (A 2 B D) H = (FFFF 698) H (ii) (2.3) 4 + (22.3) 4 2 2. 3 2. 3 2 3. 2 (2.3)

More information

Chapter 2. Review of Digital Systems Design

Chapter 2. Review of Digital Systems Design x 2-4 = 42.625. Chapter 2 Review of Digital Systems Design Numbering Systems Decimal number may be expressed as powers of 10. For example, consider a six digit decimal number 987654, which can be represented

More information

CHAPTER 7. Exercises 17/ / /2 2 0

CHAPTER 7. Exercises 17/ / /2 2 0 CHAPTER 7 Exercises E7. (a) For the whole part, we have: Quotient Remainders 23/2 /2 5 5/2 2 2/2 0 /2 0 Reading the remainders in reverse order, we obtain: 23 0 = 0 2 For the fractional part we have 2

More information

WORKBOOK. Try Yourself Questions. Electrical Engineering Digital Electronics. Detailed Explanations of

WORKBOOK. 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 information

Show that the dual of the exclusive-or is equal to its compliment. 7

Show that the dual of the exclusive-or is equal to its compliment. 7 Darshan Institute of ngineering and Technology, Rajkot, Subject: Digital lectronics (2300) GTU Question ank Unit Group Questions Do as directed : I. Given that (6)0 = (00)x, find the value of x. II. dd

More information

CprE 281: Digital Logic

CprE 281: Digital Logic CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Simple Processor CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Digital

More information

Appendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring

Appendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring - Principles of Computer rchitecture Miles Murdocca and Vincent Heuring 999 M. Murdocca and V. Heuring -2 Chapter Contents. Introduction.2 Combinational Logic.3 Truth Tables.4 Logic Gates.5 Properties

More information

TYPICAL QUESTIONS & ANSWERS

TYPICAL QUESTIONS & ANSWERS TYPICAL QUESTIONS & ANSWERS PART - I OJECTIVE TYPE QUESTIONS Each Question carries 2 marks. Choose correct or the best alternative in the following: Q.1 The NAN gate output will be low if the two inputs

More information

vidyarthiplus.com vidyarthiplus.com vidyarthiplus.com ANNA UNIVERSITY- COMBATORE B.E./ B.TECH. DEGREE EXAMINATION - JUNE 2009. ELECTRICAL & ELECTONICS ENGG. - FOURTH SEMESTER DIGITAL LOGIC CIRCUITS PART-A

More information

Appendix A: Digital Logic. CPSC 352- Computer Organization

Appendix A: Digital Logic. CPSC 352- Computer Organization - CPSC 352- Computer Organization -2 Chapter Contents. Introduction.2 Combinational Logic.3 Truth Tables.4 Logic Gates.5 Properties of oolean lgebra.6 The Sum-of-Products Form, and Logic Diagrams.7 The

More information

Appendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring

Appendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring - Principles of Computer rchitecture Miles Murdocca and Vincent Heuring 999 M. Murdocca and V. Heuring -2 Chapter Contents. Introduction.2 Combinational Logic.3 Truth Tables.4 Logic Gates.5 Properties

More information

S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques

S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques Time: 3 Hrs.] Prelim Question Paper Solution [Marks : 100 Q.1(a) Attempt any SIX of the following : [12] Q.1(a) (i) Derive AND gate and OR gate

More information

GATE SOLVED PAPER - EC

GATE SOLVED PAPER - EC 2013 ONE MARK Q. 1 A bulb in a staircase has two switches, one switch being at the ground floor and the other one at the first floor. The bulb can be turned ON and also can be turned OFF by any one of

More information

Digital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.

Digital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits. CS211 Computer Architecture Digital Logic l Topics l Transistors (Design & Types) l Logic Gates l Combinational Circuits l K-Maps Figures & Tables borrowed from:! http://www.allaboutcircuits.com/vol_4/index.html!

More information

Review for Test 1 : Ch1 5

Review for Test 1 : Ch1 5 Review for Test 1 : Ch1 5 October 5, 2006 Typeset by FoilTEX Positional Numbers 527.46 10 = (5 10 2 )+(2 10 1 )+(7 10 0 )+(4 10 1 )+(6 10 2 ) 527.46 8 = (5 8 2 ) + (2 8 1 ) + (7 8 0 ) + (4 8 1 ) + (6 8

More information

DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN

DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN UNIT I : BOOLEAN ALGEBRA AND LOGIC GATES PART - A (2 MARKS) Number

More information

SIR C.R.REDDY COLLEGE OF ENGINEERING ELURU DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I - SEMESTER

SIR C.R.REDDY COLLEGE OF ENGINEERING ELURU DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I - SEMESTER SIR C.R.REDDY COLLEGE OF ENGINEERING ELURU 534 007 DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I - SEMESTER DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING DIGITAL

More information

Fundamentals of Digital Design

Fundamentals 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 information

Digital Electronics Circuits 2017

Digital Electronics Circuits 2017 JSS SCIENCE AND TECHNOLOGY UNIVERSITY Digital Electronics Circuits (EC37L) Lab in-charge: Dr. Shankraiah Course outcomes: After the completion of laboratory the student will be able to, 1. Simplify, design

More information

211: Computer Architecture Summer 2016

211: Computer Architecture Summer 2016 211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean

More information

( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function

( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function Question Paper Digital Electronics (EE-204-F) MDU Examination May 2015 1. (a) represent (32)10 in (i) BCD 8421 code (ii) Excess-3 code (iii) ASCII code (b) Design half adder using only NAND gates. ( c)

More information

Digital Electronics. Delay Max. FF Rate Power/Gate High Low (ns) (MHz) (mw) (V) (V) Standard TTL (7400)

Digital Electronics. Delay Max. FF Rate Power/Gate High Low (ns) (MHz) (mw) (V) (V) Standard TTL (7400) P57/67 Lec9, P Digital Electronics Introduction: In electronics we can classify the building blocks of a circuit or system as being either analog or digital in nature. If we focus on voltage as the circuit

More information

CS470: Computer Architecture. AMD Quad Core

CS470: Computer Architecture. AMD Quad Core CS470: Computer Architecture Yashwant K. Malaiya, Professor malaiya@cs.colostate.edu AMD Quad Core 1 Architecture Layers Building blocks Gates, flip-flops Functional bocks: Combinational, Sequential Instruction

More information

Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS

Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS 1) Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a) X -Y and (b) Y - X using 2's complements. a) X = 1010100

More information

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified)

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) WINTER 17 EXAMINATION Subject Name: Digital Techniques Model Answer Subject Code: 17333 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given

More information

on candidate s understanding. 7) For programming language papers, credit may be given to any other program based on equivalent concept.

on candidate s understanding. 7) For programming language papers, credit may be given to any other program based on equivalent concept. WINTER 17 EXAMINATION Subject Name: Digital Techniques Model Answer Subject Code: 17333 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given

More information

Vidyalankar. S.E. Sem. III [EXTC] Digital System Design. Q.1 Solve following : [20] Q.1(a) Explain the following decimals in gray code form

Vidyalankar. S.E. Sem. III [EXTC] Digital System Design. Q.1 Solve following : [20] Q.1(a) Explain the following decimals in gray code form S.E. Sem. III [EXTC] Digital System Design Time : 3 Hrs.] Prelim Paper Solution [Marks : 80 Q.1 Solve following : [20] Q.1(a) Explain the following decimals in gray code form [5] (i) (42) 10 (ii) (17)

More information

Lecture 22 Chapters 3 Logic Circuits Part 1

Lecture 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 information

EC-121 Digital Logic Design

EC-121 Digital Logic Design EC-121 Digital Logic Design Lecture 2 [Updated on 02-04-18] Boolean Algebra and Logic Gates Dr Hashim Ali Spring 2018 Department of Computer Science and Engineering HITEC University Taxila!1 Overview What

More information

Combinational Logic. Mantıksal Tasarım BBM231. section instructor: Ufuk Çelikcan

Combinational Logic. Mantıksal Tasarım BBM231. section instructor: Ufuk Çelikcan Combinational Logic Mantıksal Tasarım BBM23 section instructor: Ufuk Çelikcan Classification. Combinational no memory outputs depends on only the present inputs expressed by Boolean functions 2. Sequential

More information

King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department

King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department Page 1 of 13 COE 202: Digital Logic Design (3-0-3) Term 112 (Spring 2012) Final

More information

Chapter 2: Boolean Algebra and Logic Gates

Chapter 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 information

ELCT201: DIGITAL LOGIC DESIGN

ELCT201: 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 information

S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques s complement 2 s complement 1 s complement

S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques s complement 2 s complement 1 s complement S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques Time: 3 Hrs.] Prelim Question Paper Solution [Marks : Q.(a) (i) () (2) s COMPLEMENT s COMPLEMENT 2s COMPLEMENT 2s COMPLEMENT + Q.(a) (ii) ()

More information

S.E. Sem. III [ETRX] Digital Circuit Design. t phl. Fig.: Input and output voltage waveforms to define propagation delay times.

S.E. Sem. III [ETRX] Digital Circuit Design. t phl. Fig.: Input and output voltage waveforms to define propagation delay times. S.E. Sem. III [ETRX] Digital ircuit Design Time : 3 Hrs.] Prelim Paper Solution [Marks : 80. Solve following : [20].(a) Explain characteristics of logic families. [5] haracteristics of logic families are

More information

ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES

ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES EC 216(R-15) Total No. of Questions :09] [Total No. of Pages : 02 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 2016 First Semester ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN

More information

PART-A. 2. Expand ASCII and BCD ASCII American Standard Code for Information Interchange BCD Binary Coded Decimal

PART-A. 2. Expand ASCII and BCD ASCII American Standard Code for Information Interchange BCD Binary Coded Decimal PART-A 1. What is radix? Give the radix for binary, octal, decimal and hexadecimal Radix is the total number of digits used in a particular number system Binary - 2 (0,1) Octal - 8 (0 to 7) Decimal - 10

More information

Chapter 2 Boolean Algebra and Logic Gates

Chapter 2 Boolean Algebra and Logic Gates Chapter 2 Boolean Algebra and Logic Gates The most common postulates used to formulate various algebraic structures are: 1. Closure. N={1,2,3,4 }, for any a,b N we obtain a unique c N by the operation

More information

KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE

KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE Estd-1984 KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE 641 006 QUESTION BANK UNIT I PART A ISO 9001:2000 Certified 1. Convert (100001110.010) 2 to a decimal number. 2. Find the canonical SOP for the function

More information

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) State any two Boolean laws. (Any 2 laws 1 mark each)

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) State any two Boolean laws. (Any 2 laws 1 mark each) Subject Code: 17333 Model Answer Page 1/ 27 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

More information

ELEN Electronique numérique

ELEN Electronique numérique ELEN0040 - Electronique numérique Patricia ROUSSEAUX Année académique 2014-2015 CHAPITRE 3 Combinational Logic Circuits ELEN0040 3-4 1 Combinational Functional Blocks 1.1 Rudimentary Functions 1.2 Functions

More information

Design of Sequential Circuits

Design of Sequential Circuits Design of Sequential Circuits Seven Steps: Construct a state diagram (showing contents of flip flop and inputs with next state) Assign letter variables to each flip flop and each input and output variable

More information

Chap 2. Combinational Logic Circuits

Chap 2. Combinational Logic Circuits Overview 2 Chap 2. Combinational Logic Circuits Spring 24 Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 Circuit Optimization Two-Level Optimization

More information

Philadelphia University Student Name: Student Number:

Philadelphia University Student Name: Student Number: Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, Second Semester: 2015/2016 Dept. of Computer Engineering Course Title: Logic Circuits Date: 08/06/2016

More information

SAU1A FUNDAMENTALS OF DIGITAL COMPUTERS

SAU1A FUNDAMENTALS OF DIGITAL COMPUTERS SAU1A FUNDAMENTALS OF DIGITAL COMPUTERS Unit : I - V Unit : I Overview Fundamentals of Computers Characteristics of Computers Computer Language Operating Systems Generation of Computers 2 Definition of

More information

DIGITAL LOGIC CIRCUITS

DIGITAL LOGIC CIRCUITS DIGITAL LOGIC CIRCUITS Introduction Logic Gates Boolean Algebra Map Specification Combinational Circuits Flip-Flops Sequential Circuits Memory Components Integrated Circuits Digital Computers 2 LOGIC GATES

More information

Section 3: Combinational Logic Design. Department of Electrical Engineering, University of Waterloo. Combinational Logic

Section 3: Combinational Logic Design. Department of Electrical Engineering, University of Waterloo. Combinational Logic Section 3: Combinational Logic Design Major Topics Design Procedure Multilevel circuits Design with XOR gates Adders and Subtractors Binary parallel adder Decoders Encoders Multiplexers Programmed Logic

More information

/ M Morris Mano Digital Design Ahmad_911@hotmailcom / / / / wwwuqucscom Binary Systems Introduction - Digital Systems - The Conversion Between Numbering Systems - From Binary To Decimal - Octet To Decimal

More information

Adders, subtractors comparators, multipliers and other ALU elements

Adders, subtractors comparators, multipliers and other ALU elements CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Adders 2 Circuit Delay Transistors have instrinsic resistance and capacitance

More information

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

EE40 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 information

MODEL ANSWER SUMMER 17 EXAMINATION Subject Title: Principles of Digital Techniques

MODEL ANSWER SUMMER 17 EXAMINATION Subject Title: Principles of Digital Techniques MODEL ANSWER SUMMER 17 EXAMINATION Subject Title: Principles of Digital Techniques Subject Code: Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word

More information

For smaller NRE cost For faster time to market For smaller high-volume manufacturing cost For higher performance

For smaller NRE cost For faster time to market For smaller high-volume manufacturing cost For higher performance University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences EECS5 J. Wawrzynek Spring 22 2/22/2. [2 pts] Short Answers. Midterm Exam I a) [2 pts]

More information

MC9211 Computer Organization

MC9211 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 information

Sequential Logic Worksheet

Sequential Logic Worksheet Sequential Logic Worksheet Concept Inventory: Notes: D-latch & the Dynamic Discipline D-register Timing constraints for sequential circuits Set-up and hold times for sequential circuits 6.004 Worksheet

More information

3. Complete the following table of equivalent values. Use binary numbers with a sign bit and 7 bits for the value

3. 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 information

Lab 3 Revisited. Zener diodes IAP 2008 Lecture 4 1

Lab 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 information

UNIVERSITI TENAGA NASIONAL. College of Information Technology

UNIVERSITI 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 information

04. What is the Mod number of the counter circuit shown below? Assume initially reset.

04. What is the Mod number of the counter circuit shown below? Assume initially reset. . Which of the following is the state diagram for the Meale machine shown below. 4. What is the Mod number of the counter circuit shown below? Assume initiall reset. input CLK D output D D a. b. / / /

More information

LOGIC CIRCUITS. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.

LOGIC CIRCUITS. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D. Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Digital IC packages TTL (transistor-transistor

More information

ECE 2300 Digital Logic & Computer Organization

ECE 2300 Digital Logic & Computer Organization ECE 23 Digital Logic & Computer Organization Spring 28 Combinational Building Blocks Lecture 5: Announcements Lab 2 prelab due tomorrow HW due Friday HW 2 to be posted on Thursday Lecture 4 to be replayed

More information

Fundamentals of Boolean Algebra

Fundamentals of Boolean Algebra UNIT-II 1 Fundamentals of Boolean Algebra Basic Postulates Postulate 1 (Definition): A Boolean algebra is a closed algebraic system containing a set K of two or more elements and the two operators and

More information

Chapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.

Chapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr. Chapter 4 Dr. Panos Nasiopoulos Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. Sequential: In addition, they include storage elements Combinational

More information

Digital Electronics. Part A

Digital Electronics. Part A Digital Electronics Final Examination Part A Winter 2004-05 Student Name: Date: lass Period: Total Points: Multiple hoice Directions: Select the letter of the response which best completes the item or

More information

Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3

Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3 Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 Basic Logic Gates XOR CMPE12 Summer 2009 02-2 Truth Table The most basic representation of a logic function Lists the output for all possible

More information

CMPT-150-e1: Introduction to Computer Design Final Exam

CMPT-150-e1: Introduction to Computer Design Final Exam CMPT-150-e1: Introduction to Computer Design Final Exam April 13, 2007 First name(s): Surname: Student ID: Instructions: No aids are allowed in this exam. Make sure to fill in your details. Write your

More information

NTE74HC173 Integrated Circuit TTL High Speed CMOS, 4 Bit D Type Flip Flop with 3 State Outputs

NTE74HC173 Integrated Circuit TTL High Speed CMOS, 4 Bit D Type Flip Flop with 3 State Outputs NTE74HC173 Integrated Circuit TTL High Speed CMOS, 4 Bit D Type Flip Flop with 3 State Outputs Description: The NTE74HC173 is an high speed 3 State Quad D Type Flip Flop in a 16 Lead DIP type package that

More information

EECS150 - Digital Design Lecture 11 - Shifters & Counters. Register Summary

EECS150 - Digital Design Lecture 11 - Shifters & Counters. Register Summary EECS50 - Digital Design Lecture - Shifters & Counters February 24, 2003 John Wawrzynek Spring 2005 EECS50 - Lec-counters Page Register Summary All registers (this semester) based on Flip-flops: q 3 q 2

More information

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing

Boolean 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 information

Cs302 Quiz for MID TERM Exam Solved

Cs302 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 information

Combinational Logic. Jee-Hwan Ryu. School of Mechanical Engineering Korea University of Technology and Education

Combinational Logic. Jee-Hwan Ryu. School of Mechanical Engineering Korea University of Technology and Education MEC5 디지털공학 Combinational Logic Jee-Hwan Ryu School of Mechanical Engineering Combinational circuits Outputs are determined from the present inputs Consist of input/output variables and logic gates inary

More information

Shift Register Counters

Shift Register Counters Shift Register Counters Shift register counter: a shift register with the serial output connected back to the serial input. They are classified as counters because they give a specified sequence of states.

More information

Digital Techniques. Figure 1: Block diagram of digital computer. Processor or Arithmetic logic unit ALU. Control Unit. Storage or memory unit

Digital Techniques. Figure 1: Block diagram of digital computer. Processor or Arithmetic logic unit ALU. Control Unit. Storage or memory unit Digital Techniques 1. Binary System The digital computer is the best example of a digital system. A main characteristic of digital system is its ability to manipulate discrete elements of information.

More information

Vidyalankar S.E. Sem. III [ETRX] Digital Circuits and Design Prelim Question Paper Solution

Vidyalankar S.E. Sem. III [ETRX] Digital Circuits and Design Prelim Question Paper Solution S.E. Sem. III [ETRX] Digital Circuits and Design Prelim uestion Paper Solution. (a) Static Hazard Static hazards have two cases: static and static. static- hazard exists when the output variable should

More information

Systems I: Computer Organization and Architecture

Systems I: Computer Organization and Architecture Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept

More information

Adders, subtractors comparators, multipliers and other ALU elements

Adders, subtractors comparators, multipliers and other ALU elements CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Instructor: Mohsen Imani UC San Diego Slides from: Prof.Tajana Simunic Rosing

More information

EECS150 - Digital Design Lecture 18 - Counters

EECS150 - Digital Design Lecture 18 - Counters EECS150 - Digital Design Lecture 18 - Counters October 24, 2002 John Wawrzynek Fall 2002 EECS150 - Lec18-counters Page 1 Counters Special sequential circuits (FSMs) that sequence though a set outputs.

More information

EECS150 - Digital Design Lecture 18 - Counters

EECS150 - Digital Design Lecture 18 - Counters EECS50 - Digital Design Lecture 8 - Counters October 24, 2002 John Wawrzynek Fall 2002 EECS50 - Lec8-counters Page Counters Special sequential circuits (FSMs) that sequence though a set outputs. Examples:

More information

Number System conversions

Number System conversions Number System conversions Number Systems The system used to count discrete units is called number system. There are four systems of arithmetic which are often used in digital electronics. Decimal Number

More information

UNIT 8A Computer Circuitry: Layers of Abstraction. Boolean Logic & Truth Tables

UNIT 8A Computer Circuitry: Layers of Abstraction. Boolean Logic & Truth Tables UNIT 8 Computer Circuitry: Layers of bstraction 1 oolean Logic & Truth Tables Computer circuitry works based on oolean logic: operations on true (1) and false (0) values. ( ND ) (Ruby: && ) 0 0 0 0 0 1

More information

CPE100: Digital Logic Design I

CPE100: Digital Logic Design I Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Final Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Tuesday Dec 12 th 13:00-15:00 (1-3pm) 2 hour

More information

NTE74177 Integrated Circuit TTL 35Mhz Presettable Binary Counter/Latch

NTE74177 Integrated Circuit TTL 35Mhz Presettable Binary Counter/Latch NTE74177 Integrated Circuit TTL 35Mhz Presettable Binary Counter/Latch Description: The NTE74177 is a high speed monolithic counter in a 14 Lead plastic DIP type package consisting of four DC coupled master

More information

CHAPTER1: Digital Logic Circuits Combination Circuits

CHAPTER1: 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 information

Chapter 7 Logic Circuits

Chapter 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 information

Adders allow computers to add numbers 2-bit ripple-carry adder

Adders allow computers to add numbers 2-bit ripple-carry adder Lecture 12 Logistics HW was due yesterday HW5 was out yesterday (due next Wednesday) Feedback: thank you! Things to work on: ig picture, ook chapters, Exam comments Last lecture dders Today Clarification

More information

COSC3330 Computer Architecture Lecture 2. Combinational Logic

COSC3330 Computer Architecture Lecture 2. Combinational Logic COSC333 Computer rchitecture Lecture 2. Combinational Logic Instructor: Weidong Shi (Larry), PhD Computer Science Department University of Houston Today Combinational Logic oolean lgebra Mux, DeMux, Decoder

More information

Philadelphia University Student Name: Student Number:

Philadelphia 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 information

CMSC 313 Lecture 17. Focus Groups. Announcement: in-class lab Thu 10/30 Homework 3 Questions Circuits for Addition Midterm Exam returned

CMSC 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 information

Chapter 7. Sequential Circuits Registers, Counters, RAM

Chapter 7. Sequential Circuits Registers, Counters, RAM Chapter 7. Sequential Circuits Registers, Counters, RAM Register - a group of binary storage elements suitable for holding binary info A group of FFs constitutes a register Commonly used as temporary storage

More information

EECS150 - Digital Design Lecture 17 - Sequential Circuits 3 (Counters)

EECS150 - Digital Design Lecture 17 - Sequential Circuits 3 (Counters) EECS150 - Digital Design Lecture 17 - Sequential Circuits 3 (Counters) March 19&21, 2002 John Wawrzynek Spring 2002 EECS150 - Lec13-seq3 version 2 Page 1 Counters Special sequential circuits (FSMs) that

More information

BOOLEAN ALGEBRA. Introduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra

BOOLEAN ALGEBRA. Introduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra BOOLEAN ALGEBRA Introduction 1854: Logical algebra was published by George Boole known today as Boolean Algebra It s a convenient way and systematic way of expressing and analyzing the operation of logic

More information

Computer Science Final Examination Friday December 14 th 2001

Computer Science Final Examination Friday December 14 th 2001 Computer Science 03 60 265 Final Examination Friday December 14 th 2001 Dr. Robert D. Kent and Dr. Alioune Ngom Last Name: First Name: Student Number: INSTRUCTIONS EXAM DURATION IS 3 HOURs. CALCULATORS,

More information