CSE 374 Algorithms I

Catalog description:

Design, analysis and implementation of algorithms and data structures. Dynamic programming, brute force algorithms, divide and conquer algorithms, greedy algorithms, graph algorithms, and red-black trees. Other topics include: string matching and computational geometry.

Prerequisites:

CSE 274 and MTH 231

Course Outcomes

1: Characterize the runtime and storage requirements of a proposed algorithm or data structure.

2: Explain the significance of NP-completeness.

3: Describe advanced data structures and algorithms and identify the computational problem that they solve.

4: Implement advanced data structures and algorithms.