  |
|
|
Assignment 1. Involves lectures 2 and 5 on complexity of algorithms.
Correction of Assignment 1. Graded by Ehsan (in red) and Philippe (in blue).
Assignment 2. Involves lectures 8 and 9 on linked lists.
Correction of Assignment 2 Q2&3. Some elements on question 1. Graded by Ehsan.
Assignment 3. Involves tree and binary search trees.
Correction of Assignment 3. Graded by Ehsan.
Assignment 4. Involves all data structures seen so far.
Correction of Assignment 4. Graded by Philippe.
Assignment 5. Involves graphs & hash tables. [Code] [data.txt]
Correction of Assignment 5. Graded by Ehsan.