UMass Boston

Students walk up steps to plaza through fall trees past Campus Center.
Analysis of Algorithms

Course Overview

Date / Time Location Credits Minimium Tuition*
1/26/26 - 5/13/26
TuTh 2p.m. – 3:15p.m.		 McCormack M02-0417 3 $2657 (guest students)
Date
1/26/26 - 5/13/26
Time
TuTh 2p.m. – 3:15p.m.
Location
McCormack M02-0417
Credits
3
Min. Tuition*
$2657 (guest students)

Description

Basic techniques for designing algorithms: divide and conquer, the greedy method, dynamic programming, etc. Applications to searching and sorting algorithms. Complexity of parsing. The fast Fourier transform and its applications (evaluation of polynomials and arithmetical problems). Lower bound theory. NP-hard and NP-complete problems. Probabilistic estimates of algorithms.

Prerequisites

CS 220 or permission of instructor

Guest Students
Add to Cart
Current Students
Register Now

Course Details

Session

Regular Academic Session

Class Dates

1/26/2026 - 5/13/2026

Location

McCormack M02-0417

Enrolled / Capacity

14 / 24

Status

Open

Instructor

Nurit Haspel

Tuition*

$2657 (guest students)

* The tuition estimate is based on minimum, single-course cost to a new student who is a Massachusetts resident and not enrolled in a multi-course program. State residency, online/in person modality, and matriculation to a degree program may affect cost.

Tuition Details