CP2001 - Data Structures and Algorithms
[Offered in 2010 only]
| Credit points: | 03 |
| Year: | 2010 |
| Student Contribution Band: | Band 2 |
| Administered by: | School of Business |
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 | |
| Beijing UT, Internal, Study Period 69 | |
| Census Date 07-Oct-2010 | |
| Coordinator: | Assoc. Professor Bruce Litow |
| 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.