- Problem 1 (Smoothing data points)
- Problem 2 (Convolution)
- Problem 3 (De-convolution)
- Data file for Problem 3
- Problem 4 (Circumcircle of a traingle)
- Problems 5 and 6 (Delaunay triangulation)
- Problem 7 (Voronoi diagrams)
- Problem 8 (Convex or q hulls)
- Problem 9 (K-means cluster algorithm)
- Problem 10 (Site percolation in two dimension)

Note: These notes are intended for the COS 701 students only. Students need to be registered in SOAR for granting access.