COMP SCI 7201MELB - Algorithm & Data Structure Analysis
Career: | Postgraduate Coursework |
---|---|
Units: | 3 |
Term: | 3746 |
Campus: | Melbourne |
Contact: | Up to 3 hours per week |
Restriction: | Available only to University of Adelaide College Melbourne Campus students |
Available for Study Abroad and Exchange: | |
Available for Non-Award Study: | No |
Pre-Requisite: | COMP SCI 7103, COMP SCI 7202, (COMP SCI 7210 and COMP SCI 7211), COMP SCI 7202B or COMP SCI 7208 |
Incompatible: | COMP SCI 7082 |
Assessment: | Written exam and/or assignments |
Syllabus: |
This course provides an introduction to program development techniques with a focus on basic ideas of correctness and proof. The course introduces, among others, notions of complexity and analysis, recursion, abstract data types, representation of lists, stacks, queues, sets, trees and hash tables, graphs and Graph Traversal. The course allows students to experience different approaches to problem solving. |
Course Fees
Study Abroad student tuition fees are available here
Only some Postgraduate Coursework programs are available as Commonwealth Supported. Please check your program for specific fee information.
The fees displayed below for international students are for students commencing a program in 2024 only. International students who commenced a program in 2023 or prior can find their fee here.
EFTSL | |||
---|---|---|---|
0.125 |
Course Outline
A Course Outline which includes Learning Outcomes, Learning Resources, Learning & Teaching for this course may be accessed here
Critical Dates
Term | Last Day to Add Online | Census Date | Last Day to WNF | Last Day to WF |
---|---|---|---|---|
3746 | Mon 24/07/2017 | Fri 28/07/2017 | Tue 29/08/2017 | Fri 22/09/2017 |
Class Details
Enrolment Class: Lecture | |||||||
---|---|---|---|---|---|---|---|
Class Nbr | Section | Size | Available | Dates | Days | Time | Location |
44031 | 01NA | 35 | 33 | This class does not have any timetabled face-to-face sessions. Please check MyUni or contact your Course Coordinator for details. |