ELE172: DIGITAL LOGIC

• Instructor: Professor Mariusz Jankowski
  
• Email: mjankowski@usm.maine.edu
  

Review Topics and Homework Problems

For your convenience, below you will find a short list of topics you will be expected to become familiar with in the course of the semester. Use it and the accompanying selection of end-of-chapter problems as a study and review aid.

Topics:

• Binary Codes and Binary Arithmetic
  • positional notation
  • binary codes and number representations
  • simple arithmetic: addition, subtraction, multiplication (unsigned only)
    

Suggested Problems:
1: 1, 3, 4, 7, 8, 10, 12, 14

• Theoretical Foundations of Switching Functions
  • postulates and theorems of Boolean algebra
  • simple proofs and derivations
  • simplification using postulates and theorems
    

Suggested Problems:
2: 1, 3, 6-8, 12

• Combinational Circuits: Design and Analysis
  • truth tables algebraic and K-map simplification of switching functions
  • AND-OR and NAND-NAND realizations
  • decoders, multiplexers, encoders, arithmetic circuits
  • programmable devices: PROMs, GALs

Suggested Problems:
2: 17, 19, 22, 23, 25, 33, 35
3: 1, 2, 3, 7, 10, 16, 17, 32-36, 50
4: 3, 4, 6, 7, 16, 19, 24, 26, 29
5: 1, 2, 3, 4b, 5b

• Sequential Circuit: Design and Analysis
  • flip-flops: circuits, characteristic equations and tables
  • state diagrams, state and excitation tables
  • registers, counters, and registered GALs

Suggested Problems:
6: 1-5, 7-9, 11-14, 19, 24, 27, 28
7: 2, 3, 5, 8, 19 (any of signals f1, f2, f3, f4)
8: 1-30
11:1, 5, 6

Return to main Ele172: Digital Logic page