COMP2123 FULL Notes (Distinction)

Description

Covers content from all lectures (Week 1 to Week 12) * Definitions and precision in scalability * Analysis of algorithms * Abstract data types * Stacks * Queues * Tree concepts and terminology * Recursion on trees * Binary tree implementation * General tree implementation * Binary search trees * Balanced binary search trees * AVL trees * Map implementation using sorted lists * Map implementation using unsorted lists * Priority queues * Heaps as trees * Array-based heaps * Sorting using priority queues * Hashing * Graph representations * Graph traversals * Shortest-path algorithms * Minimum-weight spanning tree algorithms * Greedy algorithms * Divide-and-conquer algorithms * Randomised algorithms * Other advanced algorithm topics