Due to the exceptional circumstances caused by the COVID-19 pandemic, the learning activities, assessments and attendance requirements for this unit may be subject to late changes. Please refer to this unit outline regularly for up to date information and to notices in the unit’s Canvas site for any adjustments.
The study of algorithms is a fundamental aspect of computing. This unit of study covers data structures, algorithms, and gives an overview of the main ways of computational thinking from simple list manipulation and data format conversion, up to shortest paths and cycle detection in graphs. Students will gain essential knowledge in computer science, including basic concepts in data structures, algorithms, and intractability, using paradigms such as dynamic programming, divide and conquer, greed, local search, and randomisation, as well NP-hardness.
|Academic unit||Computer Science|
|Assumed knowledge: ?||This unit of study assumes that students have general knowledge of mathematics (especially Discrete Math) and problem solving. Having moderate knowledge about Data structures can also help students to better understand the concepts of Algorithms taught in this course.|
At the completion of this unit, you should be able to:
Unit outlines will be available 2 weeks before the first day of teaching for 1000-level and 5000-level units, or one week before the first day of teaching for all other units.