Discrete Computational Structures II

Catalog description

Discussion of concepts of discrete computational structures. Application of matrix theory to linear transformations. Discussion of counting techniques and combinatorial analysis in the principles of discrete probability. Application of Boolean algebra and Karnaugh maps in the simplification of Boolean functions and combinatorial circuits. Analysis of relations and functions. Discussion of social, ethical, or legal situations in the discipline. Requires 45 lecture-laboratory hours.