- 15 (0.125 EFTS)
- This course introduces the fundamental data structures and algorithms used in software development, extending the object-oriented concepts taught in the pre-requisite subject Programming Principles and Practice. The course will cover searching and sorting, linked data structures such lists and trees as well as hash tables. Upon completion of this course students will be able to implement a variety of data structures and algorithms, and will have an expert knowledge of the scalability and design trade-offs of these algorithms.
- Pre-requisites / Co-requisites:
- Students must be admitted to the Bachelor of Computing Systems programme or the Graduate Diploma in Computing programme to enrol in this course. Pre-requisites: For BCS: ISCG5421. For GDC: As approved by the Programme Leader.
- Topics include:
Topics may include Sorting,Bubble Sort, Insertion Sort, Searching, Brute Force Search, Binary Search, Linked Lists, Stacks, Queues, Binary Trees, Depth First Search, Breadth First Search, Recursion, Hash Tables, Divide and Conquer, Backtracking
- Choose your class for this course from the option(s) below. You will need to attend all the sessions in that class to complete the course. Where more than one class number is shown, choose one of them and attend all sessions within that class number. (Note: If a class is held in different locations at the same time, you only need to attend all the sessions in one of the locations.)
- There are no classes on public holidays.
Class: 2382. This timetable is currently unavailable.
You need to attend all sessions of this class as listed below.
|From – To||Session||Day||Time||Campus (Room)|
|28 Jul 17 - 29 Sep 17||Lab||Friday||09:00 - 12:00||Mt Albert (183-2104)|
|20 Oct 17 - 24 Nov 17||Lab||Friday||09:00 - 12:00||Mt Albert (183-2104)|
Class: 6136. This timetable is currently unavailable.
- Note: This course is offered as part of Bachelor of Computing Systems, Graduate Diploma in Computing.