Algorithms and Data Structures I

1.5 credits · Undergraduate

Foundations of algorithm design and analysis, including the random-access model, the concepts of time and space complexity, worst-case analysis, mathematical modeling of applied problems and proofs of correctness. Fundamental algorithm problems, including searching and sorting. Fundamental abstract data structures, including sequences, dictionaries, priority queues and graphs. Tree-based structures, including self-balancing binary search trees and heaps. Fundamental graph algorithms, including traversals, topological sorting and connectivity testing.