Algorithms and Data Structures

算法与数据结构

Faculty of Engineering and Information Technology

所属 Computing and Software Systems B-SCI

12.5

学分 Credits

L2

等级 Level

Sem 1

学期 Semester

Parkville

校区 Campus

课程描述 Description

Advanced data structures including heaps, hash tables, balanced BSTs, and graphs. Algorithm design paradigms: divide-and-conquer, dynamic programming, greedy algorithms. Complexity analysis.

高级数据结构（堆、哈希表、平衡BST、图）与算法设计范式：分治、动态规划、贪心算法。复杂度分析。

学习成果 ILOs

1Implement and use advanced data structures (heaps, hash tables, BSTs, graphs)
2Apply algorithm design paradigms to solve complex problems
3Analyse time and space complexity of algorithms
4Design efficient solutions for graph-based problems

🏫

查看 Handbook 原文https://handbook.unimelb.edu.au/subjects/comp20003

↗

📌 课程信息来源于 Melbourne University Handbook，选课建议为 AI 生成仅供参考。请以官方 Handbook 为准。
数据更新时间：2026 年 2 月 | WhiteMirror 不对信息准确性承担责任