Read our cookies policy and privacy statement for more information.
×Denver, Colorado•
Covers the fundamentals of discrete mathematics, including: logic, sets, functions, growth of functions, algorithms, matrices, mathematical reasoning, proofs, induction, relations, graphs, trees and combinatorics. There is an emphasis on how discrete mathematics applies to computer science in general, and algorithm analysis in particular. Cross-listed with CSCI 2511.
Units: 3.0
Hours: 3 to 3