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.
Code | COMP9007 |
---|---|
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:
Unit outlines will be available 2 weeks before the first day of teaching for the relevant session.
Key dates through the academic year, including teaching periods, census, payment deadlines and exams.
Enrolment, course planning, fees, graduation, support services, student IT
Code of Conduct for Students, Conditions of Enrollment, University Privacy Statement, Academic Integrity
Academic appeals process, special consideration, rules and guidelines, advice and support
Policy register, policy search
Scholarships, interest free loans, bursaries, money management
Learning Centre, faculty and school programs, Library, online resources
Student Centre, counselling & psychological services, University Health Service, general health and wellbeing