ECE 201


Review for Test 2


Solutions to all HW problems already available on the web page, along with
this review.

http://www.parl.clemson.edu/~dstanzi/e201.html


Sections from New Book:
2-6,7,8, 3-1 thru 3-8, all of Chap. 4 except HDL, Chap. 7 sections 5,6, and 7.


Homework Problems:
Ch. 3: 1,3,5,6,9,11,12,14,16,18
Ch. 4: 6,8,12,25,28,33,35
Ch. 7: 15,18 a and b, 24



Relevant Web resources:
-Homework solutions
-Old test problems

Notes on transistors, integrated circuits, and logic families.

Code Conversion Example

Notes on ROMs

Notes on Possible Forms of an equation from a K-map


Topics: - Karnaugh maps!! -Know what a k-map is, its relationship to a truth table, what a prime implicant and essential prime implicant is, and how to find them! -Know how to use a Karnaugh map to find all the appropriate forms of a boolean equation (SOP,POS,AOI,OAI,etc.) -Don't care conditions

-Combinational Design and Analysis -Know how to design and analyze circuits using and's or's and inverters, with all NAND logic, with all NOR Logic, with decoders, and with muxes - Know how to put the function in the best form for one of the implementations above. Know why it's the best form. - Understand Adders/Subtractors and their use

- Know what Demuxes and Encoders are.

The most important thing you've learned in this section is how, given a problem and a type of implementation, to obtain the boolean function which provides for the most efficient realization of the circuit given your implementation constraints.

You will be allowed a 3x5 card on which to write the theorems or anything else you deem appropriate.