Showing 25 course outlines from 4702 matches
776
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
777
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
778
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
779
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
780
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
781
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
782
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
783
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
784
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
785
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
786
COMPSCI 225
: Discrete Structures in Mathematics and Computer Science2025 Semester Two (1255)
An introduction to the foundations of computer science, mathematics and logic. Topics include logic, principles of counting, mathematical induction, recursion, sets and functions, graphs, codes, and finite automata.
Prerequisite: COMPSCI 120 or MATHS 120
Restriction: MATHS 254, SOFTENG 282
Restriction: MATHS 254, SOFTENG 282
787
COMPSCI 225
: Discrete Structures in Mathematics and Computer Science2025 Semester One (1253)
An introduction to the foundations of computer science, mathematics and logic. Topics include logic, principles of counting, mathematical induction, recursion, sets and functions, graphs, codes, and finite automata.
Prerequisite: COMPSCI 120 or MATHS 120
Restriction: MATHS 254, SOFTENG 282
Restriction: MATHS 254, SOFTENG 282
788
COMPSCI 225
: Discrete Structures in Mathematics and Computer Science2024 Semester Two (1245)
An introduction to the foundations of computer science, mathematics and logic. Topics include logic, principles of counting, mathematical induction, recursion, sets and functions, graphs, codes, and finite automata.
Prerequisite: COMPSCI 120 or MATHS 120
Restriction: MATHS 254, SOFTENG 282
Restriction: MATHS 254, SOFTENG 282
789
COMPSCI 225
: Discrete Structures in Mathematics and Computer Science2024 Semester One (1243)
An introduction to the foundations of computer science, mathematics and logic. Topics include logic, principles of counting, mathematical induction, recursion, sets and functions, graphs, codes, and finite automata.
Prerequisite: COMPSCI 120 or MATHS 120
Restriction: MATHS 254, SOFTENG 282
Restriction: MATHS 254, SOFTENG 282
790
COMPSCI 225
: Discrete Structures in Mathematics and Computer Science2023 Semester Two (1235)
An introduction to the foundations of computer science, mathematics and logic. Topics include logic, principles of counting, mathematical induction, recursion, sets and functions, graphs, codes, and finite automata.
Prerequisite: COMPSCI 120 or MATHS 120
Restriction: MATHS 254
Restriction: MATHS 254
791
COMPSCI 225
: Discrete Structures in Mathematics and Computer Science2023 Semester One (1233)
An introduction to the foundations of computer science, mathematics and logic. Topics include logic, principles of counting, mathematical induction, recursion, sets and functions, graphs, codes, and finite automata.
Prerequisite: COMPSCI 120 or MATHS 120
Restriction: MATHS 254
Restriction: MATHS 254
792
COMPSCI 225
: Discrete Structures in Mathematics and Computer Science2022 Semester Two (1225)
An introduction to the foundations of computer science, mathematics and logic. Topics include logic, principles of counting, mathematical induction, recursion, sets and functions, graphs, codes, and finite automata.
Prerequisite: 15 points from COMPSCI 120, MATHS 120, 150, 153
Restriction: MATHS 255
Restriction: MATHS 255
793
COMPSCI 225
: Discrete Structures in Mathematics and Computer Science2022 Semester One (1223)
An introduction to the foundations of computer science, mathematics and logic. Topics include logic, principles of counting, mathematical induction, recursion, sets and functions, graphs, codes, and finite automata.
Prerequisite: 15 points from COMPSCI 120, MATHS 120, 150, 153
Restriction: MATHS 255
Restriction: MATHS 255
794
COMPSCI 225
: Discrete Structures in Mathematics and Computer Science2021 Semester Two (1215)
An introduction to the foundations of computer science, mathematics and logic. Topics include logic, principles of counting, mathematical induction, recursion, sets and functions, graphs, codes, and finite automata.
Prerequisite: 15 points from COMPSCI 120, MATHS 120, 150, 153
Restriction: MATHS 255
Restriction: MATHS 255
795
COMPSCI 225
: Discrete Structures in Mathematics and Computer Science2021 Semester One (1213)
An introduction to the foundations of computer science, mathematics and logic. Topics include logic, principles of counting, mathematical induction, recursion, sets and functions, graphs, codes, and finite automata.
Prerequisite: 15 points from COMPSCI 120, MATHS 120, 150, 153
Restriction: MATHS 255
Restriction: MATHS 255
796
COMPSCI 225
: Discrete Structures in Mathematics and Computer Science2020 Semester Two (1205)
An introduction to the foundations of computer science, mathematics and logic. Topics include logic, principles of counting, mathematical induction, recursion, relations and functions, graphs and trees, and algorithms.
Prerequisite: 15 points from COMPSCI 120, MATHS 120, 150, 153
Restriction: MATHS 255
Restriction: MATHS 255
797
COMPSCI 225
: Discrete Structures in Mathematics and Computer Science2020 Semester One (1203)
An introduction to the foundations of computer science, mathematics and logic. Topics include logic, principles of counting, mathematical induction, recursion, relations and functions, graphs and trees, and algorithms.
Prerequisite: 15 points from COMPSCI 120, MATHS 120, 150, 153
Restriction: MATHS 255
Restriction: MATHS 255
798
COMPSCI 230
: Object Oriented Software Development2025 Semester Two (1255)
The design and implementation of object-oriented programmes. Analysis and design. Modelling with UML. Design for reuse, for testing, and for ease of change. Programming with classes, objects and polymorphism.
Prerequisite: COMPSCI 130
Restriction: SOFTENG 281
Restriction: SOFTENG 281
799
COMPSCI 230
: Object Oriented Software Development2025 Semester One (1253)
The design and implementation of object-oriented programmes. Analysis and design. Modelling with UML. Design for reuse, for testing, and for ease of change. Programming with classes, objects and polymorphism.
Prerequisite: COMPSCI 130
Restriction: SOFTENG 281
Restriction: SOFTENG 281
800
COMPSCI 230
: Object Oriented Software Development2024 Semester Two (1245)
The design and implementation of object-oriented programmes. Analysis and design. Modelling with UML. Design for reuse, for testing, and for ease of change. Programming with classes, objects and polymorphism.
Prerequisite: COMPSCI 130
Restriction: SOFTENG 281
Restriction: SOFTENG 281
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189