CS 5310Algorithms

Western Michigan University · 3 credits

Catalog

This course is a continuation of the study of data structures and algorithms, emphasizing methods useful in practice. It provides a theoretical foundation in designing algorithms as well as their efficient implementations. The focus is on the advanced analysis of algorithms and on how the selections of different data structures affect the performance of algorithms. Topics covered include: sorting, search trees, heaps, and hashing; divide-and-conquer; dynamic programming; backtracking; branch-and-bound; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; and parallel computing. It comprises four hours of lecture and recitation experience every week.

Recent sections

Spring 2027 · 1 section

Jan 11 – Apr 29

SectionDays & timeLocationInstructor
100Class #14065Tu Th · 11:30 AM – 12:45 PMElson S. Floyd Hall D0204Li Yang

Fall 2026 · 1 section

Sep 2 – Dec 17

SectionDays & timeLocationInstructor
105Class #45700UGRDTu Th · 1:00 – 2:15 PMElson S. Floyd Hall D0201Bhattacharjee, Shameek