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.

  • Credits: 3
  • Frequency: Every term

Prerequisites

Requirements and Grading

Between 4 and 6 programming assignments, pencil and paper assignments, 1 or 2 progress exams, and a cumulative final exam.