1. ADS2 Schedule
2017

2. 10/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 lectures) 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

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

4. 17/01 Tuesday, Lab, ex01 on String List
17/01 Tuesday Lecture
Linked lists contd: maintaining order, remove/delete ...
Lecture4.ppt
19/01 Thursday Lecture
Doubling linked lists, iteration again, insertion, cases, removal …
Lecture5.ppt

5. 24/01 Tuesday Lecture
Stack, using array and using linked lists ...
Example of bracket matching and also reversing contents of an array
Lecture10-1.ppt
26/01 Thursday Lecture
Queues, implemented with arrays and with linked lists, circular queue
Queues.ppt
Hand Out ex02 (assessed)

6. 31/01 Tuesday, Lab, ex02 assessed on circular queue
31/01 Tuesday Lecture
Complexity
Lecture8.ppt and Lecture9.ppt
02/02 Thursday Lecture
Recursion
Lecture6.ppt
03/02 Friday Examples
Introduce Computational Challenge (Fbook: connected? clique?)
Implementing a queue using 2 stacks
Generic stack and reverse Polish calculator (Lecture11.ppt),
Examples of complexity (power set and perm)
Empirical study of binary search on sorted data,
i.e. theoretical versus empirical complexity
Generic Lists and Iterators ... consequence of for(int x : y) ...

7. 07/02 Tuesday Lecture
Trees and Binary Search Trees (height, depth, parent, child …)
btree01.ppt
09/02 Thursday Lecture
Binary Search Trees
bstree.ppt
Hand Out ex03 on BSTree

8. 14/02 Tuesday, Lab, ex03, Binary Search Trees
14/02 Tuesday Lecture
BSTree continued (find, insert, delete …)
Lecture16.ppt
16/02 Thursday Lecture
AVL Trees, Splay Trees, Multi-way trees etc ...
splayTrees.ppt, tree2_m.ppt
17/02 Friday Examples
Recursion versus dynamic programming for fib and binomial
Recursive coding of power set enumeration (PS)
Modifying PS to solve knapsack problem.

9. 21/02 Tuesday Lecture
Recursion on the bathroom floor (square)
ADS2 feedback on ex02
Anatomy of a bug.
23/02 Thursday Lecture
Priority Queues and the Heap
Heap.pptx
Hand Out ex04, assessed, Heap

10. 28/02 Tuesday, Lab, ex04, assessed
28/02 Tuesday Lecture
Sorting: comparison based sorting, quadratic and n.log(n)
sortingPart1.ppt
02/03 Thursday Lecture
Sorting Part 2
Quicksort, how it can become quadratic.
Bucket (pigeonhole) sort.
Videos on physical sorting: trains and mail
Demo of QuickSort
sortingPart2.ppt
03/03 Friday Examples
Using random generator, producing random data,
Complexity of algorithms for the above
Drone delivery
More ex02 feedback

11. 07/03 Tuesday Lecture
Radix sort, sorting revision and sorting experiment
Demos of QuickSort and Radix Sort
Reproducing experiments on “shuttle sort” on Burroughs B220
09/03 Thursday Lecture
Hashing
Hashing.ppt
Hand Out ex05 on sorting

12. 14/03 Tuesday, Lab, ex05
14/03 Tuesday Lecture
Maps & Dictionaries
Example due to modelling spread of disease (patches)
Example of dictionary: cats, dogs and cars
Dictionary.ppt
16/03 Thursday Lecture
Different ways of representing a set, computational costs of these
How do we think? Peg Solitaire …
17/03 Friday Examples
Sets: practicalities, something not “in the book” and “does size matter?”
Peg Solitaire … dfs, BnB, A*

13. Some of what we covered:
ArrayList, Linked list, Doubly linked lists, Stacks, bracket matching
Queues, circular queues, Complexity, big O notation, recursion
Queues from stacks!, reverse Polish calculator, powers et and permutations,
Binary search, empirical study, iterators, trees, binary trees, binary search
Trees, AVL trees, Splay Tree, Multi-way trees, trees, more recursion,
Drone delivery, local search, local minima, escape! Dynamic programming
(fib & binomial), empirical study of bstree and avl tree, of doom,
anatomy of a bug, priority queue, heap, bathroom floor, sorting, Barak
Obama, bubble sort, insertion sort, selection sort, quadratic, merge
sort, O(nLogn), comparison-based sorting, quicksort, stable sorting, limits
to sorting, bucket/pigeonhole sort, radix sort, gnomes, trains, post office,
shuttle sort, B220, random, complexity of code, hash, table, maps,
dictionaries, cellular automata, cats, knapsack, BitSet, HashSet, TreeSet,
LinkedList, size, dfs, BnB, A*, as we may think …

14. 21/03 Tuesday Lecture
Award ceremony & all questions answered