Search Course Outline
Showing 25 course outlines from 4473 matches
751
COMPSCI 210
: Computer Organisation2020 Semester One (1203)
The low level representation of data and algorithms in the computer. An introduction to computer organisation. The instruction execution model. Assembly and disassembly of instructions. Assembly language programming. How a high-level language is implemented at the machine level. The memory subsystem. Hardware support necessary to implement a secure multi-user operating system.
Prerequisite: COMPSCI 110, and 15 points from COMPSCI 105, 107, 130
752
COMPSCI 215
: Data Communications and Security2024 Semester One (1243)
An introduction to data communications: the OSI reference model, particularly how the lower layers combine to implement the application layer. An introduction to secure communication and computer systems.
Prerequisite: COMPSCI 110, 130, PHYSICS 140
753
COMPSCI 215
: Data Communications and Security2023 Semester One (1233)
An introduction to data communications: the OSI reference model, particularly how the lower layers combine to implement the application layer. An introduction to secure communication and computer systems.
Prerequisite: COMPSCI 110 and PHYSICS 140 and 15 points from COMPSCI 105, 107, 130
754
COMPSCI 215
: Data Communications and Security2022 Semester One (1223)
An introduction to data communications: the OSI reference model, particularly how the lower layers combine to implement the application layer. An introduction to secure communication and computer systems.
Prerequisite: COMPSCI 110 and PHYSICS 140 and 15 points from COMPSCI 105, 107, 130
755
COMPSCI 215
: Data Communications and Security2021 Semester One (1213)
An introduction to data communications: the OSI reference model, particularly how the lower layers combine to implement the application layer. An introduction to secure communication and computer systems.
Prerequisite: COMPSCI 110 and PHYSICS 140 and 15 points from COMPSCI 105, 107, 130
756
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
757
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
758
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
759
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
760
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
761
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
762
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
763
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
764
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
765
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
766
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
767
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
768
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
769
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
770
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
771
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
772
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
773
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
774
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
775
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
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