EE102          Exam 2           Fall 2017       


Do the sample exams available on the web.  You may want to look at Exam 2 as well as  the final exams as the latter has questions related to  the topics covered.

You are allowed to bring one page (2-sided) of information.

Objectives      

Binary Representation
State the differences between digital and analog systems
Define the term `positional number system'
Represent numbers in decimal, binary, octal and hexadecimal notations and
convert from one notation to the other
Add, subtract, multiply and divide binary numbers 
 Represent numbers in sign-magnitude, one's complement and two's complement forms
Carry out addition and subtraction of two's complement numbers, and identify overflow conditions
Represent numbers in binary coded decimal format (BCD)
Represent characters using ASCII format

Combinational Logic
Define the basic logic operations (AND, OR, NOT,  XOR)
Evaluate Boolean expressions
Derive the logic function implemented by a logic circuit
Use Laws and Theorems of Boolean Algebra to simplify logic expressions
Implement Boolean expressions  using 2-level networks (SOP, POS)
Find the complement of a  Boolean expression using DeMorgan's Law
Find the dual of a  Boolean expression
State and use the Negative Logic Theorem
Use Consensus theorem to simplify logic expressions
Convert functional specifications  (written in English)  to logic expressions
Convert specifications written in English to a truth table
Obtain minterm and maxterm expansions from a truth table
Convert a minterm expansion to a maxterm expansion and vise versa  
Find the minterm and maxterm expansions of   F', F.G, F+G where F, G are Boolean functions
Use don't care terms to simplify logic expressions
Represent 2,3,4 and 5  variable functions using Karnaugh maps
Represent expressions given in SOP, POS, maxterm or minterm form on K-map
Obtain minimum POS and SOP expansions using K-map
Derive alternative gate symbols for basic logic gates
Implement logic functions using basic 2-level forms  (NAND-NAND, AND-OR etc.)
 Convert networks from one form to another
Implement logic functions using only NOR gates or only NAND gates
Implement logic functions using multilevel networks
Design multiple-output circuits
Use tri-state logic gates in logic circuit design
Implement combinational logic expressions using multiplexers, decoders, ROMS and programmable logic

Hardware for Arithmetic
Design logic circuits to add/subtract two's complement numbers
Design logic circuits to multiply binary integers





Emphasis of exam 2 will be on the objectives in black (Chapters 3,4,5,7)  that are listed above.
A working knowledge of prior objectives covered in Exam 1 (in gray)   is taken for granted.
Number representations (binary, sign-magnitude, 1's and 2' complement,BCD, etc.),  binary  pattern representations (octal, hexadecimal),
and character representation using ASCII are fundamentals that have to be etched into any electrical or computer engineering major's memory by this time.  

10/05/2017