Learning outcomes from the notes, with some commentary.

1. Understand and be able to use the following basic data structures: lists, stacks, queues, priority queues, trees (specifically B-Trees and Binary Trees).

   Make sure you know and understand the code behind the structures quite well, as you could (and probably will) be asked to recall some of it in the exam.

2. Have knowledge, and be able to demonstrate understanding, of searching and sorting algorithms that can be applied to data structures.

3. Be able to discuss the implications of choices for implementing basic data structures using arrays or linked lists.

4. Be able to discuss how the choice of data structure and design of an algorithm can impact the performance of programs.

   Remember the performance for the structures, in terms of 'big O' notation, e.g. O(logN) etc. If you don't know what this means, look it up in your first year Programming and Software Engineering notes.

5. Gain further experience in object oriented design principles.

6. Gain further experience in developing programs in Java.