The first lecture introduces the course and the concepts to be covered: data structures and algorithmic complexity.

The second lecture goes deeper into complexity. We will describe several complexity classes and algorthms that display fall in those classes.

The third lecture reviews arrays as a first data structure.

The first week is unusual in that it has two tutorials. Usually there will only be one that must be turned in during the tutorial the following week. In the first week, there is no tutorial from the preceeding week, so we will spend the time introducing outselves.

This file is what should be expected as a tutorial. A selection of these questions given as a quiz at the beginning of the tutorial. Anothe selection will form part of the sessionals and final exam.

As in Structured Programming, labs will be vivas in which you demo your work to your professors. Your performance on these vivas will be your marks on the Practical element of the course. In this lab, make sure that you are able to work on your programs outside of class by making sure that you are able to access your AWS account and that you have Cygwin installed on your laptop.