CS 4310Dsgn & Analysis Of Algorithms

Western Michigan University · 3 credits

Catalog

A continuation of the study of data structures and algorithms. It provides a theoretical foundation in designing algorithms. The focus is on the advanced analysis of algorithms and on how the selections of different data structures affect the performance of algorithms. Algorithmic paradigms such as divide and conquer, greedy method, dynamic programming, backtracking and branch and bound are covered. B-trees and 2 to 3 search trees and a variety of graph structures are discussed along with their applications to algorithm implementation. Algorithms will be analyzed for their complexity. NP-completeness will be introduced.

Recent sections

Spring 2027 · 1 section

Jan 11 – Apr 29

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

Fall 2026 · 1 section

Sep 2 – Dec 17

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