CP2001 - Data Structures and Algorithms
Credit points: | 03 |
Year: | 2005 |
Student Contribution Band: | Band 2 |
Administered by: |
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 | |
, , Study Period 1 | |
Census Date 31-Mar-2005 | |
Coordinator: | Professor Ickjai Lee |
Lecturer: | Dr Jason Holdsworth. |
Contact hours: |
|
Assessment: | (60%); (20%); (20%). |
, , Study Period 1 | |
Census Date 31-Mar-2005 | |
Coord/Lect: | Professor Ickjai Lee. |
Contact hours: |
|
Assessment: | (60%); (20%); (20%). |
, , Study Period 21 | |
Census Date 06-May-2005 | |
Contact hours: |
|
Assessment: | (60%); (20%); (20%). |
, , Study Period 22 | |
Census Date 31-Aug-2005 | |
Contact hours: |
|
Assessment: | (60%); (20%); (20%). |
, , Study Period 23 | |
Census Date 23-Dec-2005 | |
Contact hours: |
|
Assessment: | (60%); (20%); (20%). |
, , Study Period 33 | |
Census Date 22-Jul-2005 | |
Face to face teaching 25-Jul-2005 to 11-Nov-2005 | |
Contact hours: |
|
Assessment: | (60%); (20%); (20%). |
, , Study Period 34 | |
Census Date 30-Nov-2005 | |
Face to face teaching 21-Nov-2005 to 17-Mar-2006 | |
Contact hours: |
|
Assessment: | (60%); (20%); (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.