COSC-506 Concrete Mathematics and Complexity
This course covers mathematical principles and tools used the development of algorithms and the analysis of their feasibility and performance. Topics are generally in the domain of discrete mathematics: propositional and predicate logic, mathematical proofs including induction, counting and basic probability theory, logarithmic and exponential functions, elementary graph theory, and complexity analysis. Prerequisites: none. Spring.
Other academic years
There is information about this course number in other academic years: