SEGR 5031 - Data Structures and Algorithms

3 credit hours
Formerly - SEGR 503/5030

Basic strategies of algorithm design: top-down design, divide and conquer, average and worst-case complexity, asymptotic costs, simple recurrence relations. Choice of appropriate data structures such as arrays, stacks, queues, trees, heaps, graphs, hash tables, etc. Applications to sorting and searching. Introduction to discrete optimization algorithm: dynamic programming, greedy algorithms.

Prerequisite Course: SEGR 5011