Please enable javascript to view this page in its intended format.
The following online computing course is not offered in every term. Please check the subject chart and/or a specific course page to see when courses are offered.
Introduction to design and analysis of algorithms. Recursion, backtracking, and exits. Sequences, linked lists and references. Binary search trees. Elementary searching and sorting. Assertions and loop invariants. Order-of-magnitude complexity. Numerical computation. Documentation, testing and debugging.
RECOMMENDATION Some programming experience (such as high-school level programming or CISC 101/3.0 or CISC 110/3.0); see Introductory Courses in Departmental Notes.