UMass Boston

An aerial view of the UMass Boston campus at night
Analysis of Algorithms

Course Overview

Date / Time Location Credits Minimium Tuition*
9/3/24 - 12/13/24
MoWe 5:30p.m. – 6:45p.m.		 McCormack M02-0116 3 $2557 (guest students)
Date
9/3/24 - 12/13/24
Time
MoWe 5:30p.m. – 6:45p.m.
Location
McCormack M02-0116
Credits
3
Min. Tuition*
$2557 (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.

Guest Students
Add to Cart
Current Students
Register Now

Course Details

Session

Regular Academic Session

Class Dates

9/3/2024 - 12/13/2024

Location

McCormack M02-0116

Enrolled / Capacity

49 / 50

Status

Open

Instructor

Nurit Haspel

Prerequisites

CS 220 or permission of instructor

Tuition*

$2557 (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