CS 309 Introduction to Digital Logic Design

This course is a comprehensive introduction to Boolean Algebra and methods for designing circuits which implement Boolean expressions. Topics include binary numbers and codes, axioms and theorems of Boolean Algebra, standard algebraic forms of Boolean expressions, the use of methods such as Karnaugh Maps and the Quine-McCluskey procedures for simplification of Boolean expression, analysis and design of combinational and sequential circuits, register operations, and introduction to fault tolerance design.

Credits

3

Corequisite

CS 309L