Complete these three courses in the for-credit experience: CSCA 5414: Dynamic Programming, Greedy Algorithms – Cross-listed with DTSA 5503 CSCA 5424: Approximation Algorithms and Linear Programming ...

Basic data structures: Heaps, and Binary Search Trees. Algorithm Design Approaches: Divide and Conquer including analysis using recurrences Greedy Algorithms Dynamic Programming Algorithms Algorithms ...

Tour of the most important data structures, fundamental algorithms ... incremental and recursive algorithms, divide-and-conquer, greedy algorithms, randomisation in algorithms, sorting algorithms, ...

Tour of the most important data structures, fundamental algorithms ... incremental and recursive algorithms, divide-and-conquer, greedy algorithms. This course is delivered through a combination of ...