High H1 - COMP20003 Latest Notes

Description

This is the latest note set for COMP20003 - Algorithms and Data Structures, made by myself in Semester 2 2019. The note set contains all key summary of all examinable topics, from Weeks 1 to 12. Topics in this note include: - Computational Complexity Analysis - Data Structures - Binary Search Trees / Balanced Trees - Multi-file programming - Hashing - Sorting algorithms - Master Theorem and Priority Queues - Graph algorithms - Minimum Spanning trees The topics are summarized in the same order as they are covered in lectures. Content is succinct and compact, all information included is relevant and important for the exam. Although there is a lot of content in this subject, if you familiarize yourself with these notes and do the sample exam provided, a H1 should be achievable.