Search Course Outline
12 course outlines found
1
COMPSCI 220
: Algorithms and Data Structures2025 Semester Two (1255)
An introduction to the analysis of algorithms and data structures. Common abstract data types and their implementations. Asymptotic complexity analysis. Sorting and searching algorithms. Depth-first and breadth-first search and applications. Graph optimisation problems.
Prerequisite: COMPSCI 120, 130
Restriction: COMPSCI 717, SOFTENG 284
Restriction: COMPSCI 717, SOFTENG 284
2
COMPSCI 220
: Algorithms and Data Structures2025 Semester One (1253)
An introduction to the analysis of algorithms and data structures. Common abstract data types and their implementations. Asymptotic complexity analysis. Sorting and searching algorithms. Depth-first and breadth-first search and applications. Graph optimisation problems.
Prerequisite: COMPSCI 120, 130
Restriction: COMPSCI 717, SOFTENG 284
Restriction: COMPSCI 717, SOFTENG 284
3
COMPSCI 220
: Algorithms and Data Structures2024 Semester Two (1245)
An introduction to the analysis of algorithms and data structures. Common abstract data types and their implementations. Asymptotic complexity analysis. Sorting and searching algorithms. Depth-first and breadth-first search and applications. Graph optimisation problems.
Prerequisite: COMPSCI 120, 130
Restriction: COMPSCI 717, SOFTENG 284
Restriction: COMPSCI 717, SOFTENG 284
4
COMPSCI 220
: Algorithms and Data Structures2024 Semester One (1243)
An introduction to the analysis of algorithms and data structures. Common abstract data types and their implementations. Asymptotic complexity analysis. Sorting and searching algorithms. Depth-first and breadth-first search and applications. Graph optimisation problems.
Prerequisite: COMPSCI 120, 130
Restriction: COMPSCI 717, SOFTENG 284
Restriction: COMPSCI 717, SOFTENG 284
5
COMPSCI 220
: Algorithms and Data Structures2023 Semester Two (1235)
An introduction to the analysis of algorithms and data structures. Common abstract data types and their implementations. Asymptotic complexity analysis. Sorting and searching algorithms. Depth-first and breadth-first search and applications. Graph optimisation problems.
Prerequisite: COMPSCI 120 and 15 points from COMPSCI 105, 107, 130
6
COMPSCI 220
: Algorithms and Data Structures2022 Semester Two (1225)
An introduction to the analysis of algorithms and data structures. Common abstract data types and their implementations. Asymptotic complexity analysis. Sorting and searching algorithms. Depth-first and breadth-first search and applications. Graph optimisation problems.
Prerequisite: COMPSCI 120 and 15 points from COMPSCI 105, 107, 130
7
COMPSCI 220
: Algorithms and Data Structures2022 Semester One (1223)
An introduction to the analysis of algorithms and data structures. Common abstract data types and their implementations. Asymptotic complexity analysis. Sorting and searching algorithms. Depth-first and breadth-first search and applications. Graph optimisation problems.
Prerequisite: COMPSCI 120 and 15 points from COMPSCI 105, 107, 130
8
COMPSCI 220
: Algorithms and Data Structures2021 Semester Two (1215)
An introduction to the analysis of algorithms and data structures. Common abstract data types and their implementations. Asymptotic complexity analysis. Sorting and searching algorithms. Depth-first and breadth-first search and applications. Graph optimisation problems.
Prerequisite: COMPSCI 120 and 15 points from COMPSCI 105, 107, 130
9
COMPSCI 220
: Algorithms and Data Structures2021 Semester One (1213)
An introduction to the analysis of algorithms and data structures. Common abstract data types and their implementations. Asymptotic complexity analysis. Sorting and searching algorithms. Depth-first and breadth-first search and applications. Graph optimisation problems.
Prerequisite: COMPSCI 120 and 15 points from COMPSCI 105, 107, 130
10
COMPSCI 220
: Algorithms and Data Structures2020 Semester Two (1205)
An introduction to the analysis of algorithms and data structures. Common abstract data types and their implementations. Asymptotic complexity analysis. Sorting and searching algorithms. Depth-first and breadth-first search and applications. Graph optimisation problems.
Prerequisite: COMPSCI 120 and 15 points from COMPSCI 105, 107, 130
11
COMPSCI 220
: Algorithms and Data Structures2023 Semester One (1233)
An introduction to the analysis of algorithms and data structures. Common abstract data types and their implementations. Asymptotic complexity analysis. Sorting and searching algorithms. Depth-first and breadth-first search and applications. Graph optimisation problems.
Prerequisite: COMPSCI 120 and 15 points from COMPSCI 105, 107, 130
Outline is not available yet
12
COMPSCI 220
: Algorithms and Data Structures2020 Semester One (1203)
An introduction to the analysis of algorithms and data structures. Common abstract data types and their implementations. Asymptotic complexity analysis. Sorting and searching algorithms. Depth-first and breadth-first search and applications. Graph optimisation problems.
Prerequisite: COMPSCI 120 and 15 points from COMPSCI 105, 107, 130
Outline is not available yet