ECE102 -
Objectives for First Exam
Do the
sample exams available on the web.
You are allowed to bring one page (2-sided) of information.
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, and identify overflow conditions
Represent numbers in binary
coded decimal format (BCD)
Represent characters using
ASCII format
Represent voice,
images, etc. in binary
Boolean Algebra and Combinational Logic
Define the basic logic
operations (AND, OR, NOT, NAND, NOR, 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)
Use Consensus theorem to simplify logic expressions
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
Describe the advantages of using NOR and NAND
gates compared to AND and OR
gates
Convert functional specifications (written in
English) to logic expressions
Convert
specifications written in English to a truth table
Write a logic expression as a minimum POS, minimum
SOP, canonical POS
and a canonical POS
Obtain minterm and maxterm expansions (using m/M notations or
in algebraic form)
from a truth table or an algebraic expression
Convert a minterm expansion it a maxterm expansion
and vise versa
Use m/M notation to obtain product/sum of logic expressions
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
Hardware for Arithmetic
Design logic circuits to add/subtract two's
complement numbers
Updated 09/08/2017