|
Oct 31, 2024
|
|
|
|
SEGR 503 - Data Structures and Algorithms3 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: SEGR 501.
Academic Level: Graduate Instructional Method: Lecture School: College of Science & Engineering
Add to Portfolio (opens a new window)
|
|