COMP 352: Data Structures and Algorithms

Abstract data types: stacks and queues, trees, priority queues, dictionaries. Data structures: arrays, linked lists, heaps, hash tables, search trees. Design and analysis of algorithms: asymptotic notation, recursive algorithms, searching and sorting, tree traversal, graph algorithms. Lectures: three hours per week. Tutorial: one hour per week.

• Asymptotic time and space complexity analysis (Big-O, Big-Omega) applied to operations in COMP 352
• Linear and non-linear data structures: balanced search trees (AVL, Red-Black), heaps, and hash map collision resolution
• Graph representations (adjacency list/matrix) and traversals: BFS, DFS, and shortest path algorithms in Data Structures and Algorithms
• Advanced data structure design: union-find disjoint sets, tries, and priority queue implementations