Digital Systems on the FE Electrical Exam
Digital systems accounts for 7 to 11% of the FE Electrical and Computer exam. This area covers the design and analysis of digital circuits from basic logic gates to microprocessor architectures. A solid grasp of Boolean algebra, sequential logic, and computer organization is essential for this section.
Number Systems and Codes
Know how to convert between binary, octal, decimal, and hexadecimal number systems. Practice binary arithmetic including addition, subtraction (using two's complement), and multiplication. Understand common codes including BCD (Binary Coded Decimal), Gray code, and ASCII. Gray code is particularly useful because adjacent values differ by only one bit, minimizing errors in digital-to-analog conversions and position encoders.
Boolean Algebra and Logic Gates
Boolean algebra provides the mathematical foundation for digital logic. The basic operations are AND, OR, and NOT. Key theorems include:
- De Morgan's Theorems: The complement of a product equals the sum of the complements (and vice versa)
- Distributive Law: A AND (B OR C) = (A AND B) OR (A AND C)
- Absorption: A OR (A AND B) = A
- Consensus: (A AND B) OR (NOT A AND C) OR (B AND C) = (A AND B) OR (NOT A AND C)
Logic gates implement Boolean operations in hardware. Know the truth tables and symbols for AND, OR, NOT, NAND, NOR, XOR, and XNOR gates. NAND and NOR are universal gates (any Boolean function can be implemented using only NAND gates or only NOR gates).
Combinational Logic Design
Combinational circuits produce outputs that depend only on the current inputs. Design methods include truth tables, Boolean expressions, and Karnaugh maps (K-maps). K-maps provide a visual method for simplifying Boolean expressions by grouping adjacent 1s in a grid representation of the truth table.
Common combinational circuits include multiplexers (select one of several inputs), demultiplexers, encoders, decoders, and adders (half adder, full adder, ripple-carry adder). Know the function and basic implementation of each.
Sequential Logic
Sequential circuits have memory and produce outputs that depend on both current inputs and past states. The basic memory element is the flip-flop.
Flip-Flop Types
- SR Flip-Flop: Set-Reset, the simplest type. S=1 sets Q=1, R=1 resets Q=0, S=R=1 is undefined.
- D Flip-Flop: Data flip-flop. Output Q follows input D at the clock edge. Most commonly used in practice.
- JK Flip-Flop: Similar to SR but J=K=1 toggles the output. No undefined state.
- T Flip-Flop: Toggle flip-flop. T=1 toggles the output at each clock edge. Useful for counters.
Know the characteristic tables, excitation tables, and timing diagrams for each flip-flop type.
State Machines
Finite state machines (FSMs) are the fundamental model for sequential circuits. A Moore machine produces outputs based only on the current state. A Mealy machine produces outputs based on both the current state and current inputs.
The design process for a state machine includes: defining the states and transitions (state diagram), creating a state table, assigning binary codes to states, deriving the next-state and output logic using flip-flop excitation tables, and implementing the circuit.
Memory Systems
Understand the hierarchy of computer memory: registers (fastest, smallest), cache, main memory (RAM), and secondary storage (disk). Know the difference between SRAM (faster, more expensive, used for cache) and DRAM (slower, less expensive, used for main memory). Understand ROM types: mask ROM, PROM, EPROM, EEPROM, and flash memory.
Memory addressing concepts include word size, address space, and memory mapping. For a memory with n address lines, the addressable space is 2 to the power of n locations.
Microprocessor Basics
Understand the basic architecture of a microprocessor: arithmetic logic unit (ALU), registers, control unit, and data/address buses. Know the fetch-decode-execute instruction cycle. Understand the concepts of instruction set architecture (CISC vs. RISC), addressing modes (immediate, direct, indirect, register), and basic assembly language operations (load, store, add, subtract, branch).
Study Strategy
Digital systems problems on the FE exam are often conceptual or require straightforward analysis (truth table verification, state diagram interpretation, number conversion). Practice K-map simplification and flip-flop analysis, as these are common problem types. Many digital systems concepts are testable as "select the correct answer" questions, making them quicker to answer than calculation-heavy problems in other sections.