COMP90038 Lecture Notes

Description

Very detailed notes on every lecture taught. All important diagrams and charts explained clearly alongside additional text. Notes include the following lectures: Introduction Algorithms and Data Structures Growth Rate and Algorithm Efficiency Analysis of Algorithms Brute Force Methods Recursion Graphs and Graph Concepts Graph Traversal Decrease and Conquer by a Constant Decrease-and-Conquer-by-a-Factor Sorting with Divide-and-Conquer More Divide-and-Conquer Algorithms Priority Queues, Heaps and Heapsort Transform-and-Conquer Algorithms Balanced Trees Input Enhancement (Time/Space Tradeoffs) Hashing Warshall and Floyd algorithms Dynamic Programming Greedy Techniques – Prim and Dijkstra Huffman Encoding for Data Compression