2026/27 · Official catalogue edition
The effective term printed in this PDF is Semester A 2025/26。
Offering record for 2026/27：Semester A 2026/27 · Catalogue source ↗
What you will study
- Course overview
- This course aims to introduce the algorithms in various domains, and techniques for designing efficient algorithms. It trains students the ability to analyse algorithms and the skills to design solutions to problems.
Official PDF, page 2 · Abstract
- Course content
- Keyword Syllabus Algorithm analysis. Algorithm design: divide-and-conquer approach, greedy approach. Graph algorithms: graph searching, topological sort, minimum spanning tree, shortest paths, backtracking and its applications in games. String matching. Dynamic programming and longest common subsequence. Theory of NP-completeness. Turing machines and the halting problem. Introduction to computational complexity. Syllabus • 1. Algorithm analysis Review on program correctness and complexities, and the mathematical tools for analysis. • Graph algorithms Representation of graphs. Algorithms for graph searching. Topological sort. Minimum spanning trees. Greedy design approach. Shortest paths, transitive closure and their relations with matrix multiplication. Backtracking and applications in games. • String algorithms String matching. Longest common subsequence. Dynamic programming. • Theory of NP-completeness Problem reduction. P and NP. Some NP-complete problems. Approximation algorithms.
Official PDF, page 4 · Keyword Syllabus; Syllabus
- Intended learning outcomes
View official learning outcomes and conditions
Course Intended Learning Outcomes (CILOs) CILOs Weighting (if DEC-A1 DEC-A2 DEC-A3 app.) 1 Prove the correctness and analyse the running x x time and performance of the major algorithms for those classic problems in various domains. 2 Apply algorithmic paradigms and methods by x x using design techniques to solve problems. 3 Investigate the complexities of various problems x in different domains. 4 Propose new solutions for problems through independent study. A1: Attitude Develop an attitude of discovery/innovation/creativity, as demonstrated by students possessing a strong sense of curiosity, asking questions actively, challenging assumptions or engaging in inquiry together with teachers. A2: Ability Develop the ability/skill needed to discover/innovate/create, as demonstrated by students possessing critical thinking skills to assess ideas, acquiring research skills, synthesizing knowledge across disciplines or applying academic knowledge to real-life problems. A3: Accomplishments Demonstrate accomplishment of discovery/innovation/creativity through producing /constructing creative works/new artefacts, effective solutions to real-life problems or new processes.Official PDF, page 2 · Course Intended Learning Outcomes (CILOs)
Before you take this course
Check prerequisites, precursors and corequisites separately, together with equivalence and exclusion conditions. “and” means conditions must be met together; “or” marks alternatives. Read combined conditions in the groupings shown in the original text below.
- Prerequisites
- Nil
Official PDF, page 1 · Prerequisites
- Precursors
- CS2468 Data Structures and Data Management or CS3334 Data Structures or EE2331 Data Structures and Algorithms, or equivalent
Official PDF, page 1 · Precursors
- Corequisites
- Complete official information for this field is not available.
- Additional course requirements
- Complete official information for this field is not available.
- Equivalent courses and conditions
- Nil
Official PDF, page 1 · Equivalent Courses
- Exclusive courses and conditions
- Nil
Official PDF, page 1 · Exclusive Courses
Assessment and passing the course
- Assessment
- Continuous assessment: 30%; Examination: 70%; Examination duration: 2 hours
Assessment breakdown
Assessment task Weight Generative AI Remarks and restrictions AssignmentsCILO 1, 2, 3, 4 30% Not stated in source Not stated in source row View the original assessment table and instructions
Assessment Tasks / Activities (ATs) 3 CS4335: Design and Analysis of Algorithms ATs CILO No. Weighting (%) Remarks ("-" for Allow Use of nil entry) GenAI? 1 Assignments 1, 2, 3, 4 30 - No Continuous Assessment (%) 30 Examination (%) 70 Examination Duration (Hours) 2 Minimum Examination Passing Requirement (%) 30 Additional Information for ATs For a student to pass the course, at least 30% of the maximum mark for the examination must be obtained.
- Passing requirements
- Minimum Examination Passing Requirement (%) 30 Additional Information for ATs For a student to pass the course, at least 30% of the maximum mark for the examination must be obtained.
Official PDF, page 3 · Additional Information for ATs
Credits, duration and edition details
- Title in this edition
- Design and Analysis of Algorithms
Official PDF, page 1 · Course Code and Course Title
- Credits in this edition
- 3
Official PDF, page 1 · Credit Units
- Course duration
- One Semester
Official PDF, page 1 · Course Duration
- Syllabus effective term
- Semester A 2025/26
- Levels printed in the syllabus
- B1, B2, B3, B4 - Bachelor's Degree
Check the official document
Read or download this edition through the university link below. CS4335 · Open the original university PDF ↗
Source · University course information ↗ · Checked