Algorithms & Complexity
Comp Sci: Undergraduate Info: Undergraduate Classes: 52.236
Last Edited: 18/01/06
|I no longer teach this module - John Levine took over for 2005/6|
Following on from Programming Techniques this module looks in detail at different algorithms (recipes) for solving problems with large chunks of data.
The course text is Java Collections: An Introduction to Abstract Data Types, Data Structures and Algorithms by David A. Watt and Deryck Brown. We will cover the material as follows
The lecture notes have indicators as to which chapters are relevant to each section.
Many of the links below here are in PDF format
To follow as the course proceeds:
Laboratories for A&C will, in general, not be formally scripted. The labs will be staffed by demonstrators and it is up to students to make good use of the lab to help learn the material and complete both the assessed exercises and non-assessed exercises. See the lab allocation for which lab to attend.
There will be three assessed exercises on this course:
In addition a series of non-assessed practical exercises will be set: while not assessed these will help understanding of the course and will not have deadlines.
The exam format will change for 2005 as the exam will be open book for the
first time. This will change the nature of questions a little but will not
change the overall style or topics being examined. The exam paper starts: "This
is an open book exam – the course text and any written notes are permitted. No
electronic devices (inc calculators and phones) are permitted on desks. Attempt
THREE questions" [from four]. The printed course notes are also permitted.
Prior to 2001 the course was called Algorithms and Data Structures and was a combined course with Programming Techniques - course material is very similar but exam style is different. If you do these two past papers and the three practicals above and have understood the course notes you should be in a very good position for the exam.