Dec 05, 2022  
2013-2014 Graduate Catalog 
    
2013-2014 Graduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

SEGR 503 - Data Structures and Algorithms

3 credit hours
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.



Add to Portfolio (opens a new window)