P U Q Q*

Similar documents
Note that none of the above MAY be a VALID ANSWER.

P U Q Q*

Practice Homework Solution for Module 3

Practice Homework Problems for Module 3

Digital Design, Kyung Hee Univ. Chapter 5. Synchronous Sequential Logic

Chapter 5 Synchronous Sequential Logic

The outputs are formed by a combinational logic function of the inputs to the circuit or the values stored in the flip-flops (or both).

D Latch (Transparent Latch)

Final Exam review: chapter 4 and 5. Supplement 3 and 4

Synchronous Sequential Logic. Chapter 5

Digital Circuit And Logic Design I. Lecture 8

Digital Circuit And Logic Design I

CSE115: Digital Design Lecture 23: Latches & Flip-Flops

Combinational / Sequential Logic

Unit 11. Latches and Flip-Flops

Chapter 6. Flip-Flops and Simple Flip-Flop Applications

UNIT III. Combinational Circuit- Block Diagram. Sequential Circuit- Block Diagram

Synchronous Sequential Logic

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-III SEQUENTIAL CIRCUITS

CS8803: Advanced Digital Design for Embedded Hardware

Chapter 5: Synchronous Sequential Logic

Feedback Sequential Circuits

Sequential Circuits. Output depends only and immediately on the inputs Have no memory (dependence on past values of the inputs)

2 Sequential Circuits

Asynchronous (Ripple) Counters

Digital Logic Design Sequential Circuits. Dr. Basem ElHalawany

cascading flip-flops for proper operation clock skew Hardware description languages and sequential logic

Sequential Logic Circuits

INTRODUCTION TO SEQUENTIAL CIRCUITS

More on Flip-Flops Digital Design and Computer Architecture: ARM Edition 2015 Chapter 3 <98> 98

Lecture 8: Sequential Logic

EECS 270 Final Exam Spring 2012

6. Sequential Logic Flip-Flops

Section 6.8 Synthesis of Sequential Logic Page 1 of 8

Logic and Computer Design Fundamentals. Chapter 7. Registers and Counters

problem maximum score 1 28pts 2 10pts 3 10pts 4 15pts 5 14pts 6 12pts 7 11pts total 100pts

WEEK 10. Sequential Circuits: Analysis and Design. Page 1

Combinational vs Sequential

Logic Design II (17.342) Spring Lecture Outline

Lecture 11: Synchronous Sequential Logic

1. Convert the decimal number to binary, octal, and hexadecimal.

Sequential logic. Circuits with feedback. How to control feedback? Sequential circuits. Timing methodologies. Basic registers

Unit 9 Latches and Flip-Flops. Dept. of Electrical and Computer Eng., NCTU 1

Digital Logic Design I

ECE 341. Lecture # 2

MC9211 Computer Organization

Sequential Logic. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 1

Introduction to Sequential Circuits

Introduction. NAND Gate Latch. Digital Logic Design 1 FLIP-FLOP. Digital Logic Design 1

LAB #4 SEQUENTIAL LOGIC CIRCUIT

ELCT201: DIGITAL LOGIC DESIGN

Advanced Digital Logic Design EECS 303

EECS150 - Digital Design Lecture 19 - Finite State Machines Revisited

Sequencing. Lan-Da Van ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall,

DIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute

Principles of Computer Architecture. Appendix A: Digital Logic

COE 202: Digital Logic Design Sequential Circuits Part 1. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:

Synchronous Sequential Logic

Finite State Machine Design

Experiment # 9. Clock generator circuits & Counters. Digital Design LAB

ELE2120 Digital Circuits and Systems. Tutorial Note 7

CSE Latches and Flip-flops Dr. Izadi. NOR gate property: A B Z Cross coupled NOR gates: S M S R Q M

Course Administration

FPGA Implementation of Sequential Logic

Memory elements. Topics. Memory element terminology. Variations in memory elements. Clock terminology. Memory element parameters. clock.

0 0/1 0/1 0/1 0/1 0/1 0/1 0/1 0/1 1 1 Stop bits. 11-bit Serial Data format

CHAPTER 4: Logic Circuits

CHAPTER 4: Logic Circuits

Basis of sequential circuits: the R-S latch

Software Engineering 2DA4. Slides 9: Asynchronous Sequential Circuits

Chapter 5 Flip-Flops and Related Devices

6.S084 Tutorial Problems L05 Sequential Circuits

DIGITAL TECHNICS II. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute

Switching Circuits & Logic Design

Computer Architecture and Organization

Administrative issues. Sequential logic

Experiment 8 Introduction to Latches and Flip-Flops and registers

L5 Sequential Circuit Design

YEDITEPE UNIVERSITY DEPARTMENT OF COMPUTER ENGINEERING. EXPERIMENT VIII: FLIP-FLOPS, COUNTERS 2014 Fall

CS8803: Advanced Digital Design for Embedded Hardware

Digital Circuits ECS 371

First Name Last Name November 10, 2009 CS-343 Exam 2

Flip-Flops. Because of this the state of the latch may keep changing in circuits with feedback as long as the clock pulse remains active.

Synchronous Sequential Logic

Digital Logic & Computer Design CS Professor Dan Moldovan Spring Chapter 3 :: Sequential Logic Design

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District DEPARTMENT OF INFORMATION TECHNOLOGY CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN

Chapter 5. Introduction

11. Sequential Elements

The NOR latch is similar to the NAND latch

EE292: Fundamentals of ECE

ECE321 Electronics I

Introduction to Digital Logic Missouri S&T University CPE 2210 Exam 2 Logistics

Two types of state machine as classified by output formation


RS flip-flop using NOR gate

DIGITAL SYSTEM FUNDAMENTALS (ECE421) DIGITAL ELECTRONICS FUNDAMENTAL (ECE422) LATCHES and FLIP-FLOPS

Digital Circuits and Systems

Synchronous Sequential Logic

Switching Theory And Logic Design UNIT-IV SEQUENTIAL LOGIC CIRCUITS

IT T35 Digital system desigm y - ii /s - iii

Transcription:

ECE 27 Learning Outcome 3 - - Practice Exam / Solution LEARNING OUTCOME #3: an ability to analyze and design sequential logic circuits. Multiple Choice select the single most appropriate response for each question. Note that none of the above MAY be a VALID ANSWER.. A new type of flip-flop, the PU, is described by the given PS-NS table. The characteristic equation for this flip-flop is: (A) Q* = P Q + U Q (B) Q* = P Q + U Q (C) Q* = P Q + U Q (D) Q* = P U + Q 2. The excitation required to effect a state transition of the PU flip-flop from to is: (A) P=d, U= (B) P=d, U= (C) P=, U=d (D) P=, U=d PU Flip-Flop PS-NS Table for questions and 2 P U Q Q* 3. Assuming the state machine depicted in the given state transition diagram is initialized to state, the input sequence will cause the following output sequence to be generated: (A) (B) (C) (D) State Transition Diagram for questions 3 and 4 4. The embedded binary sequence recognized by this state machine is the pattern: (A) (B) (C) (D) 22 by D. G. Meyer / Purdue University may not be copied or reproduced, in any form or by any means.

ECE 27 Learning Outcome 3-2 - Practice Exam / Solution 5. A D latch is called a transparent because: (A) the output follows the input when the latch is closed (B) the output follows the input when the latch is open (C) the output freezes when the latch is closed (D) the output freezes when the latch is open 6. Metastable behavior of an edge-triggered D flip-flop can be caused by: (A) violating its minimum setup time requirement (B) violating its minimum hold time requirement (C) violating its minimum clock pulse width requirement (D) all of the above 7. The next state equation represented by the following state transition diagram is: A X (A) X* = A X + A X (B) X* = A X + A X (C) X* = A + X (D) X* = A X 8. The initial state (after START is asserted) is: (A) (B) (C) (D) 9. The number of states in the periodic sequence (after START is asserted) is: (A) (B) 2 (C) 6 (D) 7 ABEL program for questions 8 and 9: MODULE sequencer TITLE 'Mystery Sequencer' Declarations start pin; clock pin; q2..q pin istype 'reg'; truth_table ([q2,q,q] :> [q2,q,q]) [,, ] :> [,, ]; [,, ] :> [,, ]; [,, ] :> [,, ]; [,, ] :> [,, ]; [,, ] :> [,, ]; [,, ] :> [,, ]; [,, ] :> [,, ]; [,, ] :> [,, ]; Equations [q2..q].ap = start; [q2..q].clk = clock; 22 by D. G. Meyer / Purdue University may not be copied or reproduced, in any form or by any means.

