Big O Notation: A mathematical notation that describes the upper-bound performance or complexity of an algorithm. Time Complexity: ... In Codeless Data Structures and Algorithms, pp. 3–17.

Design algorithms and analyze their complexity in terms of running time and space usage; Create applications that are supported by highly efficient algorithms and data structures for the task at hand; ...

Undergraduate algorithms (CSCI 3104), data structures (CSCI 2270), discrete mathematics (CSCI 2824) and two semesters of calculus, or equivalents. We will assume that the student has already taken an ...