Course Description for Computational Structures II
Computational Structures II
Prerequisite: COT 3100 or MAD 3107
Description: This course covers topics in combinatorial and discrete mathematics, including permutations and combinations, binomial coefficients, recurrence relations, Fibonacci sequences, generating functions, advanced counting techniques such as inclusion exclusion, as well as coding theory, Latin squares, and graph theory. Application to various problems in mathematics and computing will be covered.