This module introduces data structures and algorithms for computer scientists. You’ll learn about key data structures like arrays, linked lists, stacks, queues, trees, hash tables, and graphs, presented as implementations of relevant interfaces.
You’ll also explore fundamental computational problems, such as sorting and finding the shortest paths in graphs, along with important algorithms like insertion sort, selection sort, merge sort, heap sort, Dijkstra’s algorithm, and Bellman-Ford’s algorithm.
Algorithms will be presented in pseudocode, with a focus on their efficiency and asymptotic behavior, and you’ll also examine the correctness of some of these algorithms.