CS 1501: Algorithm Implementations
3 credits
-
Description
This course covers a broad range of the most commonly used algorithms. Some examples include algorithms for sorting, searching, encryption, compression and local search. The students will implement and test several algorithms. The course is programming intensive.
-
Prerequisites
-
Requirements and Grading
- Between 4 and 6 programming assignments, pencil and paper assignments, 1 or 2 progress exams, and a cumulative final exam.
Recitation: A recitation associated with the selected class section is required.
Expected class size: 60 students.
Frequency: This course is offered every term.