CSC 280 - Logic Design and Switching Theory

Once a year
Review of Boolean algebra and combinatorial circuits. Karnaugh maps. Finite-state transducers. Deterministic and non-deterministic finite-state automata. State minimization, incompletely specified machines, testing sequences. Lattices, regular sets.

Prerequisites & Notes
CSC 110.

Credits: 3 s.h.

View Course Offering(s):