The exercises of Practical Data Structures and Algorithms course in NTU
All the codes are passed test and finally get A+ in this course.
- String Mapping
- Protein-protein interaction analysis using Union-find
- Constructing PPI networks using Adjacency List
- Generic data type for Deques
- Find Convex Hull Vertex and Connected Components Problem
- Particle Collision with obstacles by Event-Driven Simulation using Priority Queue
- Interval Search using Binary Search Tree
- Build Centroid Hierarchical Clustering Tree
- Find Critical Distance using Priority Queue