CS 218

DESIGN AND ANALYSIS OF ALGORITHMS

4credits
About this course

4 Units, Lecture, 3 hours; research, 3 hours. Prerequisite(s): CS 141; graduate standing. Covers efficient algorithms and data structures for problems from a variety of areas such as sorting, searching, selection, linear algebra, graph theory, and combinatorial optimization. Focuses on techniques for algorithm design (greedy, divide-and-conquer, dynamic programming) and rigorous proofs of correctness and time- and space-complexity (amortized analysis, Master Theorem). May be taken Satisfactory (S) or No Credit (NC) with consent of instructor and graduate advisor.

All available terms

Avg. GPA
No letter GPA

Other grades

PNPWSU
More course details

The course page is taking longer to load. This summary is still available.

We could not load the full course details. This summary is still available.

Still loading. This can take a moment on a slow connection.

Loading My Class Grades