CSE1305-Implementation-Finals

Mostly 100/100 solutions for TU Delft's CSE1305 Algorithms and Data Structures course's final exams

2018-2019 Final

• Tree (countNodesAtLevel): 100/100
• Graph (countVertices): 100/100 (Note: iterative DFS doesn't work?)
• Radix sort (radixSortMSD): 100/100
• Hash table: 100/100

2019-2020 Final

• Implementation 1 (MulitMap): 100/100
• Implementation 2 (indexSort): 100/100
• Implementation 3 (isRedBlackTree): 100/100
• Implementation 4 (shortestPath): 100/100

2020-2021 Final

• Radix Sort (LSD): 100/100
• DL Skip List: 100/100
• MWST: 98/100
• Kruskal: 100/100

2021-2022 Final

• Assignment 1 (countSubstringOccurences): 100/100
• Assignment 2 (SolutionHashTable): 100/100
• Assignment 3 (mergeSortBottomUp): 100/100
• Assignment 4 (GraphChecker): 84/100
• Assignment 5 (Street): 100/100

2023-2024 Final

• Folded Linked List: 100/100
• Quick Select: 100/100
• Multiway Search Trees (bfs / getNearestLeftCousin): 100/100
• Connected Components: 100/100