ECE 27 Learning Outcome 3-3 - Practice Exam / Solution The following circuit applies to questions through 4: A 2 3 X B 2 3 Y. If the input combination A=, B= is applied to this circuit, the (steady state) output will be: (A) X=, Y= (B) X=, Y= (C) X=, Y= (D) X=, Y= (E) unpredictable. If the input combination A=, B= is applied to this circuit, followed immediately by the input combination A=, B=, the (steady state) output will be: (A) X=, Y= (B) X=, Y= (C) X=, Y= (D) X=, Y= (E) unpredictable 2. If the input combination A=, B= is applied to this circuit, the (steady state) output will be: (A) X=, Y= (B) X=, Y= (C) X=, Y= (D) X=, Y= (E) unpredictable 3. If the input combination A=, B= is applied to this circuit, followed immediately by the input combination A=, B=, the (steady state) output will be: (A) X=, Y= (B) X=, Y= (C) X=, Y= (D) X=, Y= (E) unpredictable 4. If the propagation delay of each gate is ns, the minimum length of time that (valid) input combinations need to be asserted in order to prevent metastable behavior is: (A) ns (B) 2 ns (C) 3 ns (D) 4 ns 22 by D. G. Meyer / Purdue University may not be copied or reproduced, in any form or by any means.

ECE 27 Learning Outcome 3-4 - Practice Exam / Solution The following figure applies to questions 5 through 2: D 5 ns CLK Q Q_L 5. The duty cycle of the clocking signal is: (A) 2% (B) 33% (C) 4% (D) 67% 6. The nominal setup time provided for the D flip-flop, based on the excitation signals (D and CLK) depicted in the timing chart, is: (A) 5 ns (B) ns (C) 5 ns (D) 2 ns 7. The nominal hold time provided for the D flip-flop, based on the excitation signals (D and CLK) depicted in the timing chart, is: (A) 5 ns (B) ns (C) 5 ns (D) 2 ns 8. The nominal clock pulse width provided for the D flip-flop, based on the excitation signals (D and CLK) depicted in the timing chart, is: (A) 5 ns (B) ns (C) 5 ns (D) 2 ns 9. The t PLH(C Q) of the D flip-flop is: (A) 5 ns (B) ns (C) 5 ns (D) 2 ns 2. The t PHL(C Q) of the D flip-flop is: (A) 5 ns (B) ns (C) 5 ns (D) 2 ns 22 by D. G. Meyer / Purdue University may not be copied or reproduced, in any form or by any means.

