CS210 - Algorithms and Data Structures I Department of Computer Science, NUIM Laboratory Sheets and Laboratory Exams

T Naughton, CS NUIM
Back to CS210 home

Sample solutions will be posted soon after the submission deadline has passed.

Basic programming skills: iteration and arrays, walkthroughs, stepwise refinement:
[Lab sheet 1] [Sample lab solutions 1] (week of 2 Oct 2000)
[Lab sheet 2] [Sample lab solutions 2] (week of 9 Oct 2000)
[Lab sheet 3] [Sample lab solutions 3] (week of 16 Oct 2000)

Static data structures: stacks, queues, and sets:
[Lab sheet 4] [Sample lab solutions 4] (week of 23 Oct 2000)
No labs -- mid-term break (week of 30 Oct 2000)
[Lab sheet 5] Sample lab solutions 5: [5.1 class pseudocode] (week of 6 Nov 2000)

Mid-term exam:
[Lab exam 1 outline] Sample exam solutions 1: [C] [D] [E] [G] [H] [P] [Q] [R] [T] [V] [X] [Y] (week of 13 Nov 2000)

Abstract data types:
[Lab sheet 6] Sample lab solutions 6: [6.1 class pseudocode] [6.2 class] [6.3 class] [6.3 tester] [6.4 class] [6.4 tester] (week of 20 Nov 2000)
[Lab sheet 7] Sample lab solutions 7: [7.1 class] [7.1 tester] [7.1 sample output] (week of 27 Nov 2000)

Abstract data types (incl. searching & sorting):
[Lab sheet 8] Sample lab solutions 8: [8.1 class] [8.1 tester] [8.1 sample output] (week of 4 Dec 2000)

Dynamic data structures: linked lists:
[Lab sheet 9] Sample lab solutions 9: [9.1 class] [9.1 tester] [9.2 pseudocode] (week of 11 Dec 2000)

Final exam:
[Lab exam 2 outline] [Lab exam 2 paper] Sample solutions to Sect. A: [C] [H] [I] [Solutions to Sect. B] (week of 18 Dec 2000)

If time permitted, in this course we would also have covered some recursive implementations of simple stack methods, in preparation for the tree algorithms to come in CS211 Algorithms & Data Structures II. For example, print(), contains(Object o) , printInReverse(), ...