UniMate AI
昆士兰大学/课程目录

COMP7500

高级算法与数据结构

2 学分难度 超难

Analysis of algorithms. Solution of summation and recurrence equations. Algorithm paradigms: divide-and-conquer, greedy algorithms, dynamic programming, backtracking, branch-and-bound. Advanced graph algorithms. Amortised analysis. Self-adjusting data structures. Complexity classes, NP-completeness. Approximation algorithms. Randomized algorithms.

Syllabus

每周大纲

  1. 1

    Introduction and mathematical background

    Official weekly topics for Week 1: - Lecture: Introduction and mathematical background - Time and space complexity: the desire for an implementation independent measure; worst-case and average-case complexity. Evaluating efficiency: rate of growth, asymptotic time complexity; notation. Iterative algorithms: analysis of "while" and "for" loops; summations. Official timetable activities: - Lecture | Mon 11:00 | 60 mins | 42-115 Prentice Building, Learning Theatre - Lecture | Thu 10:00 | 120 mins | 80-2171 Queensland Bioscience Precinct, Learning Theatre - Tutorial | Thu 12:00 | 60 mins | 39A-208 General Purpose North 3, Collaborative Room Source: 2026 S2 UQ Course Profile - https://course-profiles.uq.edu.au/course-profiles/COMP7500-60805-7560

  2. 2

    Divide and conquer algorithms and recurrences

    Official weekly topics for Week 2: - Lecture: Divide and conquer algorithms and recurrences - Divide-and conquer, recursion; divide, conquer and combine. Solving recurrences: substitution; iterating the recurrence to get a summation; recursion trees; master method. Official timetable activities: - Lecture | Mon 11:00 | 60 mins | 42-115 Prentice Building, Learning Theatre - Lecture | Thu 10:00 | 120 mins | 80-2171 Queensland Bioscience Precinct, Learning Theatre - Tutorial | Thu 12:00 | 60 mins | 39A-208 General Purpose North 3, Collaborative Room Source: 2026 S2 UQ Course Profile - https://course-profiles.uq.edu.au/course-profiles/COMP7500-60805-7560

  3. 3

    Applied Class / Graph algorithms / Dynamic programming / Complexity classes

    No separate week-by-week topic is publicly listed for Week 3; official repeated teaching activities are shown below: - Applied Class: Applied Class - The applied classes provide weekly opportunities to apply the skills learnt in lectures to complete revision exercises with guidance from course staff. - Lecture: Graph algorithms - Directed and undirected graphs: vertex, edge, predecessor, successor, in-degree, out-degree, path, reachable, simple, cycle; weighted graphs. Graph representations: adjacency list and matrix representations. Graph algorithms: breadth-first search; depth-first search; topological sort. Minimal spanning tree: generic form, greedy choice strategy. - Lecture: Dynamic programming - Optimal substructure; overlapping sub-problems; table of sub-problem solutions; memoization; order of evaluation; dynamic programming. - Lecture: Complexity classes - Decision problems; tractable and intractable problems; Polynomial time; the class P; Polynomial time verification; the class NP; reducibility; NP-completeness. Traveling-salesman problem. Official timetable activities: - Lecture | Mon 11:00 | 60 mins | 42-115 Prentice Building, Learning Theatre - Lecture | Thu 10:00 | 120 mins | 80-2171 Queensland Bioscience Precinct, Learning Theatre - Tutorial | Thu 12:00 | 60 mins | 39A-208 General Purpose North 3, Collaborative Room Source: 2026 S2 UQ Course Profile - https://course-profiles.uq.edu.au/course-profiles/COMP7500-60805-7560

  4. 4

    Applied Class / Graph algorithms / Dynamic programming / Complexity classes

    No separate week-by-week topic is publicly listed for Week 4; official repeated teaching activities are shown below: - Applied Class: Applied Class - The applied classes provide weekly opportunities to apply the skills learnt in lectures to complete revision exercises with guidance from course staff. - Lecture: Graph algorithms - Directed and undirected graphs: vertex, edge, predecessor, successor, in-degree, out-degree, path, reachable, simple, cycle; weighted graphs. Graph representations: adjacency list and matrix representations. Graph algorithms: breadth-first search; depth-first search; topological sort. Minimal spanning tree: generic form, greedy choice strategy. - Lecture: Dynamic programming - Optimal substructure; overlapping sub-problems; table of sub-problem solutions; memoization; order of evaluation; dynamic programming. - Lecture: Complexity classes - Decision problems; tractable and intractable problems; Polynomial time; the class P; Polynomial time verification; the class NP; reducibility; NP-completeness. Traveling-salesman problem. Official timetable activities: - Lecture | Mon 11:00 | 60 mins | 42-115 Prentice Building, Learning Theatre - Lecture | Thu 10:00 | 120 mins | 80-2171 Queensland Bioscience Precinct, Learning Theatre - Tutorial | Thu 12:00 | 60 mins | 39A-208 General Purpose North 3, Collaborative Room Source: 2026 S2 UQ Course Profile - https://course-profiles.uq.edu.au/course-profiles/COMP7500-60805-7560

  5. 5

    Applied Class / Graph algorithms / Dynamic programming / Complexity classes

    No separate week-by-week topic is publicly listed for Week 5; official repeated teaching activities are shown below: - Applied Class: Applied Class - The applied classes provide weekly opportunities to apply the skills learnt in lectures to complete revision exercises with guidance from course staff. - Lecture: Graph algorithms - Directed and undirected graphs: vertex, edge, predecessor, successor, in-degree, out-degree, path, reachable, simple, cycle; weighted graphs. Graph representations: adjacency list and matrix representations. Graph algorithms: breadth-first search; depth-first search; topological sort. Minimal spanning tree: generic form, greedy choice strategy. - Lecture: Dynamic programming - Optimal substructure; overlapping sub-problems; table of sub-problem solutions; memoization; order of evaluation; dynamic programming. - Lecture: Complexity classes - Decision problems; tractable and intractable problems; Polynomial time; the class P; Polynomial time verification; the class NP; reducibility; NP-completeness. Traveling-salesman problem. Official timetable activities: - Lecture | Mon 11:00 | 60 mins | 42-115 Prentice Building, Learning Theatre - Lecture | Thu 10:00 | 120 mins | 80-2171 Queensland Bioscience Precinct, Learning Theatre - Tutorial | Thu 12:00 | 60 mins | 39A-208 General Purpose North 3, Collaborative Room Source: 2026 S2 UQ Course Profile - https://course-profiles.uq.edu.au/course-profiles/COMP7500-60805-7560

  6. 6

    Applied Class / Graph algorithms / Dynamic programming / Complexity classes

    No separate week-by-week topic is publicly listed for Week 6; official repeated teaching activities are shown below: - Applied Class: Applied Class - The applied classes provide weekly opportunities to apply the skills learnt in lectures to complete revision exercises with guidance from course staff. - Lecture: Graph algorithms - Directed and undirected graphs: vertex, edge, predecessor, successor, in-degree, out-degree, path, reachable, simple, cycle; weighted graphs. Graph representations: adjacency list and matrix representations. Graph algorithms: breadth-first search; depth-first search; topological sort. Minimal spanning tree: generic form, greedy choice strategy. - Lecture: Dynamic programming - Optimal substructure; overlapping sub-problems; table of sub-problem solutions; memoization; order of evaluation; dynamic programming. - Lecture: Complexity classes - Decision problems; tractable and intractable problems; Polynomial time; the class P; Polynomial time verification; the class NP; reducibility; NP-completeness. Traveling-salesman problem. Official timetable activities: - Lecture | Mon 11:00 | 60 mins | 42-115 Prentice Building, Learning Theatre - Lecture | Thu 10:00 | 120 mins | 80-2171 Queensland Bioscience Precinct, Learning Theatre - Tutorial | Thu 12:00 | 60 mins | 39A-208 General Purpose North 3, Collaborative Room Source: 2026 S2 UQ Course Profile - https://course-profiles.uq.edu.au/course-profiles/COMP7500-60805-7560

  7. 7

    Applied Class / Graph algorithms / Dynamic programming / Complexity classes

    No separate week-by-week topic is publicly listed for Week 7; official repeated teaching activities are shown below: - Applied Class: Applied Class - The applied classes provide weekly opportunities to apply the skills learnt in lectures to complete revision exercises with guidance from course staff. - Lecture: Graph algorithms - Directed and undirected graphs: vertex, edge, predecessor, successor, in-degree, out-degree, path, reachable, simple, cycle; weighted graphs. Graph representations: adjacency list and matrix representations. Graph algorithms: breadth-first search; depth-first search; topological sort. Minimal spanning tree: generic form, greedy choice strategy. - Lecture: Dynamic programming - Optimal substructure; overlapping sub-problems; table of sub-problem solutions; memoization; order of evaluation; dynamic programming. - Lecture: Complexity classes - Decision problems; tractable and intractable problems; Polynomial time; the class P; Polynomial time verification; the class NP; reducibility; NP-completeness. Traveling-salesman problem. Official timetable activities: - Lecture | Mon 11:00 | 60 mins | 42-115 Prentice Building, Learning Theatre - Lecture | Thu 10:00 | 120 mins | 80-2171 Queensland Bioscience Precinct, Learning Theatre - Tutorial | Thu 12:00 | 60 mins | 39A-208 General Purpose North 3, Collaborative Room Source: 2026 S2 UQ Course Profile - https://course-profiles.uq.edu.au/course-profiles/COMP7500-60805-7560

  8. 8

    Greedy algorithms

    Official weekly topics for Week 8: - Lecture: Greedy algorithms - Greedy method: optimal substructure; greedy choice property; comparison of dynamic programming and greedy paradigms. Official timetable activities: - Lecture | Mon 11:00 | 60 mins | 42-115 Prentice Building, Learning Theatre - Lecture | Thu 10:00 | 120 mins | 80-2171 Queensland Bioscience Precinct, Learning Theatre - Tutorial | Thu 12:00 | 60 mins | 39A-208 General Purpose North 3, Collaborative Room Source: 2026 S2 UQ Course Profile - https://course-profiles.uq.edu.au/course-profiles/COMP7500-60805-7560

  9. 9

    Amortised analysis

    Official weekly topics for Week 9: - Lecture: Amortised analysis - Efficiency analysis in terms of sequences of operations; crude analysis; global analysis; the accounting method; the potential method. Official timetable activities: - Lecture | Mon 11:00 | 60 mins | 42-115 Prentice Building, Learning Theatre - Lecture | Thu 10:00 | 120 mins | 80-2171 Queensland Bioscience Precinct, Learning Theatre - Tutorial | Thu 12:00 | 60 mins | 39A-208 General Purpose North 3, Collaborative Room Source: 2026 S2 UQ Course Profile - https://course-profiles.uq.edu.au/course-profiles/COMP7500-60805-7560

  10. 10

    Applied Class / Graph algorithms / Dynamic programming / Complexity classes

    No separate week-by-week topic is publicly listed for Week 10; official repeated teaching activities are shown below: - Applied Class: Applied Class - The applied classes provide weekly opportunities to apply the skills learnt in lectures to complete revision exercises with guidance from course staff. - Lecture: Graph algorithms - Directed and undirected graphs: vertex, edge, predecessor, successor, in-degree, out-degree, path, reachable, simple, cycle; weighted graphs. Graph representations: adjacency list and matrix representations. Graph algorithms: breadth-first search; depth-first search; topological sort. Minimal spanning tree: generic form, greedy choice strategy. - Lecture: Dynamic programming - Optimal substructure; overlapping sub-problems; table of sub-problem solutions; memoization; order of evaluation; dynamic programming. - Lecture: Complexity classes - Decision problems; tractable and intractable problems; Polynomial time; the class P; Polynomial time verification; the class NP; reducibility; NP-completeness. Traveling-salesman problem. Official timetable activities: - Lecture | Mon 11:00 | 60 mins | 42-115 Prentice Building, Learning Theatre - Lecture | Thu 10:00 | 120 mins | 80-2171 Queensland Bioscience Precinct, Learning Theatre - Tutorial | Thu 12:00 | 60 mins | 39A-208 General Purpose North 3, Collaborative Room Source: 2026 S2 UQ Course Profile - https://course-profiles.uq.edu.au/course-profiles/COMP7500-60805-7560

  11. 11

    Applied Class / Graph algorithms / Dynamic programming / Complexity classes

    No separate week-by-week topic is publicly listed for Week 11; official repeated teaching activities are shown below: - Applied Class: Applied Class - The applied classes provide weekly opportunities to apply the skills learnt in lectures to complete revision exercises with guidance from course staff. - Lecture: Graph algorithms - Directed and undirected graphs: vertex, edge, predecessor, successor, in-degree, out-degree, path, reachable, simple, cycle; weighted graphs. Graph representations: adjacency list and matrix representations. Graph algorithms: breadth-first search; depth-first search; topological sort. Minimal spanning tree: generic form, greedy choice strategy. - Lecture: Dynamic programming - Optimal substructure; overlapping sub-problems; table of sub-problem solutions; memoization; order of evaluation; dynamic programming. - Lecture: Complexity classes - Decision problems; tractable and intractable problems; Polynomial time; the class P; Polynomial time verification; the class NP; reducibility; NP-completeness. Traveling-salesman problem. Official timetable activities: - Lecture | Mon 11:00 | 60 mins | 42-115 Prentice Building, Learning Theatre - Lecture | Thu 10:00 | 120 mins | 80-2171 Queensland Bioscience Precinct, Learning Theatre - Tutorial | Thu 12:00 | 60 mins | 39A-208 General Purpose North 3, Collaborative Room Source: 2026 S2 UQ Course Profile - https://course-profiles.uq.edu.au/course-profiles/COMP7500-60805-7560

  12. 12

    Randomised algorithms

    Official weekly topics for Week 12: - Lecture: Randomised algorithms - Probabilistic analysis, randomised quicksort. Official timetable activities: - Lecture | Mon 11:00 | 60 mins | 42-115 Prentice Building, Learning Theatre - Lecture | Thu 10:00 | 120 mins | 80-2171 Queensland Bioscience Precinct, Learning Theatre - Tutorial | Thu 12:00 | 60 mins | 39A-208 General Purpose North 3, Collaborative Room Source: 2026 S2 UQ Course Profile - https://course-profiles.uq.edu.au/course-profiles/COMP7500-60805-7560

