MATH 262: Discrete Methods (3) (S)

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.

Prerequisite: GE 118 Precalculus and CSC 114 Introduction to Computer Science.