Design and Analysis of Algorithms - COMP317 (2017)

COMP317 - 17A (HAM)

20.0 Points

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.

Prerequisite(s): COMP203 or COMP241

Internal assessment/examination ratio: 2:1

Timetabled Lectures for COMP317

Day StartEndRoomDates
Mon4:00 PM6:00 PMMSB.1.05Feb 27 - Jun 4
Tue1:00 PM2:00 PML.G.04Feb 27 - Jun 4
Fri12:00 PM1:00 PMS.1.04Feb 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

Fees for 2017 are not yet available.

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.

Available Subjects:   | Computer Science | Software Engineering | 

Other available years: Design and Analysis of Algorithms - COMP317 (2016) , Design and Analysis of Algorithms - COMP317 (2015)

Paper Details current as of: 21 October 2016 4:24pm
Indicative Fees current as of: 28 October 2016 4:30am

This page has been reformatted for printing.