Schedule. ECEN 301 Discussion #25 Final Review 1. Date Day Class No. 1 Dec Mon 25 Final Review. Title Chapters HW Due date. Lab Due date.
|
|
- Wilfred Goodwin
- 5 years ago
- Views:
Transcription
1 Schedule Date Day Class No. Dec Mon 25 Final Review 2 Dec Tue 3 Dec Wed 26 Final Review Title Chapters HW Due date Lab Due date LAB 8 Exam 4 Dec Thu 5 Dec Fri Recitation HW 6 Dec Sat 7 Dec Sun 8 Dec Mon 27 Final Review 9 Dec Tue LAB 9 ECEN 3 Discussion #25 Final Review
2 Summary Jacob 6:2 2 O be wise; what can I say more? ECEN 3 Discussion #25 Final Review 2
3 Lecture 25 Final Review ECEN 3 Discussion #25 Final Review 3
4 Final Exam 7 2 December Chapters 2 6, 8, questions 3 multiple choice (answer on bubble sheet!) point each long answer (show your work!) 4 or 5 points each Closed book! Three 3x5 cards allowed Calculators allowed No time limit Study lecture slides and homework ECEN 3 Discussion #25 Final Review 4
5 Final Exam Review Overview. Exam Review 2. Exam 2 Review 3. Binary Numbers Signed & Unsigned Conversions 4. Logic Functions Conversions among 3 representations 5. Boolean Algebra 6. Combinational Logic 7. Sequential Logic 8. Digital to Analog Converters (DACs) ECEN 3 Discussion #25 Final Review 5
6 Binary Numbers Unsigned Binary word (B): a sequence of n s and s B = b n- b n-2 b 2 b b.b - b -2 b -(m-) b -m Binary point E: B =. (n = 8, m=4) Converting from binary (B) to decimal (D) B = b n- b n-2 b 2 b b.b - b -2 b -(m-) b -m D = b n- 2 n- + b n-2 2 n b 2 + b 2 + b b b -(m-) 2 -(m-) + b -m 2 -m ECEN 3 Discussion #25 Final Review 6
7 Binary Numbers Unsigned Example: What is. 2 in decimal? ECEN 3 Discussion #25 Final Review 7
8 Binary Numbers Unsigned Example: What is. 2 in decimal? ECEN 3 Discussion #25 Final Review 8
9 Binary Numbers Signed 3 common representations for signed integers:. Sign magnitude 2. s compliment 3. 2 s compliment Most common for computers ECEN 3 Discussion #25 Final Review 9
10 Binary Numbers Sign-Magnitude Range: 2 n Representations 2 n binary => 5 decimal The MSB encodes the sign: => -5 = + => = => - Problem Difficult addition/subtraction check signs convert to positive use adder or subtractor as required How to add two sign-magnitude numbers? Ex: + (-4) ECEN 3 Discussion #25 Final Review
11 Binary Numbers s Complement Range: 2 n Representations binary => 6 decimal => -6 => => - Problem Difficult addition/subtraction no need to check signs as before cumbersome logic circuits end-around-carry How to add to one s complement numbers? Ex: 4 + (-3) 2 n To negate a number, Invert it, bit-by-bit. MSB still encodes the sign: = + = ECEN 3 Discussion #25 Final Review
12 Binary Numbers Two s Complement Range: 2 n 2 n Representation: If number is positive or zero, normal binary representation, zeroes in upper bit(s) If number is negative, start with positive number flip every bit (i.e., take the one s complement) then add one MSB still encodes the sign: = + = (5) (9) + + ( s comp) ( s comp) (-5) (-9) ECEN 3 Discussion #25 Final Review 2
13 Binary Numbers Signed Example2: What is the 2 s complement of 2? ECEN 3 Discussion #25 Final Review 3
14 Binary Numbers Signed Example2: What is the 2 s complement of 2? (53) ( s comp) + (add ) (-53) ECEN 3 Discussion #25 Final Review 4
15 Binary Numbers Decimal to Binary Positive numbers start with empty result if decimal number is odd, prepend to result else prepend divide number by 2, throw away fractional part (INTEGER divide) if number is non-zero, go back to else you are done Negative numbers do above for positive version of number and negate result. ECEN 3 Discussion #25 Final Review 5
16 Binary Numbers Decimal to Binary Example3: convert -95 to 2 s complement binary notation ECEN 3 Discussion #25 Final Review 6
17 Binary Numbers Decimal to Binary Example3: convert -95 to 2 s complement binary notation. First find positive version (95) in binary then take 2 s complement Is it odd? 95 ECEN 3 Discussion #25 Final Review 7
18 Binary Numbers Decimal to Binary Example3: convert -95 to 2 s complement binary notation. First find positive version (95) in binary then take 2 s complement Is it odd? 95 Integer division by 2: 95/2 = ECEN 3 Discussion #25 Final Review 8
19 Binary Numbers Decimal to Binary Example3: convert -95 to 2 s complement binary notation. First find positive version (95) in binary then take 2 s complement Is it odd? 95 Integer division by 2: 97/2 = ECEN 3 Discussion #25 Final Review 9
20 Binary Numbers Decimal to Binary Example3: convert -95 to 2 s complement binary notation. First find positive version (95) in binary then take 2 s complement Is it odd? 95 Integer division by 2: 48/2 = ECEN 3 Discussion #25 Final Review 2
21 Binary Numbers Decimal to Binary Example3: convert -95 to 2 s complement binary notation. First find positive version (95) in binary then take 2 s complement Is it odd? 95 Integer division by 2: 24/2 = ECEN 3 Discussion #25 Final Review 2
22 Binary Numbers Decimal to Binary Example3: convert -95 to 2 s complement binary notation. First find positive version (95) in binary then take 2 s complement Integer division by 2: 2/2 = 6 Is it odd? ECEN 3 Discussion #25 Final Review 22
23 Binary Numbers Decimal to Binary Example3: convert -95 to 2 s complement binary notation. First find positive version (95) in binary then take 2 s complement Integer division by 2: 6/2 = 3 Is it odd? ECEN 3 Discussion #25 Final Review 23
24 Binary Numbers Decimal to Binary Example3: convert -95 to 2 s complement binary notation. First find positive version (95) in binary then take 2 s complement Integer division by 2: 3/2 =.5 Is it odd? ECEN 3 Discussion #25 Final Review 24
25 Binary Numbers Decimal to Binary Example3: convert -95 to 2 s complement binary notation. First find positive version (95) in binary then take 2 s complement Integer division by 2: /2 =.5 Is it odd? ECEN 3 Discussion #25 Final Review 25
26 Binary Numbers Decimal to Binary Example3: convert -95 to 2 s complement binary notation. First find positive version (95) in binary then take 2 s complement Is it odd? s complement ECEN 3 Discussion #25 Final Review 26
27 Hexadecimal Notation Binary is hard to read and write by hand Hexadecimal is a common alternative 6 digits are ABCDEF = x478f = xdead = xbeef = xa5a5. Separate binary code into groups of 4 bits (starting from the right) 2. Translate each group into a single hex digit x is a common prefix for writing numbers which means hexadecimal Binary Hex Dec A B C 2 D 3 E 4 F 5 ECEN 3 Discussion #2 Boolean Algebra 27
28 Binary Numbers Hexadecimal Example4: convert 2 to hexadecimal notation ECEN 3 Discussion #25 Final Review 28
29 Binary Numbers Hexadecimal Example4: convert 2 to hexadecimal notation 7 ECEN 3 Discussion #25 Final Review 29
30 Binary Numbers Hexadecimal Example4: convert 2 to hexadecimal notation D 7 ECEN 3 Discussion #25 Final Review 3
31 Binary Numbers Hexadecimal Example4: convert 2 to hexadecimal notation 4 D 7 ECEN 3 Discussion #25 Final Review 3
32 Binary Numbers Hexadecimal Example4: convert 2 to hexadecimal notation F 4 D 7 ECEN 3 Discussion #25 Final Review 32
33 Binary Numbers Hexadecimal Example4: convert 2 to hexadecimal notation 8 F 4 D 7 ECEN 3 Discussion #25 Final Review 33
34 Binary Numbers Hexadecimal Example4: convert 2 to hexadecimal notation A 8 F 4 D 7 ECEN 3 Discussion #25 Final Review 34
35 Binary Numbers Hexadecimal Example4: convert 2 to hexadecimal notation 3 A 8 F 4 D 7 NB: add a leading zero to complete 4 bits ECEN 3 Discussion #25 Final Review 35
36 Binary Numbers Hexadecimal Example4: convert 2 to hexadecimal notation x3a8f4d7 ECEN 3 Discussion #25 Final Review 36
37 Binary Numbers Example5: Complete the following table Unsigned Sign-magitude s complement 2 s complement HE ECEN 3 Discussion #25 Final Review 37
38 Binary Numbers Example5: Complete the following table Unsigned Sign-magitude s complement 2 s complement HE x xeb 93 x5d -93 NA xa3 ECEN 3 Discussion #25 Final Review 38
39 Logic Functions 3 different ways to represent logic functions:. Equation: a mathematical representation of a logic function A bar over a variable represent an inverting or a NOT operation out sab sab sab sab Final logic output Each letter variable represents a top-level input to the logic function Mathematical operations (i.e. addition and multiplication) are boolean algebra operations ECEN 3 Discussion #25 Final Review 39
40 Logic Functions 3 different ways to represent logic functions: 2. Gates: a visual block representation of the function Top-level inputs Final output Four 3-input AND gates feeding into one 4-input OR gate ECEN 3 Discussion #25 Final Review 4
41 Logic Functions 3 different ways to represent logic functions: 3. Truth Table: indicates what the output will be for every possible input combination A B C Z If there are n inputs (left-hand columns) there will be 2 n entries (rows) in the table E: 3 inputs require 2 3 = 8 rows There will always be at least one output (right-hand columns) For each input combination (row) output(s) will be either or ECEN 3 Discussion #25 Final Review 4
42 Logic Functions Gates Type Symbol Equation Truth Table NOT OUT IN IN OUT A B OUT AND OUT A B OR OUT A B A B OUT ECEN 3 Discussion #25 Final Review 42
43 Logic Functions Gates Type Symbol Equation Truth Table A B OUT NAND OUT A B A B OUT NOR OUT A B ECEN 3 Discussion #25 Final Review 43
44 Logic Functions Translation These are three different ways of representing logical information A B Logic Equations You can convert any one of them to any other Logic Gates Truth Tables A B OUT ECEN 3 Discussion #25 Final Review 44
45 Equations to Gates y NOT( s) AND a AND NOT( b) OR y s a b s s a b y a y OR b s a y b ECEN 3 Discussion #25 Final Review 45
46 Logic Functions Gates to Equations out out s a b s a b s a b s a b out ( s a b) ( s a b) ( s a b) ( s a b) OR sab sab sab sab ECEN 3 Discussion #25 Final Review 46
47 Logic Functions Truth Tables to Gates Each row of truth table is an AND gate Each output column is an OR gate S A B OUT s a b s a b s a b s a b out ECEN 3 Discussion #25 Final Review 47
48 Logic Functions Truth Table to Equations Write out truth table a combination of AND s and OR s equivalent to gates easily converted to gates S A B OUT out sab sab sab sab ECEN 3 Discussion #25 Final Review 48
49 Logic Functions Equations to Truth Tables For each AND term fill in the proper row on the truth table out sab sab sab sab S A B OUT ECEN 3 Discussion #25 Final Review 49
50 ECEN 3 Discussion #25 Final Review 5 Boolean Algebra Rules Z Y Z Z Y Y Y Y Z Y Z Y Y Z ) ( ) ( 7. ) ( Z Y Z Y Z Y Z Y Z Y Z Y Y Y Y Y ) ( 4. ) ( ) ( 3. ) ( ) ( 2...
51 Boolean Algebra DeMorgan s Law To distribute the bar, change the operation. A B A B NOR Symbols A B A B NAND Symbols ECEN 3 Discussion #25 Final Review 5
52 Boolean Algebra Example6: simplify the following function OUT ABD ABD BCD ACD ECEN 3 Discussion #25 Final Review 52
53 Boolean Algebra Example6: simplify the following function OUT ABD ABD BCD ACD Rule 4 OUT AD B B BCD ACD Rule 4 OUT AD BCD ACD Rule 4 OUT D A AC BCD Rule 8 OUT D A C BCD Rule 4 OUT AD CD BCD Rule 4 OUT CD( B) AD Rule 2 OUT CD AD Rule 4 OUT D A C ECEN 3 Discussion #25 Final Review 53
54 Boolean Algebra Example7: Simplify the equation created by the following truth table A B C Z ECEN 3 Discussion #25 Final Review 54
55 Boolean Algebra Example7: Simplify the equation created by the following truth table A B C Z Z ABC ABC ABC ABC ABC ABC ECEN 3 Discussion #25 Final Review 55
56 Boolean Algebra Example7: Simplify the equation created by the following truth table A B C Z Z AC Z AC Z AC Z A C Z ABC ABC ABC Z AC B B AB C AB AB A B B A ABC ABC C AB C C ABC ECEN 3 Discussion #25 Final Review 56
57 Boolean Algebra A Example8: Determine the truth table B Z C A B C Z???????? ECEN 3 Discussion #25 Final Review 57
58 Boolean Algebra A Example8: Determine the truth table x A B B Z C A B C x Z???????? ECEN 3 Discussion #25 Final Review 58
59 Boolean Algebra A Example8: Determine the truth table x A B B Z C A B C x x 2 Z???????? x 2 BC B C ECEN 3 Discussion #25 Final Review 59
60 Boolean Algebra A Example8: Determine the truth table x A B B Z C A B C x x 2 x 3 Z???????? x 3 A C x 2 BC B C ECEN 3 Discussion #25 Final Review 6
61 Boolean Algebra A Example8: Determine the truth table x A B B Z C A B C x x 2 x 3 Z x 3 A C x 2 BC B C Z A B BC A C ECEN 3 Discussion #25 Final Review 6
62 Boolean Algebra Example8: Determine the truth table Z A B BC A C ABC ABC ABC AC B B ABC AC ABC A C BC A C B A B C x x 2 x 3 Z ECEN 3 Discussion #25 Final Review 62
63 Combinational Logic Decoders Decode the input and signify its value by raising just one of its outputs. A decoder with n inputs has 2 n outputs W Y 2-to-4 Decoder W Y Z Z A B DECODER Symbol ECEN 3 Discussion #25 Final Review 63
64 Combinational Logic Decoders Write the truth table W Y A B W Y Z Z ECEN 3 Discussion #25 Final Review 64
65 Combinational Logic Multiplexors Connect one of its inputs to its output according to select signals A B S Useful for selecting one from a collection of data inputs. Usually has 2 n inputs and n select lines. ECEN 3 Discussion #25 Final Review 65 C MULTIPLEOR Symbol
66 Combinational Logic Multiplexors Write the truth table A B S C A B S C MULTIPLEOR Symbol ECEN 3 Discussion #25 Final Review 66
67 Sequential Logic SR Latch SR Latch with additional inputs: Enable (E) S and R can only change Q when E is Preset (PRE) regardless of S, R, or E, put Q to when PRE is Clear (CLR) regardless of S, R, E, or PRE, put Q to when CLR is CLR S Q E R PRE Precedence:. If CLR =, Q = 2. If PRE =, Q = 3. If E =, Q is set based on SR: If S = and R =, Q = held If S = and R =, Q = If S = and R =, Q = If S = and R =, Q = unstable 4. Else Q is held Q CLR PRE R S E SR can only change Q only in blue regions (where E = ) BUT CLR and PRE will change Q ANYTIME ECEN 3 Discussion #25 Final Review 67
68 Sequential Logic D Latch D Latch has only 2 states: Set (set Q to ): D = Reset (reset Q to ): D = D Latch with enable (E): Q can only change when E = D E S E R Q D E Q E D Q new Q old Q old Q D E D can only change Q only in blue regions (where E = ) ECEN 3 Discussion #25 Final Review 68
69 Sequential Logic D Flip-Flop D FF: 2 SR latches in master/slave configuration. The output (Q) changes on the rising clock edge Master Slave D S Q S Q Q D Q R Q R E E Q D D Q new D can only change Q only on rising clock edge (arrows) ECEN 3 Discussion #25 Final Review 69
70 Sequential Logic JK Flip-Flop JK FF: 2 SR latches in master/slave configuration. The output (Q) changes on the falling clock edge JK FF has 4 allowed states: Present state (keep Q as is): J =, K = Reset (reset Q to ): J =, K = Set (set Q to ): J =, K = Toggle (set Q to Q): J =, K = J K Q new Q old Q old J S E Q S E Q Q J Q K K R Q R Q Indicates falling clock edge ECEN 3 Discussion #25 Final Review 7
71 Sequential Logic T Flip-Flop T FF: JK FF with J and K inputs connected T FF has 2 allowed states: Present state (keep Q as is): T = Toggle (set Q to Q): T = T Q new Q old Q old T J Q K Q T Q ECEN 3 Discussion #25 Final Review 7
72 Sequential Logic Digital Counters Ripple counter: with N bits, cycles through the numbers from to 2 N N JK FFs cascaded together to produce an N-bit up counter J Q J Q J Q NB: for 3-bit counter we need 3 FFs K K B 2 B B K B 2 B B ECEN 3 Discussion #25 Final Review 72
73 Sequential Logic Digital Counters Synchronous counter: with N bits, cycles through the numbers from to 2 N Input clock drives all FFs simultaneously B B B 2 B 2 T Q T Q T Q B B ECEN 3 Discussion #25 Final Review 73
74 Sequential Logic Example9: Assuming the outputs of the following circuit start in a state, determine the outputs for 4 clock cycles Q 2 Q Q J Q K T Q D Q ECEN 3 Discussion #25 Final Review 74
75 Sequential Logic Example9: Assuming the outputs of the following circuit start in a state, determine the outputs for 4 clock cycles. Set outputs to 2. Based on output values change FF inputs 3. On each clock cycle: a) change FF outputs based on inputs b) Change FF inputs based on new outputs J Q K J K Q new Q 2 Q Q T Q D Q Q old Q old T Q new Q old Q old D Q new ECEN 3 Discussion #25 Final Review 75
76 Sequential Logic Example9: Assuming the outputs of the following circuit start in a state, determine the outputs for 4 clock cycles. Set outputs to 2. Based on output values change FF inputs 3. On each clock cycle: a) change ALL FF outputs based on inputs J Q K J K Q new Q 2 Q Q T Q D Q Q old Q old T Q new Q old Q old D Q new ECEN 3 Discussion #25 Final Review 76
77 Sequential Logic Example9: Assuming the outputs of the following circuit start in a state, determine the outputs for 4 clock cycles. Set outputs to 2. Based on output values change FF inputs 3. On each clock cycle: a) change ALL FF outputs based on inputs b) Change ALL FF inputs based on new outputs J Q K J K Q new Q 2 Q Q T Q D Q Q old Q old T Q new Q old Q old D Q new ECEN 3 Discussion #25 Final Review 77
78 Sequential Logic Example9: Assuming the outputs of the following circuit start in a state, determine the outputs for 4 clock cycles Cycle Q 2 Q Q start Inputs changed due to outputs J Q K J K Q new Q 2 Q Q T Q D Q Q old Q old T Q new Q old Q old D Q new ECEN 3 Discussion #25 Final Review 78
79 Sequential Logic Example9: Assuming the outputs of the following circuit start in a state, determine the outputs for 4 clock cycles Cycle Q 2 Q Q start Outputs change on new clock cycle J Q K J K Q new Q 2 Q Q T Q D Q Q old Q old T Q new Q old Q old D Q new ECEN 3 Discussion #25 Final Review 79
80 Sequential Logic Example9: Assuming the outputs of the following circuit start in a state, determine the outputs for 4 clock cycles Cycle Q 2 Q Q start J Q K Q 2 Q Q T Q D Q Inputs changed due to outputs J K Q new Q old T Q new Q old Q old D Q new Q old ECEN 3 Discussion #25 Final Review 8
81 Sequential Logic Example9: Assuming the outputs of the following circuit start in a state, determine the outputs for 4 clock cycles Cycle Q 2 Q Q start 2 Outputs change on new clock cycle J Q K J K Q new Q old Q old Q 2 Q Q T Q new Q old Q old D Q new ECEN 3 Discussion #25 Final Review 8 T Q D Q
82 Sequential Logic Example9: Assuming the outputs of the following circuit start in a state, determine the outputs for 4 clock cycles Cycle Q 2 Q Q start 2 J Q K Q 2 Q Q T Q D Q Inputs changed due to outputs J K Q new Q old T Q new Q old Q old D Q new Q old ECEN 3 Discussion #25 Final Review 82
83 Sequential Logic Example9: Assuming the outputs of the following circuit start in a state, determine the outputs for 4 clock cycles Cycle Q 2 Q Q start 2 3 Outputs change on new clock cycle J Q K J K Q new Q old Q old Q 2 Q Q T Q new Q old Q old D Q new ECEN 3 Discussion #25 Final Review 83 T Q D Q
84 Sequential Logic Example9: Assuming the outputs of the following circuit start in a state, determine the outputs for 4 clock cycles Cycle Q 2 Q Q start 2 3 J Q K Q 2 Q Q T Q D Q Inputs changed due to outputs J K Q new Q old T Q new Q old Q old D Q new Q old ECEN 3 Discussion #25 Final Review 84
85 Sequential Logic Example9: Assuming the outputs of the following circuit start in a state, determine the outputs for 4 clock cycles Cycle Q 2 Q Q start J Q K Q 2 Q Q T Q D Q Outputs change on new clock cycle J K Q new Q old T Q new Q old Q old D Q new Q old ECEN 3 Discussion #25 Final Review 85
86 Digital to Analog Converter (DAC) DAC: converts an unsigned binary word to an analog output voltage or current Resolution δv: minimum step size by which the output voltage (or current) can increment Output voltage v a : the analog value represented by the binary word B E: let n=4 v a = (2 3 b b b + 2 b )δv Max output voltage v amax : the maximum analog value E: let n=4 v amax = ( )δv = (2 n ) δv ECEN 3 Discussion #25 Final Review 86
87 Digital to Analog Converter (DAC) Building a DAC: use a summing amplifier v in + + R S v S R S2 v S2 R Sn R F R n- + + v o b n- b n-2 R n-2 R R F + + v a + v Sn b R b Summing amplifier DAC ECEN 3 Discussion #24 DAC 87
88 Digital to Analog Converter (DAC) Building a DAC: the analog output (v a ) is proportional to the binary word B v in b n- b n-2 b R n- R n-2 R R F + + v a Choose v a R i n i R 2 R R i F i b i v in v si in summing amplifier R b THUS v a R R F v in n i 2 i b i ECEN 3 Discussion #25 Final Review 88
89 Digital to Analog Converter (DAC) Example: find the smallest resolution δv of an 8-bit DAC v amax = 2V v in b n- b n-2 R n- R n-2 R F + + v a R b b R ECEN 3 Discussion #25 Final Review 89
90 Digital to Analog Converter (DAC) Example: find the smallest resolution δv of an 8-bit DAC v amax = 2V v in b n- b n-2 b b R n- R n-2 R R R F + + v a v amax v 2 v n amax n v 47. mv v amin ECEN 3 Discussion #25 Final Review 9
91 Digital to Analog Converter (DAC) Example: find the resistor values for a DAC with: range = 5V δv = V v in = 5V R F = 2kΩ v in b n- b n-2 R n- R n-2 R F + + v a R b b R ECEN 3 Discussion #25 Final Review 9
92 Digital to Analog Converter (DAC) Example: find the resistor values for a DAC with: range = 5V δv = V v in = 5V R F = 2kΩ v in b n- b n-2 b R n- R n-2 R R R F + + v a b 4 n log log 4 ( v a max 5 / log 2 v log a min 2 ) / v ECEN 3 Discussion #25 Final Review 92
93 Digital to Analog Converter (DAC) Example: find the resistor values for a DAC with: range = 5V δv = V v in = 5V R F = 2kΩ v in b n- b n-2 b b R n- R n-2 R R R F + + v a v v R a a max R R R R F R v F F a max v 2 5 k v in 3 n in i v 2 in 5 n 2 n i b i ECEN 3 Discussion #25 Final Review 93
94 Digital to Analog Converter (DAC) Example: find the resistor values for a DAC with: range = 5V δv = V v in = 5V R F = 2kΩ v in b n- b n-2 b b R n- R n-2 R R R F + + v a R R 2 2 5k 3 R i R 2 R 2 i R k R 3 R k ECEN 3 Discussion #25 Final Review 94
Numbers and Arithmetic
Numbers and Arithmetic See: P&H Chapter 2.4 2.6, 3.2, C.5 C.6 Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University Big Picture: Building a Processor memory inst register file alu
More informationSample Test Paper - I
Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:
More informationMAHARASHTRA 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 informationCombinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
More informationFundamentals of Digital Design
Fundamentals of Digital Design Digital Radiation Measurement and Spectroscopy NE/RHP 537 1 Binary Number System The binary numeral system, or base-2 number system, is a numeral system that represents numeric
More informationNumbers and Arithmetic
Numbers and Arithmetic See: P&H Chapter 2.4 2.6, 3.2, C.5 C.6 Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University Big Picture: Building a Processor memory inst register file alu
More informationChapter 14 Sequential logic, Latches and Flip-Flops
Chapter 14 Sequential logic, Latches and Flip-Flops Flops Lesson 4 JK Flip Flop Ch14L4-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 2 JK Flip-Flop ve edge triggered Output Q and
More informationS.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 informationUnit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4
Unit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4 4.1.1 Signal... 4 4.1.2 Comparison of Analog and Digital Signal... 7 4.2 Number Systems... 7 4.2.1 Decimal Number System... 7 4.2.2 Binary
More informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More informationGates and Flip-Flops
Gates and Flip-Flops Chris Kervick (11355511) With Evan Sheridan and Tom Power December 2012 On a scale of 1 to 10, how likely is it that this question is using binary?...4? What s a 4? Abstract The operation
More informationDigital Electronics Final Examination. Part A
Digital Electronics Final Examination Part A Spring 2009 Student Name: Date: Class Period: Total Points: /50 Converted Score: /40 Page 1 of 13 Directions: This is a CLOSED BOOK/CLOSED NOTES exam. Select
More informationEE40 Lec 15. Logic Synthesis and Sequential Logic Circuits
EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html
More informationDIGITAL LOGIC CIRCUITS
DIGITAL LOGIC CIRCUITS Digital logic circuits BINARY NUMBER SYSTEM electronic circuits that handle information encoded in binary form (deal with signals that have only two values, and ) Digital. computers,
More informationHakim Weatherspoon CS 3410 Computer Science Cornell University
Hakim Weatherspoon CS 3410 Computer Science Cornell University The slides are the product of many rounds of teaching CS 3410 by Professors Weatherspoon, Bala, Bracy, and Sirer. memory inst 32 register
More informationNumber System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary
Number System Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary BOOLEAN ALGEBRA BOOLEAN LOGIC OPERATIONS Logical AND Logical OR Logical COMPLEMENTATION
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Combinational logic circuits Output
More informationDigital Circuits ECS 371
Digital Circuits ECS 371 Dr. Prapun Suksompong prapun@siit.tu.ac.th Lecture 18 Office Hours: BKD 3601-7 Monday 9:00-10:30, 1:30-3:30 Tuesday 10:30-11:30 1 Announcement Reading Assignment: Chapter 7: 7-1,
More informationNumbers & Arithmetic. Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University. See: P&H Chapter , 3.2, C.5 C.
Numbers & Arithmetic Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University See: P&H Chapter 2.4-2.6, 3.2, C.5 C.6 Example: Big Picture Computer System Organization and Programming
More informationDE58/DC58 LOGIC DESIGN DEC 2014
Q.2 a. In a base-5 number system, 3 digit representations is used. Find out (i) Number of distinct quantities that can be represented.(ii) Representation of highest decimal number in base-5. Since, r=5
More informationExam for Physics 4051, October 31, 2008
Exam for Physics 45, October, 8 5 points - closed book - calculators allowed - show your work Problem : (6 Points) The 4 bit shift register circuit shown in Figure has been initialized to contain the following
More informationSynchronous Sequential Logic
1 IT 201 DIGITAL SYSTEMS DESIGN MODULE4 NOTES Synchronous Sequential Logic Sequential Circuits - A sequential circuit consists of a combinational circuit and a feedback through the storage elements in
More informationS.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 informationCHAPTER 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 information3. Complete the following table of equivalent values. Use binary numbers with a sign bit and 7 bits for the value
EGC22 Digital Logic Fundamental Additional Practice Problems. Complete the following table of equivalent values. Binary. Octal 35.77 33.23.875 29.99 27 9 64 Hexadecimal B.3 D.FD B.4C 2. Calculate the following
More informationELECTRONICS & 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 informationWORKBOOK. Try Yourself Questions. Electrical Engineering Digital Electronics. Detailed Explanations of
27 WORKBOOK Detailed Eplanations of Try Yourself Questions Electrical Engineering Digital Electronics Number Systems and Codes T : Solution Converting into decimal number system 2 + 3 + 5 + 8 2 + 4 8 +
More informationLab 3 Revisited. Zener diodes IAP 2008 Lecture 4 1
Lab 3 Revisited Zener diodes R C 6.091 IAP 2008 Lecture 4 1 Lab 3 Revisited +15 Voltage regulators 555 timers 270 1N758 0.1uf 5K pot V+ V- 2N2222 0.1uf V o. V CC V Vin s = 5 V Vc V c Vs 1 e t = RC Threshold
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 7 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 7 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering SEQUENTIAL CIRCUITS: LATCHES Overview Circuits require memory to store intermediate
More informationPhiladelphia University Faculty of Engineering
Philadelphia University Faculty of Engineering Marking Scheme Exam Paper BSc CE Logic Circuits (630211) Final Exam First semester ate: 03/02/2019 Section 1 Weighting 40% of the module total Lecturer: Coordinator:
More informationKUMARAGURU 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 informationSave from: cs. Logic design 1 st Class أستاذ المادة: د. عماد
Save from: www.uotiq.org/dep cs Logic design 1 st Class أستاذ المادة: د. عماد استاذة المادة: م.م ميساء Contents Lectured One: Number system operation 1- Decimal numbers. 2- Binary numbers. 3- Octal numbers.
More informationELEN 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 informationPhiladelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2017/2018 Dept. of Computer Engineering Course Title: Logic Circuits Date: 29/01/2018
More informationLOGIC 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 informationEE 209 Logic Cumulative Exam Name:
EE 209 Logic Cumulative Exam Name: 1.) Answer the following questions as True or False a.) A 4-to-1 multiplexer requires at least 4 select lines: true / false b.) An 8-to-1 mux and no other logi can be
More informationDepartment 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 informationFundamentals 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 informationSequential Logic. Rab Nawaz Khan Jadoon DCS. Lecturer COMSATS Lahore Pakistan. Department of Computer Science
Sequential Logic Rab Nawaz Khan Jadoon DCS COMSATS Institute of Information Technology Lecturer COMSATS Lahore Pakistan Digital Logic and Computer Design Sequential Logic Combinational circuits with memory
More informationReg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering
Sp 6 Reg. No. Question Paper Code : 27156 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2015. Second Semester Computer Science and Engineering CS 6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN (Common
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 6 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter
More informationDigital Logic Appendix A
Digital Logic Appendix A Boolean Algebra Gates Combinatorial Circuits Sequential Circuits 1 Boolean Algebra George Boole ideas 1854 Claude Shannon, apply to circuit design, 1938 Describe digital circuitry
More informationThe Design Procedure. Output Equation Determination - Derive output equations from the state table
The Design Procedure Specification Formulation - Obtain a state diagram or state table State Assignment - Assign binary codes to the states Flip-Flop Input Equation Determination - Select flipflop types
More informationSystems 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 informationvidyarthiplus.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 informationBoolean Algebra. Digital Logic Appendix A. Postulates, Identities in Boolean Algebra How can I manipulate expressions?
Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits Other operations NAND A NAND B = NOT ( A ANDB) = AB NOR A NOR B = NOT ( A ORB) = A + B Truth tables What is the result of the operation
More informationDigital Circuits and Systems
EE201: Digital Circuits and Systems 4 Sequential Circuits page 1 of 11 EE201: Digital Circuits and Systems Section 4 Sequential Circuits 4.1 Overview of Sequential Circuits: Definition The circuit whose
More informationSAU1A 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 informationDHANALAKSHMI 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 informationUniversity of Florida EEL 3701 Summer 2015 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Tuesday, 30 June 2015
University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 1/13 Exam 1 May the Schwartz be with you! Instructions: Turn off all cell phones and other noise making devices Show all work on the front
More informationAppendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring
- Principles of Computer rchitecture Miles Murdocca and Vincent Heuring 999 M. Murdocca and V. Heuring -2 Chapter Contents. Introduction.2 Combinational Logic.3 Truth Tables.4 Logic Gates.5 Properties
More informationCPE100: 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 informationBoolean Algebra. Digital Logic Appendix A. Boolean Algebra Other operations. Boolean Algebra. Postulates, Identities in Boolean Algebra
Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits George Boole ideas 1854 Claude Shannon, apply to circuit design, 1938 (piirisuunnittelu) Describe digital circuitry function programming
More informationZ = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table
Lesson Objectives In this lesson, you will learn about What are combinational circuits Design procedure of combinational circuits Examples of combinational circuit design Combinational Circuits Logic circuit
More informationTotal Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18
University of Waterloo Department of Electrical & Computer Engineering E&CE 223 Digital Circuits and Systems Midterm Examination Instructor: M. Sachdev October 23rd, 2007 Total Time = 90 Minutes, Total
More informationAdders, 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 informationPhiladelphia 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 informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 4 Following the slides of Dr. Ahmed H. Madian محرم 439 ه Winter 28
More informationMC9211 Computer Organization
MC92 Computer Organization Unit : Digital Fundamentals Lesson2 : Boolean Algebra and Simplification (KSB) (MCA) (29-2/ODD) (29 - / A&B) Coverage Lesson2 Introduces the basic postulates of Boolean Algebra
More informationChapter 4. Sequential Logic Circuits
Chapter 4 Sequential Logic Circuits 1 2 Chapter 4 4 1 The defining characteristic of a combinational circuit is that its output depends only on the current inputs applied to the circuit. The output of
More informationELEC Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10)
ELEC 2200-002 Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering
More informationCSE140: Components and Design Techniques for Digital Systems. Midterm Information. Instructor: Mohsen Imani. Sources: TSR, Katz, Boriello & Vahid
CSE140: Components and Design Techniques for Digital Systems Midterm Information Instructor: Mohsen Imani Midterm Topics In general: everything that was covered in homework 1 and 2 and related lectures,
More informationKing 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 informationUNIVERSITI TENAGA NASIONAL. College of Information Technology
UNIVERSITI TENAGA NASIONAL College of Information Technology BACHELOR OF COMPUTER SCIENCE (HONS.) FINAL EXAMINATION SEMESTER 2 2012/2013 DIGITAL SYSTEMS DESIGN (CSNB163) January 2013 Time allowed: 3 hours
More informationUNIT II COMBINATIONAL CIRCUITS:
UNIT II COMBINATIONAL CIRCUITS: INTRODUCTION: The digital system consists of two types of circuits, namely (i) (ii) Combinational circuits Sequential circuits Combinational circuit consists of logic gates
More informationSequential vs. Combinational
Sequential Circuits Sequential vs. Combinational Combinational Logic: Output depends only on current input TV channel selector (-9) inputs system outputs Sequential Logic: Output depends not only on current
More informationDigital 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 informationChapter 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 informationSequential Logic Circuits
Chapter 4 Sequential Logic Circuits 4 1 The defining characteristic of a combinational circuit is that its output depends only on the current inputs applied to the circuit. The output of a sequential circuit,
More informationAppendix B. Review of Digital Logic. Baback Izadi Division of Engineering Programs
Appendix B Review of Digital Logic Baback Izadi Division of Engineering Programs bai@engr.newpaltz.edu Elect. & Comp. Eng. 2 DeMorgan Symbols NAND (A.B) = A +B NOR (A+B) = A.B AND A.B = A.B = (A +B ) OR
More informationDigital 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 informationCS61C : Machine Structures
CS 61C L15 Blocks (1) inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #15: Combinational Logic Blocks Outline CL Blocks Latches & Flip Flops A Closer Look 2005-07-14 Andy Carle CS
More informationDigital Electronic Meters
Digital Electronic Meters EIE 240 Electrical and Electronic Measurement May 1, 2015 1 Digital Signal Binary or two stages: 0 (Low voltage 0-3 V) 1 (High voltage 4-5 V) Binary digit is called bit. Group
More informationCHW 261: Logic Design
CHW 26: Logic Design Instructors: Prof. Hala Zayed Dr. Ahmed Shalaby http://www.bu.edu.eg/staff/halazayed4 http://bu.edu.eg/staff/ahmedshalaby4# Slide Digital Fundamentals Digital Concepts Slide 2 What?
More informationKing 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 of COE 22: Digital Logic Design (3--3) Term (Fall 22) Final Exam Sunday January
More informationMAHARASHTRA 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 informationon 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/ 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( 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 informationPAST EXAM PAPER & MEMO N3 ABOUT THE QUESTION PAPERS:
EKURHULENI TECH COLLEGE. No. 3 Mogale Square, Krugersdorp. Website: www. ekurhulenitech.co.za Email: info@ekurhulenitech.co.za TEL: 011 040 7343 CELL: 073 770 3028/060 715 4529 PAST EXAM PAPER & MEMO N3
More informationChapter 7 Logic Circuits
Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary
More informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION
MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC - 27001-2005 Certified) Subject Code: 12069 SUMMER 13 EXAMINATION Model Answer Important Instructions to examiners: 1) The answers should
More informationCOMBINATIONAL LOGIC FUNCTIONS
COMBINATIONAL LOGIC FUNCTIONS Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends only on the present
More informationComputers also need devices capable of Storing data and information Performing mathematical operations on such data
Sequential Machines Introduction Logic devices examined so far Combinational Output function of input only Output valid as long as input true Change input change output Computers also need devices capable
More informationECEN 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 informationDIGITAL 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 informationCs302 Quiz for MID TERM Exam Solved
Question # 1 of 10 ( Start time: 01:30:33 PM ) Total Marks: 1 Caveman used a number system that has distinct shapes: 4 5 6 7 Question # 2 of 10 ( Start time: 01:31:25 PM ) Total Marks: 1 TTL based devices
More informationChapter 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 informationEEE130 Digital Electronics I Lecture #4
EEE130 Digital Electronics I Lecture #4 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi Topics to be discussed 4-1 Boolean Operations and Expressions 4-2 Laws and Rules of Boolean
More informationECE 341. Lecture # 3
ECE 341 Lecture # 3 Instructor: Zeshan Chishti zeshan@ece.pdx.edu October 7, 2013 Portland State University Lecture Topics Counters Finite State Machines Decoders Multiplexers Reference: Appendix A of
More informationDesign 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 informationSequential Circuit Analysis
Sequential Circuit Analysis Last time we started talking about latches and flip-flops, which are basic one-bit memory units. Today we ll talk about sequential circuit analysis and design. First, we ll
More informationCPE100: Digital Logic Design I
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Midterm02 Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Thursday Nov. 16 th In normal lecture (13:00-14:15)
More informationBoolean Algebra & Logic Gates. By : Ali Mustafa
Boolean Algebra & Logic Gates By : Ali Mustafa Digital Logic Gates There are three fundamental logical operations, from which all other functions, no matter how complex, can be derived. These Basic functions
More information04. 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 informationMODEL 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 informationECE20B Final Exam, 200 Point Exam Closed Book, Closed Notes, Calculators Not Allowed June 12th, Name
C20B Final xam, 200 Point xam Closed Book, Closed Notes, Calculators Not llowed June 2th, 2003 Name Guidelines: Please remember to write your name on your bluebook, and when finished, to staple your solutions
More informationCMSC 313 Lecture 17. Focus Groups. Announcement: in-class lab Thu 10/30 Homework 3 Questions Circuits for Addition Midterm Exam returned
Focus Groups CMSC 33 Lecture 7 Need good sample of all types of CS students Mon /7 & Thu /2, 2:3p-2:p & 6:p-7:3p Announcement: in-class lab Thu /3 Homework 3 Questions Circuits for Addition Midterm Exam
More informationCS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #15: Combinational Logic Blocks 2005-07-14 CS 61C L15 Blocks (1) Andy Carle Outline CL Blocks Latches & Flip Flops A Closer Look CS
More informationWritten reexam with solutions for IE1204/5 Digital Design Monday 14/
Written reexam with solutions for IE204/5 Digital Design Monday 4/3 206 4.-8. General Information Examiner: Ingo Sander. Teacher: William Sandqvist phone 08-7904487 Exam text does not have to be returned
More information