Read our cookies policy and privacy statement for more information.
×Centreville, Virginia
This course continues the discussion begun in Discrete Mathematics I ( MATH 225 ) and serves to develop students understanding of the discrete mathematical concepts that underlie computer science. Topics in this second course include recurrence relations, graphs, paths and circuits, trees and optimization and matching theory.
Units: 3.0