COMP3506/7505
Algorithm and Data Structure
暂无已安排的考试。
关于 COMP3506/7505
COMP3506 and COMP7505 are UQ's core algorithms and data structures courses, taught at the undergraduate (3506) and postgraduate (7505) levels with shared content. The course assumes you can already program in Python or Java and focuses on the design, analysis, and implementation of standard data structures (hash tables, trees, heaps, graphs) and algorithms (sorting, searching, traversal, shortest path). Big-O analysis is woven through every topic. StudyPilot's question bank for these courses focuses on the question types that consistently appear on past papers: complexity analysis with full justification, structural questions on hash tables and trees, graph algorithm tracing, and short conceptual answers. Each question includes a worked solution that explains why each step is needed, not just the final answer.
考试形式
The COMP3506/7505 final is typically a 2-hour paper, weighted around 50-60% of the final mark. Questions mix short conceptual prompts (Big-O, true/false on data structure properties) with longer questions that ask you to design, modify, or analyse an algorithm. Open-book versus closed-book status has varied between offerings, so check the current semester's course profile before exam day.
这里还没有内容，我们每周都会新增材料。
这里还没有内容，我们每周都会新增材料。
这里还没有内容，我们每周都会新增材料。
The question bank is growing. We focus on the question types that appear most often on past papers — Big-O analysis, hash table operations, graph algorithms, and amortised analysis — rather than padding the count with low-value questions.
Yes. The two courses share content and exam style at UQ. The question bank is built to serve both levels, with notes where any topic is treated differently.
It depends on the current semester's exam format. In practice, the question types are the same — only the time pressure changes. Train under both conditions and you will be ready for either format.
Every Big-O answer includes the formal definition (constants c and n0), the picked values, and the inequality check. Hand-wavy answers lose half the marks on the real exam, so we model the full proof in our solutions.
Yes. Amortised analysis is one of the highest-cost topics on past papers and we cover it with both worked examples (dynamic arrays, splay trees) and practice questions in the aggregate and accounting methods.
Solutions are written by tutors with COMP3506/7505 background and reviewed for technical correctness. If you spot an error, the report-a-question button on each card lets us fix it within 24 hours.
Yes. A free tier gives you a daily set of questions across all major topics. Full access to every question and the spaced-repetition flashcards is part of the premium plan.