CP2001 - Data Structures and Algorithms
Credit points: | 03 |
Year: | 2009 |
Student Contribution Band: | Band 2 |
Administered by: | Discipline of Information Technology (pre 2009) |
An introduction to the fundamental data structures and their associated algorithms. Major topics covered are: bags, lists, stacks, queues, priority queues, hashing, searching, sorting, traversal. In addition, program specification, design and analysis are stressed.
Learning Outcomes
- be able to evaluate and compare algorithms;
- comprehend the appropriate application of algorithms;
- understand how ADT implementations are constructed in C++;
- understand how common data structures and algorithms work.
Prerequisites: | CP1300 |
Availabilities | |
Townsville, Internal, Study Period 1 | |
Census Date 27-Mar-2009 | |
Coordinator: | Dr Jason Holdsworth |
Lecturer: | Dr Jarrod Trevathan. |
Contact hours: |
|
Assessment: | end of semester exam (60%); quizzes or tests (20%); assignments (20%). |
Cairns, Internal, Study Period 1 | |
Census Date 27-Mar-2009 | |
Coord/Lect: | Dr Jason Holdsworth. |
Contact hours: |
|
Assessment: | end of semester exam (60%); quizzes or tests (20%); assignments (20%). |
JCU Singapore, Internal, Study Period 53 | |
Census Date 20-Nov-2009 | |
Coordinator: | Dr Jason Holdsworth |
Contact hours: |
|
Assessment: | end of semester exam (60%); quizzes or tests (20%); assignments (20%). |
Beijing UT, Internal, Study Period 63 | |
Census Date 23-Oct-2009 | |
Coordinator: | Dr Jason Holdsworth |
Contact hours: |
|
Assessment: | end of semester exam (60%); quizzes or tests (20%); assignments (20%). |
Note: Minor variations might occur due to the continuous Subject quality improvement process, and in case of minor variation(s) in assessment details, the Subject Outline represents the latest official information.