OlveraeUNSW
Browse courses
COMP2521
Data Structures and Algorithms
COMP2521 · Final Exam
45%

Final Exam

Start learning →
Format
Individual
Start date
During Exam Week
Due date
TBA — During Exam Week
2
papers
11
topics
5
must-know

Mark distribution

100
per paper
Hover the chart or list
  • 01
    Graphs (Basics)
    30.0
    100%
  • 02
    Binary Trees / BST
    19.5
    100%
  • 03
    Sorting Algorithms
    13.0
    100%
  • 04
    Algorithm Complexity
    10.0
    100%
  • 05
    Linked Lists
    10.0
    50%
  • 06
    Graph Algorithms
    4.5
    100%
  • 07
    Hash Tables
    3.5
    50%
  • 08
    Trie
    3.5
    50%
  • 09
    Priority Queue / Heap
    2.5
    50%
  • 10
    Balanced Trees
    2.0
    50%
  • 11
    ADTs / C
    1.5
    50%

Top 6 topics · trend

018352021 T32024 T2

Topic × paper heatmap

2021 T3 Sample
2024 T2 Sample
Graphs (Basics)
35
25
Binary Trees / BST
15
24
Sorting Algorithms
20
6
Algorithm Complexity
13
7
Linked Lists
20
Graph Algorithms
6
3
Hash Tables
7
Trie
7
Priority Queue / Heap
5
Balanced Trees
4
ADTs / C
3