Lecture Schedule 2016
               ---------------------

12/01 Tuesday Lecture
Introduction to ADS
Example of reading in file of names, not knowing how big the file is
then adding/deleting/finding ... use of ArrayList and implications
Gives justification for dynamic data structures (next lextures) and
importance of understanding the problem, how you model and solve and consequences of this (complexity)

General Information: Test.java, compiling & running program from command line

14/01 Thursday Lecture
Linked lists, StringList, insert at head, toString, iteration over list, isPresent ...
Lecture3.ppt

Hand Out ex01

18/01 Monday, Lab, ex01 on String List

19/01 Tuesday Lecture
Linked lists contd: maintaining order, remove/delete ...
Lecture4.ppt

21/01 Thursday Lecture
Doubling linked lists, iteration again, insertion, cases, removal, 
Lecture5.ppt

26/01 Tuesday Lecture
Stack, using array and linked lists ... 
example of bracket matching and also reversing contents of an array
Lecture10-1.ppt

28/01 Thursday Lecture
Queues, with arrays, linked lists, circular queue
Queues.ppt

Hand Out ex02 (assessed)

01/02 Monday, Lab, ex02 assessed on circular queue

02/02 Tuesday Lecture
Complexity
Lecture8.ppt and Lecture9.ppt

04/02 Thursday Lecture
Recursion
Lecture6.ppt

05/02 Friday Examples
Generic stack and revesre polish calculator (Lecture11.ppt), examples of complexity,
empirical study of binary search on sorted data, i.e. theoretival versus empirical complexity
Generic Lists and Iterators ... consequence of for(int x : y) ...

09/02 Tuesday Lecture
Binary Search Trees 
btree01.ppt

11/02 Thursday Lecture
Binary Search Trees
bstree.ppt

Hand Out ex03 on BSTree

15/02 Monday, Lab, ex03, Binary Search Trees

16/02 Tuesday Lecture
AVL Trees
Lecture16.ppt

18/02 Thursday Lecture
AVL Trees, Splay Trees, Multi-way trees etc ...

19/02 Friday Examples
recursion, dynamic programming, complexity, ...
Empirical study of balance in BSTree versus AVL tree

23/02 Tuesday Lecture
More on Complexity ... from the java directory "complexity", name that complexity
Presentation of a graph and getting paths of length 2
Empirical study of binSearch to show difference between theory and practice

25/02 Thursday Lecture
Priority Queues and the Heap
Heap.pptx

Hand Out ex04, assessed, Heap

29/02 Monday, Lab, ex04, assessed

01/03 Tuesday Lecture
Sorting Part 1

03/03 Thursday Lecture
Sorting Part 2

04/03 Friday Examples
Strange code and bugs
Example of CA and use of sets

08/03 Tuesday Lecture
Sorting, sorting revision and sorting experiment

10/03 Thursday Lecture
Hashing

Hand Out ex05 on sorting

14/03 Monday, Lab, ex05

15/03 Tuesday Lecture
Maps

17/03 Thursday Lecture
TSP ... local search, 2 opt ...
Branch and Bound and knapsack problem

18/03 Friday Examples
Thinking out of the box ... other ways to implement sets and
example using modeling cellular automata

21/03 LAST WEEK OF LECTURES

22/03 Tuesday Lecture
All Questions Answered