SE 202a/b Algorithms and Data Structures for Software Engineers |
A survey of algorithms and data structures used in software engineering today; the design and implementation of such algorithms, especially in large applications or systems; algorithm analysis, data structures, abstract data types, recursion, trees, graphs, sorting (elementary, quicksort, merging, heapsort, radix, special sorts) and searching (symbol tables, BSTs, balanced trees, hashing, radix, external (B trees)). |
Antirequisites: Computer Science 201, (or the proposed 210a/b) |
Prerequisite: Computer Science 027a/b with a minimum grade of at least 70%, Applied Math 026 and the approval of the Department |
3 lecture hours, half course |
Academic Calendar |