User Tools

Site Tools


CSci 242 - Algorithms and Data Structures

Object-oriented implementations of complex data structures including lists, sets, trees, and graphs. Time and space analysis and classification of algorithms using upper bounds (big Oh), lower bounds (big Omega), and exact bounds (big Theta). Techniques for analysis of recursive algorithms including use of the “Master Theorem” for divide-and-conquer recurrences.

Credits Offered Lab Pre-requisites Recommended co-requisite
3 Spring No CSci 161, Math 208 -

csci_242_-_algorithms_and_data_structures.txt · Last modified: 2013/07/10 12:27 by jhuber