Founded in 1966

CS 1501: Algorithm Implementation

3 credits


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.


CS 0441 and CS 0445.

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.

Coures Web Page

Section (11031 & 12154): T TH 1:00PM - 2:15PM

Section (11748 & 12155): T TH 6:00PM - 7:15PM

Instructor: John Aronis
Class web page:

You are using an older browser that does not support current Web standards. Although this site is viewable in all browsers, it will look much better in a browser that supports Web standards.