Search Course Outline
Showing 25 course outlines from 4474 matches
851
COMPSCI 345
: Human-computer Interaction2021 Semester One (1213)
Human behaviour and humans' expectations of computers. Computer interfaces and the interaction between humans and computers. The significance of the user interface, interface design and user centred design process in software development. Interface usability evaluation methodologies and practice. Includes a group development and evaluation project using current implementation techniques and tools.
Prerequisite: COMPSCI 230 or SOFTENG 206
Restriction: SOFTENG 350
Restriction: SOFTENG 350
852
COMPSCI 345
: Human-computer Interaction2020 Semester One (1203)
Human behaviour and humans' expectations of computers. Computer interfaces and the interaction between humans and computers. The significance of the user interface, interface design and user centred design process in software development. Interface usability evaluation methodologies and practice. Includes a group development and evaluation project using current implementation techniques and tools.
Prerequisite: COMPSCI 230 or SOFTENG 206
Restriction: SOFTENG 350
Restriction: SOFTENG 350
853
COMPSCI 350
: Mathematical Foundations of Computer Science2025 Semester One (1253)
The aim of this course is to present mathematical models for programming languages and computation, and derive some theorems regarding what can and cannot be computed. Abstract programming languages (finite automata, context-free grammars, Turing and register machines) are studied. Basic concepts for programming languages, limits on computational power and algorithmic complexity are presented. Church-Turing thesis and quantum computing are briefly and critically discussed.
Prerequisite: COMPSCI 220 or PHIL 222, and COMPSCI 225 or MATHS 254
854
COMPSCI 350
: Mathematical Foundations of Computer Science2024 Semester One (1243)
The aim of this course is to present mathematical models for programming languages and computation, and derive some theorems regarding what can and cannot be computed. Abstract programming languages (finite automata, context-free grammars, Turing and register machines) are studied. Basic concepts for programming languages, limits on computational power and algorithmic complexity are presented. Church-Turing thesis and quantum computing are briefly and critically discussed.
Prerequisite: COMPSCI 220 or PHIL 222, and COMPSCI 225 or MATHS 254
855
COMPSCI 350
: Mathematical Foundations of Computer Science2023 Semester One (1233)
The aim of this course is to present mathematical models for programming languages and computation, and derive some theorems regarding what can and cannot be computed. Abstract programming languages (finite automata, context-free grammars, Turing and register machines) are studied. Basic concepts for programming languages, limits on computational power and algorithmic complexity are presented. Church-Turing thesis and quantum computing are briefly and critically discussed.
Prerequisite: COMPSCI 220 or PHIL 222, and COMPSCI 225 or MATHS 254
856
COMPSCI 350
: Mathematical Foundations of Computer Science2022 Semester One (1223)
The aim of this course is to present mathematical models for programming languages and computation, and derive some theorems regarding what can and cannot be computed. Abstract programming languages (finite automata, context-free grammars, Turing and register machines) are studied. Basic concepts for programming languages, limits on computational power and algorithmic complexity are presented. Church-Turing thesis and quantum computing are briefly and critically discussed.
Prerequisite: COMPSCI 220 or PHIL 222, and 15 points from COMPSCI 225, MATHS 254, 255
857
COMPSCI 350
: Mathematical Foundations of Computer Science2020 Semester One (1203)
The aim of this course is to present mathematical models for programming languages and computation, and derive some theorems regarding what can and cannot be computed. Abstract programming languages (finite automata, context-free grammars, Turing and register machines) are studied. Basic concepts for programming languages, limits on computational power and algorithmic complexity are presented. Church-Turing thesis and quantum computing are briefly and critically discussed.
Prerequisite: COMPSCI 220 or PHIL 222, and 15 points from COMPSCI 225, MATHS 254, 255
858
COMPSCI 351
: Fundamentals of Database Systems2025 Semester One (1253)
Database principles. Relational model, Relational Algebra, Relational Calculus, SQL, SQL and Programming Languages, Entity Relationship Model, Normalisation, Query Processing and Query Optimisation, ACID Transactions, Transaction Isolation Levels, Database Recovery, Database Security, Databases and XML.
Prerequisite: COMPSCI 220, and COMPSCI 225 or MATHS 254
Restriction: COMPSCI 751, SOFTENG 351
Restriction: COMPSCI 751, SOFTENG 351
859
COMPSCI 351
: Fundamentals of Database Systems2024 Semester One (1243)
Database principles. Relational model, Relational Algebra, Relational Calculus, SQL, SQL and Programming Languages, Entity Relationship Model, Normalisation, Query Processing and Query Optimisation, ACID Transactions, Transaction Isolation Levels, Database Recovery, Database Security, Databases and XML.
Prerequisite: COMPSCI 220, and COMPSCI 225 or MATHS 254
Restriction: COMPSCI 751, SOFTENG 351
Restriction: COMPSCI 751, SOFTENG 351
860
COMPSCI 351
: Fundamentals of Database Systems2023 Semester One (1233)
Database principles. Relational model, Relational Algebra, Relational Calculus, SQL, SQL and Programming Languages, Entity Relationship Model, Normalisation, Query Processing and Query Optimisation, ACID Transactions, Transaction Isolation Levels, Database Recovery, Database Security, Databases and XML.
Prerequisite: COMPSCI 220, and COMPSCI 225 or MATHS 254
Restriction: COMPSCI 751, SOFTENG 351
Restriction: COMPSCI 751, SOFTENG 351
861
COMPSCI 351
: Fundamentals of Database Systems2022 Semester One (1223)
Database principles. Relational model, Relational Algebra, Relational Calculus, SQL, SQL and Programming Languages, Entity Relationship Model, Normalisation, Query Processing and Query Optimisation, ACID Transactions, Transaction Isolation Levels, Database Recovery, Database Security, Databases and XML.
Prerequisite: COMPSCI 220 and 15 points from COMPSCI 225, MATHS 254, 255
Restriction: COMPSCI 751, SOFTENG 351
Restriction: COMPSCI 751, SOFTENG 351
862
COMPSCI 351
: Fundamentals of Database Systems2021 Semester One (1213)
Database principles. Relational model, Relational Algebra, Relational Calculus, SQL, SQL and Programming Languages, Entity Relationship Model, Normalisation, Query Processing and Query Optimisation, ACID Transactions, Transaction Isolation Levels, Database Recovery, Database Security, Databases and XML.
Prerequisite: COMPSCI 220 and 15 points from COMPSCI 225, MATHS 254, 255
Restriction: COMPSCI 751, SOFTENG 351
Restriction: COMPSCI 751, SOFTENG 351
863
COMPSCI 361
: Machine Learning2025 Semester One (1253)
Machine learning is a branch of artificial intelligence concerned with making accurate, interpretable, computationally efficient, and robust inferences from data to solve a given problem. Understand the foundations of machine learning, and introduce practical skills to solve different problems.
Prerequisite: COMPSCI 220, and 15 points from DATASCI 100, STATS 101, 108, and 15 points from COMPSCI 225, MATHS 254, 255
Restriction: COMPSCI 762
Restriction: COMPSCI 762
864
COMPSCI 361
: Machine Learning2024 Semester One (1243)
Machine learning is a branch of artificial intelligence concerned with making accurate, interpretable, computationally efficient, and robust inferences from data to solve a given problem. Understand the foundations of machine learning, and introduce practical skills to solve different problems.
Prerequisite: COMPSCI 220, and 15 points from DATASCI 100, STATS 101, 108, and 15 points from COMPSCI 225, MATHS 254, 255
Restriction: COMPSCI 762
Restriction: COMPSCI 762
865
COMPSCI 361
: Machine Learning2023 Semester One (1233)
Machine learning is a branch of artificial intelligence concerned with making accurate, interpretable, computationally efficient, and robust inferences from data to solve a given problem. Understand the foundations of machine learning, and introduce practical skills to solve different problems.
Prerequisite: COMPSCI 220, and 15 points from DATASCI 100, STATS 101, 108, and 15 points from COMPSCI 225, MATHS 254, 255
Restriction: COMPSCI 762
Restriction: COMPSCI 762
866
COMPSCI 361
: Machine Learning2022 Semester One (1223)
Machine learning is a branch of artificial intelligence concerned with making accurate, interpretable, computationally efficient, and robust inferences from data to solve a given problem. Understand the foundations of machine learning, and introduce practical skills to solve different problems.
Prerequisite: COMPSCI 220, and 15 points from DATASCI 100, STATS 101, 108, and 15 points from COMPSCI 225, MATHS 254, 255
Restriction: COMPSCI 762
Restriction: COMPSCI 762
867
COMPSCI 361
: Machine Learning2021 Semester One (1213)
Machine learning is a branch of artificial intelligence concerned with making accurate, interpretable, computationally efficient, and robust inferences from data to solve a given problem. Understand the foundations of machine learning, and introduce practical skills to solve different problems.
Prerequisite: COMPSCI 220, and 15 points from DATASCI 100, STATS 101, 108, and 15 points from COMPSCI 225, MATHS 254, 255
Restriction: COMPSCI 762
Restriction: COMPSCI 762
868
COMPSCI 361
: Machine Learning2020 Semester One (1203)
Machine learning is a branch of artificial intelligence concerned with making accurate, interpretable, computationally efficient, and robust inferences from data to solve a given problem. Understand the foundations of machine learning, and introduce practical skills to solve different problems.
Prerequisite: COMPSCI 220, and 15 points from DATASCI 100, STATS 101, 108, and 15 points from COMPSCI 225, MATHS 254, 255
Restriction: COMPSCI 762
Restriction: COMPSCI 762
869
COMPSCI 367
: Artificial Intelligence2025 Semester Two (1255)
Covers algorithms and representational schemes used in artificial intelligence. AI search techniques (e.g., heuristic search, constraint satisfaction, etc.) for solving both optimal and satisficing tasks. Tasks such as game playing (adversarial search), planning, and natural language processing. Discusses and examines the history and future of AI and the ethics surrounding the use of AI in society.
Prerequisite: COMPSCI 220 and COMPSCI 225 or MATHS 254, or SOFTENG 282 and 284
Restriction: COMPSCI 761
Restriction: COMPSCI 761
870
COMPSCI 367
: Artificial Intelligence2024 Semester Two (1245)
Covers algorithms and representational schemes used in artificial intelligence. AI search techniques (e.g., heuristic search, constraint satisfaction, etc.) for solving both optimal and satisficing tasks. Tasks such as game playing (adversarial search), planning, and natural language processing. Discusses and examines the history and future of AI and the ethics surrounding the use of AI in society.
Prerequisite: COMPSCI 220 and COMPSCI 225 or MATHS 254, or SOFTENG 282 and 284
Restriction: COMPSCI 761
Restriction: COMPSCI 761
871
COMPSCI 367
: Artificial Intelligence2023 Semester Two (1235)
Covers algorithms and representational schemes used in artificial intelligence. AI search techniques (e.g., heuristic search, constraint satisfaction, etc.) for solving both optimal and satisficing tasks. Tasks such as game playing (adversarial search), planning, and natural language processing. Discusses and examines the history and future of AI and the ethics surrounding the use of AI in society.
Prerequisite: COMPSCI 220, and COMPSCI 225 or MATHS 254
Restriction: COMPSCI 761
Restriction: COMPSCI 761
872
COMPSCI 367
: Artificial Intelligence2022 Semester Two (1225)
Covers algorithms and representational schemes used in artificial intelligence. AI search techniques (e.g., heuristic search, constraint satisfaction, etc.) for solving both optimal and satisficing tasks. Tasks such as game playing (adversarial search), planning, and natural language processing. Discusses and examines the history and future of AI and the ethics surrounding the use of AI in society.
Prerequisite: COMPSCI 220 and 15 points from COMPSCI 225, MATHS 254, 255
Restriction: COMPSCI 761
Restriction: COMPSCI 761
873
COMPSCI 367
: Artificial Intelligence2021 Semester Two (1215)
Covers algorithms and representational schemes used in artificial intelligence. AI search techniques (e.g., heuristic search, constraint satisfaction, etc.) for solving both optimal and satisficing tasks. Tasks such as game playing (adversarial search), planning, and natural language processing. Discusses and examines the history and future of AI and the ethics surrounding the use of AI in society.
Prerequisite: COMPSCI 220 and 15 points from COMPSCI 225, MATHS 254, 255
Restriction: COMPSCI 761
Restriction: COMPSCI 761
874
COMPSCI 367
: Artificial Intelligence2020 Semester Two (1205)
The cornerstones of AI: representation, utilisation, and acquisition of knowledge. Taking a real world problem and representing it in a computer so that the computer can do inference. Utilising this knowledge and acquiring new knowledge is done by search which is the main technique behind planning and machine learning.
Prerequisite: COMPSCI 220 and 15 points from COMPSCI 225, MATHS 254, 255
Restriction: COMPSCI 761
Restriction: COMPSCI 761
875
COMPSCI 369
: Computational Methods in Interdisciplinary Science2025 Semester One (1253)
Many sciences use computational methods that involve the development and application of computer algorithms and software to answer scientific questions. This course looks at how to tackle these interdisciplinary problems through methods like probabilistic computer modelling, computer-based statistical inference, and computer simulations. The material is largely motivated by the life sciences but also uses examples from other sciences. It focuses on modelling and analysing real-world data with an emphasis on analysing DNA sequence data. No background in physical or life sciences is assumed.
Prerequisite: COMPSCI 220, and COMPSCI 225 or MATHS 254
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