Algorithms and complexity. Exception handling. Event handling. Graphics. Multithreading. Network programming.
Data structures. Abstract data types and classes (lists, stacks, queues, etc.) Inheritance vs composition. Abstract vs concrete classes. Self-referential classes.
The schedule on this page is subject to change. This page is provided as a resource, mostly so you can find lecture notes and problem sets.
Topics (exact organization still subject to change)
programming, data structures, algorithms and sorting.
Reinventing the Wheel, Algorithm Examples: Sorting, Intro to Algorithms and Complexity.
in different languages.
||Algorithms, complexity and search.
Logarithmic Complexity and the Big O, The Complexity of Various Sort Algorithms, Searching & Complexity
structure and non-linear control.
Space, Class & Interface, Errors, Exceptions and Nonlinear Control, Concurrency and Threading
|Coursework 1 (handed
out 21 feb)
threading & GUIs.
When Threading Goes Bad, Intro to Networking, How to Network
Coursework 1 due 6 March,
Some Final Protocols, Intro to Graphical User Interfaces, Panels, Components & Layouts Galore
Coursework 2 (posted 6 March)
Applications & Internet
Applets & Java's Sordid History, Searching Applications 1, Searching Applications II
||Part B||Coursework 2 - 1st increment due 20
March, marked in lab.
||Part B||Coursework 2 due 31 March|
|The rest of term.
||Part B||Part B|