Subject Descriptions - Subject Information


Calendar: 2017 Postgraduate
Faculty: Faculty of Engineering and Information Sciences
Department: School of Computing and Information Technology


Subject Information
Subject Code CSCI803
Subject Name Algorithms and Data Structures
Credit Points 6
Pre-Requisites None.
Co-Requisites None.
Restrictions None.
Equivalence None.
Assessment Assignments 30%; Lab exercises 10%; Tutorial exercises 10%; Final Examination 50%.
General Subject Yes.
EFTSL (Non Weighted) 0.125
Non Weighted Student Contribution Amounts
Commonwealth Supported (HECS) Students Only
Pre-1997 Pre-2005 Post-2005 Post-2008 Post-2009 Post-2010
$ 1131  $ 1131  $ 1131  $ 1131  $ 1131  $ 1131 
Weighted Student Contribution Amounts  
Work Experience No
Tutorial Enrolment Information Students should use the SMP OnLine Tutorial System (via SOLS) to enrol in Tutorial/laboratory groups for this subject. Once enrolments are open a link to the subject will appear in Tutorial Enrolments.

Subject Availability
Session CCNU Session 2 2016/2017  (14-02-2017 to 17-06-2017)
Campus Central China Normal University Wuhan
Delivery Method On Campus
Instance Name Class 1
Course Restrictions No restrictions
Contact Hours  
Lecturer(s) and
Cons. times
Luping Zhou
Xinguo Yu
Coordinator(s) and
Cons. times
Ian Piper
Luping Zhou
Instance Comment  
Census Date 10-03-2017

Subject Availability
Session Spring  (24-07-2017 to 16-11-2017)
Campus Wollongong
Delivery Method On Campus
Instance Name Class 1
Course Restrictions No restrictions
Contact Hours 3 hrs Lecture and 2 hrs Computer Lab per week
Lecturer(s) and
Cons. times
Ian Piper
Koren Ward
Coordinator(s) and
Cons. times
Ian Piper
Koren Ward
Instance Comment  
Census Date 31-08-2017

Subject Description
Approaches to analysing algorithm complexity and implementation efficiency will be introduced; and used to motivate the development of appropriate abstract data types. Students will be taught to recognise the role of abstract data types and algorithms in solving real-world problems; and given the opportunity to implement solutions to such problems.


Subject Learning Outcomes
On successful completion of this subject, students will be able to:
1. Determine and compare the complexity of algorithms.
2. Choose and use appropriate data structures and algorithms for a wide class of problems.
3. Make effective use of abstract data types as a design technique and implement them using appropriate programming constructs.
4. Demonstrate an ability to code efficient implementations of algorithms using appropriate choices of abstract data types.


Textbook Information

Text book information is available via the UniShop website:



Search Criteria [Click here for help]
Subject Code / Name
Level
Department
Session
Campus
Delivery Method
General Subjects