-
Notifications
You must be signed in to change notification settings - Fork 0
Home
Nicholas Day edited this page Nov 29, 2024
·
61 revisions
π Welcome to the COM5013-Algorithms-and-Data-Structures wiki! π¨βπ»
β‘οΈ Use the sidebar on the right to find more information about the module β‘οΈ
π₯ COM5013 YouTube Playlist π₯
Warming up and recapping the basics
- π₯ 00 Welcome to COM5013.
- π₯ 01 Python Warmup I - OOP. π 01 Notebook - Slides & Exercises
- π₯ 1.5 Flask Setup for Web Apps π 1.5 Notebook - Slides & Exercises
- π₯ 02 Python Warmup II - Lists, Tuples, Sets and Dicts π 02 Notebook - Slides & Exercises
- π₯ 03 Numpy Arrays π 03 Notebook - Slides & Exercises
- π₯ 04 Linked Lists π 04 Notebook - Slides & Exercises
- π₯ 05 Asymptotic Complexity π 05 Notebook - Slides & Exercises
- π₯ 06 Search and Sorting Algorithms π 06 Notebook - Slides & Exercises
- π₯ 07 Stacks & Queues π 07 Notebook - Slides & Exercises
- π₯ 08 Heaps π 08 Notebook - Slides & Exercises
- π₯ 09 Hashing I - Chaining and Addressing π 09 Notebook - Slides & Exercises
- π₯ 10 Hashing II - Cryptography π 10 Notebook - Slides & Exercises
- π₯ 11 Trees I - Non-Binary and BSTs π 11 Notebook - Slides & Exercises
- π₯ 12 Trees II - BFS & DFS π 12 Notebook - Slides & Exercises
- π₯ 13 Graphs I - Theory, MSTs, Top Sort π 13 Notebook - Slides & Exercises
- π₯ 14 Graphs II - Dijkstra and A* π 14 Notebook - Slides & Exercises
- π₯ 15 Dynamic Programming I - Bottom-Up vs Top-Down π 15 Notebook - Slides & Exercises
- π₯ 16 Dynamic Programming II - Optimal Paths, Maximin and Minimax π 16 Notebook - Slides & Exercises
If you're looking for more content on other languages, here's some material from other courses: