Programming languages: Intermediate to advanced ... structures to round off this course. The first data structure will be the widely used B-Tree data structure which is used in indexing and storing ...

CATALOG DESCRIPTION: Design and analysis of advanced ... algorithms for a sequence of problems: shortest paths, minimal cycle ratios, maximal network flows, min-cost flows, and convex cost flows.

See How It Works for details. Undergraduate algorithms (CSCI 3104), data structures (CSCI 2270), discrete mathematics (CSCI 2824) and two semesters of calculus, or equivalents. We will assume that the ...