Assessment

考核结构

Online quizzes Online

Official due date: 15/08/2025 3:00 pm 22/08/2025 3:00 pm 29/08/2025 3:00 pm 12/09/2025 3:00 pm 17/10/2025 3:00 pm 31/10/2025 3:00 pm. Source: 2026 S2 UQ Course Profile.

10%

Assignment 1 Online

Official due date: 19/09/2025 3:00 pm. Source: 2026 S2 UQ Course Profile.

15%

Assignment 2

Official due date: 24/10/2025 3:00 pm. Source: 2026 S2 UQ Course Profile.

15%

Final Examination Hurdle Identity Verified In-personHurdle

Official due date: End of Semester Exam Period 8/11/2025 - 22/11/2025. Source: 2026 S2 UQ Course Profile.

60%

From Seniors

学长留下的

基础信息谁都查得到,真正值钱的是过来人的经验。

学姐说

比你早一年的学长留下的真实经验 —— ChatGPT 给不了。

这门课还没有学长经验,你可以是第一个 —— 注册后在课内分享。

往年考点 / 踩坑

这门课暂无往年考点记录。

毕业生去向(整体)

下面是匠人学院毕业生整体去过的公司分布(来自脱敏校友证言)。这是全平台的总体去向,不代表选这门课的人一定去这些公司。

统计自 313 份脱敏校友证言

Deloitte

6 位校友

岗位:Graduate Program · Graduate Consulting · Platform Engineer · Web developer · Platform engineer

Zerologix

4 位校友

岗位:Frontend Dev · junior frontend developer · Front-end Developer · Full Stack Developer

Servian

4 位校友

岗位:Full-stack Developer · Data Engineer · Consultant

关于这块数据,我们说实话

雇主墙来自脱敏毕业生证言（testimonials）的整体分布，无法关联到具体学员或其所选课程；仅作为毕业生去向的总体社会证明展示。

我们没有"某位学长选了这门课、后来进了哪家公司"这种可查询的个人去向档案 —— 校友证言是脱敏的,无法关联到具体的人或他选过的课。所以这里只给整体分布,不给个人路径,不编。