✔ Complete H1 Summary Notes ✔ COMP20003: Algorithms & Data Structures

Description

This note set covers the full subject of COMP20003 – Algorithms & Data Structures for the 2021 Semester 2 Curriculum, including all covered concepts. The content of these notes were derived from the textbook, lecture notes, lecture recordings, workshop/tutorial content and examples. These notes include: - Easy to read code and clear examples in correct C syntax and font of all concepts - Numerous example programs with personalised comments that aid in understanding - Comprehensible diagrams for algorithms and data structures taught - Summary tables that compare the concepts taught - Clear separation and format of concepts into topics and sections - Hyperlinked bookmarks of sections that can be easily navigated if opened with a PDF reader software The main topics covered include (but are not limited to): - Algorithms and Complexity Analysis - Memory, Pointers and Dynamic Memory - Data Structures (arrays, structs, lists & linear linked structures, list manipulation, linked lists, binary search trees traversal/deletion, AVL trees) - Dictionaries and Sorting (distribution counting, dictionaries & hashing, collision handling, insertion sort, quicksort, mergesort, sorting complexity, master theorem) - Priority Queue - Graphs (traversal, graph searching, Dijkstra's, transitive closure, implicit graphs) - Minimum Spanning Tree (Prim's, Kruskal's, union-find) - Topological Sorting and Heuristic Search These notes helped me obtain an H1 in COMP20003: Algorithms & Data Structures. They are perfect for both cramming and continuous study throughout the subject. The topics are covered in mostly the same order as they are covered in lectures, and is succinct and compact. All information included is relevant and important for the exam.