![[ Contents ]](http://handbook.murdoch.edu.au/images/nav/contents.gif){kind=small}
![[ Search ]](http://handbook.murdoch.edu.au/images/nav/search.gif){kind=small}
![[ Changes ]](http://handbook.murdoch.edu.au/images/nav/changes.gif){kind=small}
![[ Glossary ]](http://handbook.murdoch.edu.au/images/nav/glossary.gif){kind=small}
![[ Index ]](http://handbook.murdoch.edu.au/images/nav/index.gif){kind=small}
![[ More Info ]](http://handbook.murdoch.edu.au/images/nav/moreinfo.gif){kind=small}
![[ Murdoch ]](http://handbook.murdoch.edu.au/images/nav/murdoch.gif){kind=small}
Handbook 2009 |
 |
 |
Units: Lists and Search | Foundation Units | Discipline areas | Teaching Periods and Census Dates ... See also Courses | Minors | Booklists |
Data Structures and Abstractions (ICT209) |
|
Points: |
4 |
Enrolment Options: |
Murdoch: S1-internal, S1-external |
Description: |
This unit studies Abstract Data Structures (ADS) and the algorithms that operate upon them. ADS such as arrays, lists, two-dimensional structures, trees and graphs are studied along with various representations. ADS that utilise these structures are also covered. Complexity analysis is used as a thread throughout the unit. The programming language currently used in this unit is C++. |
Contact time: |
Lectures and practice sessions: up to 5 hours per week. |
Prerequisites: |
B104/ICT104/M104 Principles of Computer Science. |
Used in these Courses: |
Computer Science (BSc) |
Used in these Minors: |
Computer Science |
Students should ensure they are familiar with the University's internal legislation, including provisions specifically relevant to their studies. See the University Regulations and Rules.
Cancellation of Courses, Minors and Units
The University reserves the right to cancel, without notice, any course, major, minor or unit if the number of students enrolled falls below limits set by the University.