Useful links
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.
Study level | Postgraduate |
---|---|
Academic unit | Computer Science |
Credit points | 6 |
Prerequisites:
?
|
None |
---|---|
Corequisites:
?
|
None |
Prohibitions:
?
|
COMP5211 |
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:
This section lists the session, attendance modes and locations the unit is available in. There is a unit outline for each of the unit availabilities, which gives you information about the unit including assessment details and a schedule of weekly activities.
The outline is published 2 weeks before the first day of teaching. You can look at previous outlines for a guide to the details of a unit.
Find your current year census dates
This refers to the Mode of attendance (MoA) for the unit as it appears when you’re selecting your units in Sydney Student. Find more information about modes of attendance on our website.