CS211 - Algorithms and Data Structures II
Tutorials

Back to CS211 home


Basic C++ programming (T Naughton):

[Tutorial 1] [Sample tutorial solutions 1] (27 Jan 2000, Th1 16:00-18:00)
[Tutorial 2] [Sample tutorial solutions 2] (3 Feb 2000, Th1 16:00-18:00)

Basic C++ programming (S Dunne):

[Tutorial 3] [Sample tutorial solutions 3] (2 Mar 2000, Th1 16:00-18:00)
[Tutorial 4] [Sample tutorial solutions 4] (7 Mar 2000, Th1 14:00-16:00)

Linked lists (G Mitchell, D Costelloe, S McLoughlin):

[Tutorial 5] [Sample tutorial solutions 5] (8 Mar 2000, Th1 14:00-16:00)
[Tutorial 6] [Sample tutorial solutions 6] (9 Mar 2000, Th1 14:00-16:00)

Binary trees (S Dunne):

[Tutorial 7] [Sample tutorial solutions 7] [22 Mar 2000, Callan Hall (Old Campus) 18:00-20:00]

Hash tables (G Mitchell, S Dunne):

[Tutorial 8] [Sample tutorial solutions 8] (29 Mar 2000, Callan Hall 18:00-20:00)
[Tutorial 9] [Sample tutorial solutions 9] (5 Apr 2000, Callan Hall 18:00-20:00)

Sample exam questions (G Mitchell, D Costelloe):

[Tutorial 10] [Sample tutorial solutions 7A.2][8.3] (11 Apr 2000, Th2 14:00-16:00)
[Tutorial 11] [Sample tutorial solutions 11] (12 Apr 2000, Th2 14:00-16:00)

AVL trees (S McLoughlin):

[Tutorial 12] [Sample tutorial solutions 12] (26 Apr 2000, Callan Hall 18:00-20:00)

Sample exam questions (T Naughton):

[Tutorial 13] [Sample tutorial solutions 13 Part I] [II] [III] (3 May 2000, Callan Hall 18:00-20:00)