Gemini ECE 3200 STUDY GUIDE
I have analyzed the lecture notes and the five activity sheets. Here is your ultimate cheat sheet
to conquer your ECE 3200 midterm, covering everything from base conversions to
combinational logic blocks.
I have also drafted a practice midterm for you. Since you usually prefer to work through the
problems and provide your own answers first, I have left the solutions off.
ECE 3200 Ultimate Study Guide & Cheat Sheet
1. Number Systems & Base Conversions
To solve problems like those in Activity 1, you need to be comfortable jumping between bases.
Decimal to Any Base: Repeatedly divide the decimal number by the target base. The
remainders (read from bottom to top) form the new number.
Any Base to Decimal: Multiply each digit by the base raised to the power of its position
index (starting at 0 from the right).
Example: 1101 = (1 ⋅ 2 ) + (1 ⋅ 2 ) + (0 ⋅ 2 ) + (1 ⋅ 2 ) = 8 + 4 + 0 + 1 = 13 .
3
2
1
0
2
10
Binary ↔ Hexadecimal: Group binary bits into sets of four (starting from the right). Convert
each 4-bit group to its Hex equivalent (0-9, A-F).
Arbitrary Bases: Remember that in any base N , the largest single digit is N − 1. For
example, in base 19, the letters A-I represent 10-18, making 'I' the largest digit.
2. Boolean Algebra, SOP, and POS
Activities 3 and 4 rely heavily on representing logic in different forms.
Sum of Products (SOP): Focuses on the 1 s in the truth table. Variables are ANDed
together (minterms), and those terms are ORed.
Denoted by ∑ m(x, y, . . . ).
–
A
A
A 0 is inverted ( ), a 1 is normal ( ).
Product of Sums (POS): Focuses on the 0 s in the truth table. Variables are ORed
together (maxterms), and those terms are ANDed.
Denoted by ∏ M (x, y, . . . ).
–
A
A
A 1 is inverted ( ), a 0 is normal ( ).
DeMorgan's Laws: Essential for circuit transformations.
–
–
–
A ⋅ B = A + B
–
–
–
A + B = A ⋅ B
3. Karnaugh Maps (K-Maps)
This is your primary tool for reducing Boolean equations, as seen in Week 3 and Week 4
activities.
Setup: The grid axes must follow Gray code (00, 01, 11, 10) so that only one variable
changes between adjacent cells.
Grouping Rules:
Group the 1 s for a reduced SOP expression; group the 0 s for a reduced POS
expression.
Groups must be rectangles/squares and contain 2 cells (1, 2, 4, 8, 16).
n
Groups can overlap and wrap around the edges (top to bottom, left to right).
Always aim for the largest possible groups to get the simplest equation.
4. Logic Gates & Timing Diagrams
Activity 2 and 5 test your ability to trace signals over time.
Basic Gates: Know the truth tables for AND, OR, NOT, NAND, NOR, XOR, and XNOR
inside and out.
Timing Diagrams: Read these vertically. At any specific clock edge or time segment, look
at the states of the inputs (High/Low) and pass them through your logic gates or functional
blocks to determine the output state. Watch for active-high vs. active-low enable signals
(EN).
Shutterstock
5. Combinational Logic Blocks
Activity 5 introduces medium-scale integration (MSI) components.
Multiplexer (MUX): A data selector. It has 2 data inputs, n select lines, and 1 output. The
select lines (like S , S ) act as a binary number that chooses which data input (D , D , D , D
) routes to the output.
n
1
0
0
1
2
Example: A 4:1 MUX with SEL = 0x2 (binary 10 ) will output whatever is on the D(2)
line.
3
Shutterstock
Decoder: Converts binary information from n input lines to a maximum of 2 unique output
n
lines. If the input is binary 3 (11 ), output line 3 goes active.
2
Ripple Carry Adder (RCA): Chains Full Adders together. To modify an RCA to conditionally
invert its output (like in Activity 5), you can use XOR gates. An XOR gate acts as a
–
A ⊕ 0 = A
A ⊕ 1 = A
controlled inverter:
, and
.
Practice Midterm Exam
Problem 1: Number Systems
a) Convert the decimal number 156 to binary.
10
b) Convert the binary number 101101011 to hexadecimal.
2
c) What is the decimal equivalent of the base-5 number 314 ?
5
Problem 2: Boolean Algebra & Form Conversion
Given the Boolean function: F (A, B, C) = ∑(0, 2, 5, 7)
a) Write out the standard Sum of Products (SOP) equation.
b) Express the same function using maxterms (POS format, ∏).
Problem 3: Word Problem & K-Map Reduction
A small server room has three environmental sensors: Temperature (T ), Humidity (H ), and
Smoke (S ). The alarm system (A) should trigger ( 1 ) under the following conditions:
Smoke is detected (S = 1), regardless of other sensors.
Temperature and Humidity are both high (T = 1 and H = 1).
If Humidity is high (H = 1) but Temperature and Smoke are normal, the alarm should not
trigger.
If all sensors are normal ( 0 ), the alarm is off.
a) Create the truth table for the Alarm (A).
b) Map the function to a K-Map and write the highly reduced SOP Boolean equation.
Problem 4: Multiplexer Logic
You have a 4:1 MUX. The select lines S and S are driven by a counter that cycles through
1
00, 01, 10, 11
0
sequentially. The data inputs are hardwired as follows:
.
D0 = 1, D1 = 0, D2 = 1, D3 = 1
a) Sketch or describe the output F over one full cycle of the select lines.
b) Write the Boolean equation for F in terms of the select lines S and S .
1
0
Problem 5: Combinational Design
Design a logic circuit using a standard 4-bit Ripple Carry Adder (RCA) and any necessary basic
logic gates. The circuit has two 4-bit inputs (A and B) and a control line SU B.
When SU B = 0, the circuit should output A + B.
When SU B = 1, the circuit should output A − B (using 2's complement arithmetic). Hint:
Think about how you can invert the bits of B and add 1 when subtracting.
Whenever you're ready, drop your answers to the practice exam here, and we can go over them
one at a time. Would you like to start with Problem 1?