Dr Konrad Swanepoel

This course is available on the BSc in Business Mathematics and Statistics, BSc in Mathematics and Economics, BSc in Mathematics with Economics and BSc in Statistics with Finance. This course is available as an outside option to students on other programmes where regulations permit. This course is available with permission to General Course students.

Introduction to Abstract Mathematics (MA103), or an equivalent course giving a background in rigorous mathematics.

Basics of Java programming. The Euclidean algorithm. Time complexity of algorithms. Asymptotic notation. Heaps. Sorting. Recursive algorithms. Stacks and queues. Linked lists. Graphs. Breadth-first and depth-first search. Connectivity and topological sorting. Dijkstra's algorithm. Closest pair in the plane.

20 hours of lectures, 1 hour of lectures and 10 hours of classes in the MT. 1 hour of lectures in the ST.

Written answers to set problems will be expected on a weekly basis.

T H Cormen, C E Leiserson & R L Rivest, Introduction to Algorithms, MIT Press 1990 (or 2nd edn, 2001 or 3rd edn, 2009); J R Hubbard, Programming with Java, Schaum's outlines, McGraw-Hill, 2nd edn, 2004; R Sedgewick, K Wayne, Introduction to programming in Java, An interdisciplinary approach, Addison Wesley, 2008; D Flanagan, Java in a Nutshell, 3rd edn, or later, O'Reilly 1999 

Exam (80%, duration: 2 hours) in the main exam period.
Coursework (20%) in the MT.