Data Structures - CSC 313
A detailed coverage of standard data structures with an emphasis on complexity analysis. Topics include: Asymptotic analysis, linked lists, stacks, queues, trees and balanced trees, hashing, priority queues and heaps, sorting. Standard graph algorithms such as DFS, BFS, shortest paths and minimum spanning trees are also covered. Prerequisite: CSC 213.