Information on this page, including unit offerings, is from the 2019 academic year.
Data Structures and Abstractions (ICT283)
|School||School of Engineering and Information Technology|
|Availability||MURDOCH: S1-internal, S1-external
DUBAI-ISC: TJD-internal, TMD-internal, TSD-internal
KAPLAN-SGP: TJA-internal, TMA-internal, TSA-internal
|Teaching Timetables||Murdoch S1
|Description||This unit introduces Abstract Data Structures (ADS) and associated algorithms. ADS such as arrays, vectors, 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 throughout the unit. The programming language currently used in this unit is C++.|
|Unit Learning Outcomes||On successful completion of the unit you should be able to:
1. design and write good structured and object oriented C++ programs;
2. design and write well documented C++ programs that use abstract data structures: both programmer designed and from the Standard Template Library;
3. design test plans for abstract data structures coded as classes and the application programs that use these classes;
4. draw high level Unified Modeling Language class diagrams that can be implemented;
5. discuss (and apply) the theory and application of abstract data structures and the algorithms that use them and are used by them;
6. design and implement solutions that adhere to given specifications;
7. adhere to stated requirements.
|Timetabled Learning Activities||Lectures: 1 x 2 hours per week plus optional clinics; laboratories: 1 x 2 hours per week.
All offerings of this unit include the equivalent of 30 hours of structured learning.
|Unit Learning Experiences||The approach to learning in this unit is through the use of lecture notes, directed readings, self-directed study which includes practical work. Practical work involves programming and this practical work is done throughout the semester/trimester. Most weeks would have weekly laboratory work and most laboratory exercises build on work done in previous laboratory exercises. The laboratory exercises serve as preparation for the assignments. All practical work involves self-directed study.
|Assessment||3 tutorial/laboratory exercises assessed as satisfactory or unsatisfactory (6%): Theory and/or practical work relating to the topics or extending the topics. Along with the assessed exercises, other exercises help with the assignment and project.
1 Assignment (14%): Theory and/or practical work relating to the topics or extending the topics.
1 Project (30%): Putting together all that has been learned as well as further exploration of data structures.
Examination (50%): Written answers covering theory and practice.
A feedback template is used for assignments. The grade for the assignment/project will be reported using a letter grade like HD, D, C, P and N.
|Prerequisites||ICT167/ICT104 Principles of Computer Science. Students are encouraged to also complete MAS162 Foundations of Discrete Mathematics AND ICT170 Foundations of Computer Systems.|
|Exclusions||Students who have successfully completed ICT209 Data Structures and Abstractions cannot enrol in this unit for credit.|
|Appears in these Courses/Majors:
see individual structures for context
|Internet Access Requirements||Murdoch units normally include an online component comprising materials, discussions, lecture recordings and assessment activities. All students, regardless of their location or mode of study, need to have access to and be able to use computing devices with browsing capability and a connection to the Internet via Broadband (Cable, ADSL or Mobile) or Wireless. The Internet connection should be readily available and allow large amounts of data to be streamed or downloaded (approximately 100MB per lecture recording). Students also need to be able to enter into online discussions and submit assignments online.|