ECE 27 Learning Outcome 3-5 - Practice Exam / Solution 2. The following ABEL program implements the state transition diagram shown below: (A) (B) (C) (D) (E) Module Prob2 Title Program A DECLARATIONS CLOCK, M pin; Q..Q2 pin istype reg ; EQUATIONS Q :=!Q; Q :=!Q $ (!M&!Q # M&Q); Q2 :=!Q2 $ (!M&!Q&!Q # M&Q&Q); [Q2..Q].CLK = CLOCK; Module Prob2 Title Program B DECLARATIONS CLOCK, M pin; Q..Q2 pin istype reg ; EQUATIONS Q :=!Q; Q := Q $ (!M&Q # M&!Q); Q2 := Q2 $ (!M&Q&Q # M&!Q&!Q); [Q2..Q].CLK = CLOCK; Module Prob2 Title Program C DECLARATIONS CLOCK, M pin; Q..Q2 pin istype reg ; EQUATIONS Q :=!Q; Q := Q $ (!M&!Q # M&Q); Q2 := Q2 $ (!M&!Q&!Q # M&Q&Q); [Q2..Q].CLK = CLOCK; all of the above none of the above 22 by D. G. Meyer / Purdue University may not be copied or reproduced, in any form or by any means.

ECE 27 Learning Outcome 3-6 - Practice Exam / Solution 22. The following timing diagram depicts the behavior of the circuit shown below: (A) (B) (C) (D) 22 by D. G. Meyer / Purdue University may not be copied or reproduced, in any form or by any means.

ECE 27 Learning Outcome 3-7 - Practice Exam / Solution 23. As a contestant on the soon-to-be-cancelled TV series Digital Moment of Truth, you have been asked to identify which of the following statements concerning state machine models is true: (A) Mealy and Moore models that represent equivalent state machines will always have the same number of states (B) Mealy and Moore models that represent equivalent state machines will always have a different number of states (C) any Mealy model can be transformed into an equivalent Moore model, and vice-versa (D) Mealy and Moore models that represent equivalent state machines, when realized, will exhibit the same observable behavior (i.e., if placed in a black box, their observable behavior would be indistinguishable) 24. As a contestant on the TV series Are You Smarter Than a Website Contractor?, you have been asked to explain why a D latch is called transparent. Hoping to forgo an admission before a national television audience to the contrary, you calmly answer that a D latch is called transparent because its output: (A) is equal to its input when the latch enable is high-impedance (B) is equal to its input when the latch enable is asserted (C) is equal to its input when the latch enable is negated (D) changes state as soon as the latch is clocked 25. The next topic over which you ve been asked to Digitally Digress with the stars of Dual Dynasty is the phenomenon of metastability. You confidently explain that the next state of an edge-triggered D flip-flop will most likely be random if: (A) its minimum setup time requirement is not met (B) its minimum hold time requirement is not met (C) its minimum clock pulse width requirement is not met (D) all of the above 26. As a contestant on the hit TV series Digital Survivor Flips vs. Flops, you have been asked to implement a negative edge-triggered D flip-flop using only 2-input NAND gates. The minimum number of gates you will need to complete this task is: (A) 9 (B) (C) (D) 2 (E) none of these 27. Your next task on Digital Survivor is to build a circuit that divides the frequency of a clocking signal by two. Provided you have successfully completed Problem 26, above, and have a working negative edge-triggered D flip-flop, the number of additional 2-input NAND gates you will need to complete this task is: (A) (B) (C) 2 (D) 3 (E) none of these 28. Your final task on Digital Survivor is to implement a finite state machine that has 22 states with as few flip-flops as possible. To reduce the number of flip-flops required in this design by one (using either obvious or formal state minimization procedures), you would have to identify and eliminate redundant state(s). (A) (B) 2 (C) 84 (D) 28 (E) none of these 22 by D. G. Meyer / Purdue University may not be copied or reproduced, in any form or by any means.

ECE 27 Learning Outcome 3-8 - Practice Exam / Solution The following ABEL program applies to questions 29 and 3: MODULE MCLEDS TITLE 'Multi-Color LED Light Machine' DECLARATIONS M pin; " mode control input Q..Q pin istype 'reg'; " state variables R,G,Y,B pin istype 'com'; " LEDs (red/green/yellow/blue) CLOCK pin; " clock input TRUTH_TABLE([Q,Q, M]:>[Q,Q]) [,, ]:>[, ]; [,, ]:>[, ]; [,, ]:>[, ]; [,, ]:>[, ]; [,, ]:>[, ]; [,, ]:>[, ]; [,, ]:>[, ]; [,, ]:>[, ]; TRUTH_TABLE([Q,Q, M]->[ R, G, Y, B]) [,, ]->[,,, ]; [,, ]->[,,, ]; [,, ]->[,,, ]; [,, ]->[,,, ]; [,, ]->[,,, ]; [,, ]->[,,, ]; [,, ]->[,,, ]; [,, ]->[,,, ]; EQUATIONS [Q..Q].CLK = CLOCK; 29. When M=, the (repeating) colored LED sequence produced will be: (A) R G Y B (B) R Y G B (C) B Y G R (D) B G Y R 3. When M=, the (repeating) colored LED sequence produced will be: (A) R RGYB RGY RG (B) R RG RGY RGYB (C) RGYB RGY RG R (D) R RGY RG RGYB -B, 2-A, 3-D, 4-B, 5-B, 6-D, 7-A, 8-D, 9-C, -C, -B, 2-D, 3-E, 4-B, 5-B, 6-A, 7-C, 8-B, 9-B, 2-A, 2-C, 22-C, 23-C, 24-B, 25-D, 26-B, 27-A, 28-C, 29-A, 3-B Answer key: 22 by D. G. Meyer / Purdue University may not be copied or reproduced, in any form or by any means.