COMP 2502 Discrete Computational Structures II
Application of the theory of matrices in linear transformations. Application of count techniques and combinatory analysis in the principles of discrete probability. Application of boolean algebra and Karnaugh maps in the simplification of boolean functions and combinatory circuits. Analysis of relations and functions. Requires 45 hours of lecture-lab.
Prerequisite
COMP 2501