Skip to main content

Data Structures


Enrollment in this course is by invitation only

Learning Objectives

  1. To understand the concepts and operations of various data structures and their applications
  2. To understand the concept of abstract data types
  3. To have basic knowledge of algorithms and complexity of algorithms

Learning Outcomes

  1. To be able to implement the following data structures as abstract data types in a high level programming lanauge: stack, queue, hash table, list, binary search tree (including AVL tree, red black tree and splay tree), B-tree, trie, disjoint set, graph (including minimum spanning tree and shortest path).
  2. To be able to use appropriate data structures in different applications.
  3. To be able to implement abstract data types.
  4. To be able to analyse the complexity of simple algorithms (such as searching and sorting).

Learning Activities

  1. Lectures
  2. Tutorials
  3. Web resources
  4. Assignments
  5. Examinations


LecturerTutor 1Tutor 2Tutor 3Tutor 4
Name Irwin King Jiani Zhang Ken Chan Tong Zhao Hongyi Zhang
Email king AT jnzhang AT hpchan AT tzhao AT hyzhang AT
Office SHB 908 SHB 1024 SHB 1024 SHB1024 SHB 1024
Telephone 3943 8398
Office Hour(s) * By appointment Monday
9:00 am - 10:00 am
9:00 am - 10:00 am
3:00 pm - 4:00 pm
3:00 pm - 4:00 pm