Workshops A workshop class will be held every week in the Wilsmore Lecture Theatre on Thursdays at 4pm (starting from the second week). Students are expected to work through the relevant tutorial sheet prior to the workshop. The Tutorials are not assessed but are strongly indicative of the competancies demanded by the exam and midsemester test. In some instances the workshops and lectures will be interchanged.
Laboratories There will be weekly laboratories that students are expected to work through. These may be done independently in your own time or at the scheduled laboratory if you require guidance. These laboratories will be assessed by an automated marker and contribute 20% of your final mark. The labs will start on Tuesday, March 3.
Schedule The table below contains links to all required course material. These may be updated as the semester progresses.
Tue 3-4pm; Wlsmore LT;
| Lecture |
Thu 3-4pm; Wilsmore LT;
Thu 4-5pm; Wilsmore LT
| Laboratory |
|1||February 24||Intro to Data Structures||Intro to Algorithms||0 Getting Started|
|2||March 2||Data Abstraction||Queues||Java Primer II||1 Sorting|
|3||March 9||Lists||Complexity||Deques||2 Stacks|
|4||March 16||Asymptotic Analysis||Amortised Analysis||stacks||3 Queues|
|5||March 23||Iterators Trees||Tree Representations||Linked dequeues||4 Lists|
|6||March 30||Trees and Traversals||Priority Queues||lists||5 Binary Tree|
|7||April 6||Mid Semester Test (April 7, 6 pm, venues to be announced)||Minimum Spanning Trees||6 Tree Search||April 13|
|8||April 20||Shortest Path Algorithms||Shortest Path Algorithms||graph algorithms||7 Priority Queues|
|9||April 27||Maps||Sets and Tables||Project Workshop||8 Priority First Search|
|10||May 4||Search Trees||Hashmaps||Project Workshop||Project Lab|
|11||May 11||Dynamic Programming||Data Compression||Revision and Some Solutions||Project||12||May 18||Revision||Exam preparation|
Solutions: 1. (C); 2. (D); 3. (A); 4. (A); 5. (D); 6. (C); 7. (C); 8. (D); 9. (B); 10. (B)MidSemTest Q # 3 solution
Solutions: 1. (D); 2.(C); 3. (A); 4. (B); 5. (C); 6. (D); 7. (A); 8. (C); 9. (C); 10. (D);
Solutions: 1. (D); 2. (C); 3. (A); 4. (B); 5. (B); 6. (C); 7. (C); 8. (D); 9. (C); 10. (B)
Solutions: 1. (C); 2. (B); 3. (C); 4. (D); 5. (B); 6. (B); 7. (B); 8. (D); 9. (D); 10. (B)