Data Structures and Algorithms 2015/16: Assignments

When preparing your submissions, please follow the

• Instructions for Submitting Coursework  

• Good Coding Style,

These are the weekly assignments for the course.

1. Array Utility Class  (Assignment)
2. Recursion and Algorithms for Arrays  (Assignment, project DSA_A2.zip)

3. Asymptotic Complexity and Substring Matching  (Assignment, Toolbox for Asymptotic Analysis, project DSA_A3.zip) )
4. Loop Invariants and Performance of Sorting Algorithms  (Assignment, project DSA_A4.zip)
5. Mysteries and other Array Algorithm  (Assignment, project DSA_A5.zip)
6. Sorting and Heaps  (Assignment, project DSA_A6.zip)

7. List Operations and Sorting with Lists  (Assignment, project DSA_A7.zip)

8. Operations on Trees and Priority Queues  (Assignment, project DSA_A8.zip)

9. Graphs  (Assignment, project DSA_A9.zip)
   

   To get some idea for reading the graph specification from file, have a look at the Java class Split.java.
   The deadline for this coursework has been extended to Monday, 13 June.