Course Websites

Advanced data structures, graph algorithms, arithmetic algorithms, geometric algorithms, string problems, parallel algorithms, NP-completeness. Course Information: Same as CSE 414 and MATH 473. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225 and CS 373. Class Schedule Information: Students must register for a lecture and a discussion section.

Know definitions of "core computational problems" and be able to describe various algorithms and their time and space complexities for such problems. (1,6)

Be able to abstract key computational elements and challenges from newly encountered problems in different domains, and identify when known algorithms or variants thereof may be employed to find a solution. (1,6)

Be able to design new algorithms using a variety of algorithmic approaches, including brute force, greedy, recursion, divide-and-conquer, dynamic programming, randomization, etc. (1,6)

Be able to use appropriate data structures such as arrays, linked lists, BSTs, heaps, hash tables, adjacency matrices or lists, etc, to solve problems efficiently. (1,6)

Be able to analyze the (worst case, randomized, amortized) time and space complexity of given algorithms using techniques such as loop summations, recurrences, charging arguments, potential functions, properties of probability. (1,6)

Be able to reason formally about problem difficulty using reductions, adversary arguments, decision trees, and similar techniques. (1,6)

More generally, be able to communicate and reason about computation clearly, formally, and concisely. (3,5)

Selected Elective.