Design and Analysis of Algorithms - COMP317 (2017)
COMP317 - 17A (HAM)
A study of classical and recently developed algorithms for solving a diverse range of problems using computers. Issues of performance, scalability, applicability, adaptation and design are also discussed.
Internal assessment/examination ratio: 2:1
Timetabled Lectures for COMP317
|Mon||4:00 PM||6:00 PM||MSB.1.05||Feb 27 - Jun 4|
|Tue||1:00 PM||2:00 PM||L.G.04||Feb 27 - Jun 4|
|Fri||12:00 PM||1:00 PM||S.1.04||Feb 27 - Jun 4|
NB:There may be other timetabled events for this paper such as tutorials or workshops.
Visit the online timetable for COMP317 for more details
Indicative Fees for COMP317
Paper Outlines for COMP317
The following 2016 paper outlines are available for COMP317. Please contact the Faculty or School office for details on 2017 outlines.
Other available years: Design and Analysis of Algorithms - COMP317 (2016) , Design and Analysis of Algorithms - COMP317 (2015)
Paper Details current as of: 23 November 2016 5:13pm
Indicative Fees current as of: 10 December 2016 4:30am