Search Course Outline
5 course outlines found
1
COMPSCI 717
: Fundamentals of Algorithmics2024 Semester One (1243)
Fundamental techniques are covered for the design of algorithms such as greedy algorithms, divide-and-conquer, and dynamic programming. Data structures are explored that help implement algorithms. Essential tools are taught for analysing algorithms, for example worst- and average-case analyses of space and time. Recommended preparation: COMPSCI 120, 130
Restriction: COMPSCI 220, 320, SOFTENG 250, 284
2
COMPSCI 717
: Fundamentals of Algorithmics2023 Semester One (1233)
Fundamental techniques are covered for the design of algorithms such as greedy algorithms, divide-and-conquer, and dynamic programming. Data structures are explored that help implement algorithms. Essential tools are taught for analysing algorithms, for example worst- and average-case analyses of space and time. Recommended preparation: 15 points from COMPSCI 120 or equivalent and 15 points from COMPSCI 130 or equivalent
Prerequisite: Approval of Academic Head or nominee
Restriction: COMPSCI 220, 320, SOFTENG 250
Restriction: COMPSCI 220, 320, SOFTENG 250
3
COMPSCI 717
: Fundamentals of Algorithmics2022 Semester One (1223)
Fundamental techniques are covered for the design of algorithms such as greedy algorithms, divide-and-conquer, and dynamic programming. Data structures are explored that help implement algorithms. Essential tools are taught for analysing algorithms, for example worst- and average-case analyses of space and time. Recommended preparation: 15 points from COMPSCI 120 or equivalent and 15 points from COMPSCI 130 or equivalent
Prerequisite: Approval of Academic Head or nominee
Restriction: COMPSCI 220, 320, SOFTENG 250
Restriction: COMPSCI 220, 320, SOFTENG 250
4
COMPSCI 717
: Fundamentals of Algorithmics2021 Semester One (1213)
Fundamental techniques are covered for the design of algorithms such as greedy algorithms, divide-and-conquer, and dynamic programming. Data structures are explored that help implement algorithms. Essential tools are taught for analysing algorithms, for example worst- and average-case analyses of space and time. Recommended preparation: 15 points from COMPSCI 120 or equivalent and 15 points from COMPSCI 130 or equivalent
Prerequisite: Approval of Academic Head or nominee
Restriction: COMPSCI 220, 320, SOFTENG 250
Restriction: COMPSCI 220, 320, SOFTENG 250
5
COMPSCI 717
: Fundamentals of Algorithmics2020 Semester One (1203)
Fundamental techniques are covered for the design of algorithms such as greedy algorithms, divide-and-conquer, and dynamic programming. Data structures are explored that help implement algorithms. Essential tools are taught for analysing algorithms, for example worst- and average-case analyses of space and time. Recommended preparation: 15 points from COMPSCI 120 or equivalent and 15 points from COMPSCI 130 or equivalent
Prerequisite: Approval of Academic Head or nominee
Restriction: COMPSCI 220, 320, SOFTENG 250
Restriction: COMPSCI 220, 320, SOFTENG 250