Courses Offered

COMP2119 Introduction to Data Structures and Algorithms

2025-26

Instructor(s):

Chan Hubert

(Class A)

No. of credit(s):

Kao Benjamin

(Class B)

Fang Juanru

(Class C)

Yiu S M

(Class D)

Recommended Learning Hours:

Lecture:	34.0
Tutorial:	5.0

Pre-requisite(s):

COMP2113 or COMP2123 or ENGG1340

Co-requisite(s):

Mutually exclusive with:

COMP2118

Remarks:

Course Learning Outcomes

1.	[Mathematics foundation] understand the concept of time, space complexity and analyze the time and space complexities of an algorithm and a data structure.
2.	[Data structures] understand well-known generic data structures such as stack, queue, tree and related algorithms and apply them to solve problems.
3.	[Problem solving] design new data structures and algorithms to solve problems.
4.	[Implementation] implement selected data structures and algorithms.

Mapping from Course Learning Outcomes to Programme Learning Outcomes
	PLO a	PLO b	PLO c	PLO d
CLO 1	T
CLO 2		T
CLO 3			T
CLO 4				T

T - Teach, P - Practice
For BEng(CompSc) Programme Learning Outcomes, please refer to here.

Syllabus

Calendar Entry:
Arrays, linked lists, trees and graphs; stacks and queues; symbol tables; priority queues, balanced trees; sorting algorithms; complexity analysis.

Detailed Description:

Mathematics foundation	Mapped to CLOs
Growth of functions, recurrences, time and space complexity	1
Basic data structures and algorithms	Mapped to CLOs
Array, linked list, stack, queue, trees, hashing, graphs, sorting and searching algorithms	2, 3, 4
Advanced data structures and algorithms	Mapped to CLOs
Balanced tree, heap, priority queue, sorting in linear time	2, 3, 4
Lower bound	Mapped to CLOs
Techniques for proving lower bounds, lower bound for sorting	1

Assessment:
Continuous Assessment: 40%
Written Examination: 60%

Teaching Plan

Please refer to the corresponding Moodle course.

Moodle Course(s)

Courses Offered

COMP2119 Introduction to Data Structures and Algorithms

Sign in to your account

Sign in to your account