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*
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.

Prerequisites

CS 220 or permission of instructor

This course is closed for registration.

Course Details