Discrete Mathematics for Computer Science   [Archived Catalog]
2015-2016 USC Lancaster Bulletin (Archived Copy)

MATH 174 - Discrete Mathematics for Computer Science

Credits: 3

Induction, complexity, elementary counting, combinations and permutations, recursion and recurrence relations, graphs and trees; discussion of the design and analysis of algorithms--with emphasis on sorting and searching.

Prerequisites: C or better in any 100-level MATH course or placement through either version of the Mathematics Placement Test: http://assess.math.sc.edu/

Print-Friendly Page.Print-Friendly Page
Close Window