电子科技大学2011-2012学年第2学期期末考试B卷.docVIP

电子科技大学2011-2012学年第 二 学期期 末 考试 B 卷课程名称：_数字逻辑设计及应用__ 考试形式： 闭卷 考试日期： 20 12 年 7 月 2 日 考试时长：_120___分钟课程成绩构成：平时 30 %， 期中 30 %， 实验 0 %， 期末 40 %本试卷试题由__六___部分构成，共__6___页。题号一二三四五六七八九十合计得分得 分得 分I. Fill your answers in the blanks (2’ X 15=30’) If the two adders of a 4-bit binary adder 74x283 （Figure 1.）are (1010)two’s and (1101)two’s, its sum is not overflow. Then its input C0 should be （ ）, its sum S3S2S1S0= ( ) two’s .74x28374x283C0A0B0A1B1A2B2A3B3S0S1S2S3C475632141512114113109 Figure 1.A circuit with 4 flip-flops can store ( ) bit binary numbers, that is, include ( ) states at most. If , then FD =( ), and ( ). A modulo-20 counter circuit needs ( ) D filp-flops at least. A modulo-196 counter circuit needs ( ) 4-bit counters of 74x163 at least. An 8-bit ring counter has ( ) normal states. If we want to realize the same number normal states, we need a ( ) bit twisted-ring counter. To design aserial sequence generator by shift registers, we need a ( )-bit shift register as least.A sequential circuit whose output depends on the states and inputs is called a ( ) state machine.A 8×4 ROM stores a truth table of combinational logic function. This combinational logic function has ( ) inputs and ( ) outputs.The state diagram of a Moore state machine is shown as Figure 2. If the initiate state Q3Q2Q1Q0 is 1001, the output sequence of Q3 is （ ）.1001100100110111111111101100 Figure 2.得 分得 分II. Please select the only one correct answer in the following questions.(2’ X 5=10)1. For Johnson counter and ring counter, ( ) is correct.A. An n-bit ring counter has 2n active states.B. An n-bit Johnson counter has 2n active states.C. An n-bit ring counter has 2n-2n active states.D. An n-bit Johnson counter has 2n-n active states.2. Using 4-bit synchronous binary counter 74x163 or decade