Introduction to Algorithmics
This course introduces students to the notion of efficiency and computational complexity. The basic data structures encountered in first year, such as lists, trees and graphs, are reviewed in light of their efficiency and common usage scenario. Asymptotic measures of complexity are covered, and recurrence relations are introduced as an analytical tool. Problem-solving techniques such as the greedy strategy, divide-and-conquer, dynamic programming, and graph searching are covered. These techniques are illustrated upon optimization problems chosen for their practical relevance.
|Faculty||Faculty of Engineering and Built Environment|
|School||School of Electrical Engineering and Computer Science|
Semester 2 - 2016
On successful completion of this course, students will be able to:
|Assumed Knowledge||SENG6120 Knowledge of discrete mathematics|
* This assessment has a compulsory requirement.
Face to Face On Campus 3 hour(s) per Week for Full Term
Face to Face On Campus 2 hour(s) per Week for Full Term
|Timetable||2016 Course Timetables for COMP6230|