数电期末英文试题.doc

1. Compute (2A58) 16+(71D0) 16
2. Convert (AF3.15) 16 to base 10.
3. Convert (234)10 to base 2 and base 16
4. Write 4-bit Gray Code
5. Prove one of the DeMorgan’s Theorems:
6. Simplify the following expression:
（1）
（2）
7. Find the minimum equivalent circuit for the one shown in Figure P2.24(P169 2.24)

8. Translate the following paragraph into Chinese; (P225)
Although the Karnaugh map is one of the most efficient tools available for manually minimizing switching functions when the number of variable, n, is small, it becomes almost intractable for n greater than 4 or 5. Being a graphical technique, manipulation of K-maps is not easily implemented by computer programs.

9 The circuit in Fig.P3.1 accepts BCD inputs for the decimal digits 0 to 9. The output is to be 1 only if the input is odd. Design the minimum logic circuit to accomplish this (P236 3.4)
Logic circuit
c.
10 .Determine the function realized by the circuit of Fig.P4.24 in minterm list form. Consider B to be the MSB for the multiplexer. (P323 4.24)

11. Determine the logic function of the figure. (P408 6.26a)

12. Connect a D flip-flop in such a manner that it will perform like a clocked T flip-flop.
(P430 6.24)

13. (P421 Fig6.40)

3.3-ms pulse if Ra=3kΩand C=1uF