MATH 262 Discrete Methods

Sequences, summations, algorithm design and analysis including computational complexity, counting techniques, mathematical induction and recursion, recurrence relations/functions and recursive algorithms, combinatorics, graphs, trees, and applications.

Credits

3

Prerequisite

GE 118 Precalculus and CSC 114 Introduction to Computer Science. STUDENTS MUST PURCHASE MATHXL FOR THIS COURSE

Offered

S