Data Structures and Algorithms
Enrolments for this year have closed. Keep exploring subjects.
Online and other materials
Subjects may require attendance
- 01 Mar 2021
The University of New England is the only Australian public university to be awarded the maximum 5 stars for Overall Experience by the Good Universities Guide, 13 years in a row. UNE has delivered distance education since 1955—that’s longer than any other Australian university. Perhaps that’s why students continue to rate UNE so highly for student satisfaction and teaching quality. With over 170 degrees offered online, and more than 20,000 online students, UNE is the expert in online education.
QS RANKING 2021
Times Higher Education Ranking 2021
Upon completion of this subject, students will be able to:
- write, compile, and run programs in C++;
- perform complexity analysis in order to determine the efficiency of a given algorithm;
- implement key details of each of the data structures presented in this unit; and
- determine which data structure should be used for the efficient solution of a range of different problems, and understand why this is the case in each instance.
- Topics will be available to enrolled students in the subjects Learning Management System site approximately one week prior to the commencement of the teaching period.
You must either have successfully completed the following subject(s) before starting this subject, or currently be enrolled in the following subject(s) in a prior study period; or enrol in the following subject(s) to study prior to this subject:
UNE-AMTH140-Discrete Mathematics and UNE-COSC120-Object Oriented Programming and UNE-COSC101-Software Development Studio 1, or UNE-COSC110-Introduction to Programming and the UNIX Environment, or UNE-SCI210-Introduction to Scientific Programming, or UNE-AMTH250-Introduction to Programming in The Sciences ;
Please note that your enrolment in this subject is conditional on successful completion of these prerequisite subject(s). If you study the prerequisite subject(s) in the study period immediately prior to studying this subject, your result for the prerequisite subject(s) will not be finalised prior to the close of enrolment. In this situation, should you not complete your prerequisite subject(s) successfully you should not continue with your enrolment in this subject. If you are currently enrolled in the prerequisite subject(s) and believe you may not complete these all successfully, it is your responsibility to reschedule your study of this subject to give you time to re-attempt the prerequisite subject(s)
Candidature in Diploma in Information Technology. To enrol in this subject you will need to pass the Prerequisite/s. Please note as UNE results are released after the close of enrolment date, your enrolment into this subject will be withdrawn if you do not pass the prerequisite subject/s.
- EquipmentDetails - Headphones or speakers (required to listen to lectures and other media) Headset, including microphone (highly recommended) Webcam (may be required for participation in virtual classrooms and/or media presentations).
- SoftwareDetails - It is essential for students to have reliable internet access in order to participate in and complete your units, regardless of whether they contain an on campus attendance or intensive school component. For additional information please visit UNE Hardware Requirements: https://www.une.edu.au/current-students/support/it-services/hardware
- TravelDetails - Travel may be required to attend the Final Examination for this subject.
- OtherDetails -
Textbook information is not available until approximately 8 weeks prior to the commencement of the Teaching period.
Students are expected to purchase prescribed material.
Textbook requirements may vary from one teaching period to the next.
This subject introduces the fundamental data structures used in programming, and builds on the theoretical analysis of algorithm efficiency. Topics include: Object-Oriented programming in C++, algorithm complexity analysis, and data-structure implementations, including: linked lists; binary search trees; hash tables; stacks and queues; heaps and expression trees. Recursion and efficient sorting algorithms are also covered. Emphasis is on both theory and practical application.
Assessment 1: Programming assignment. All assessment tasks must be attempted. Relates to Learning Outcomes 1-4 Assessment 2: Programming assignment. All assessment tasks must be attempted. Relates to Learning Outcomes 1-4 Assessment 3: Programming assignment. All assessment tasks must be attempted. Relates to Learning Outcomes 1-4 Assessment 4: Programming assignment. All assessment tasks must be attempted. Relates to Learning Outcomes 1-4 Final Examination: 2 hrs 15 mins. It is mandatory to pass this component in order to pass the unit. Relates to Learning Outcomes 1-4 There is a supervised exam at the end of the teaching period in which you are enrolled. The paper-based exam will be held at an established exam venue, and coordinated by UNE Exams Unit. UNE manages supervised exams associated with your UNE subjects. Prior to census date, UNE releases exam timetables. They’ll email important exam information directly to your UNE email address.
- Assessment 1 - Programming assignment (10%)
- Assessment 2 - Programming assignment (10%)
- Assessment 3 - Programming assignment (10%)
- Assessment 4 - Programming assignment (10%)
- Final Examination - 2 hrs 15 mins (60%)
Current study term: 28 Feb 21 to 28 May 21
Check the learning management system (LMS) of your university for textbook details.