AUCSC 310 - Algorithm Design and Analysis

★ 3 (fi 6)(EITHER, 3-0-1.5)

Augustana Faculty

Algorithm design techniques (divide-and-conquer, dynamic programming, the greedy method). Merge-sort and the analysis of divide-and-conquer algorithms with recurrence relations; bucket-sort, radix-sort, and the lower bound on sorting; comparison of sorting algorithms. Trees, binary trees, search trees, their implementation, traversal, and search and update operations. Introduction to graph theory; data structures for the representation of graphs, digraphs, and networks, and their associated algorithms (traversal, connected components, topological sorting, minimum-spanning trees, shortest paths, transitive closure). Dynamic equivalence relations and union-find sets; amortized analysis. String matching. Prerequisites: AUCSC 112 (2021) or AUCSC 211 and AUSCI 235, and AUMAT 250.

Winter Term 2022

Lectures

LECTURE 1B01 (75630)
Capacity: 36
2022-01-26 - 2022-04-14
MWF 09:45 - 10:45 (AU C 014)

Primary Instructor: Mohammed Qasem

Labs

LAB 1H02 (76945)
Capacity: 18
2022-01-26 - 2022-04-14
F 14:00 - 15:30 (AU F L1 315)

Primary Instructor: Mohammed Qasem
LAB 1H03 (76946)
Capacity: 18
2022-01-26 - 2022-04-14
W 14:00 - 15:30 (AU F L1 315)

Primary Instructor: Mohammed Qasem

Winter Term 2023

Lectures

LECTURE 1B01 (46181)
Capacity: 36
2023-01-25 - 2023-04-17
MWF 09:45 - 10:45 (AU C 014)

Labs

LAB 1H02 (47277)
Capacity: 18
2023-01-25 - 2023-04-17
F 14:00 - 15:30 (AU F L1 315)

LAB 1H03 (47278)
Capacity: 18
2023-01-25 - 2023-04-17
W 14:00 - 15:30 (AU F L1 315)