Computer Science
Unit of study table
Computer Science major |
|---|
| Achievement of a major in Computer Science requires 48 credit points from this table including: |
| (i) 12 credit points of 1000-level core units |
| (ii) 18 credit points of 2000-level core units |
| (iii) 12 credit points of 3000-level core units |
| (iv) 6 credit points of 3000-level (major only) selective units. |
Computer Science minor |
| Achievement of a minor in Computer Science requires 36 credit points from this table including: |
| (i) 12 credit points of 1000-level core units |
| (ii) 18 credit points of 2000-level core units |
| (iii) 6 credit points of 3000-level (minor only) selective units |
Unit of study |
Credit points |
A: Assumed knowledge P: Prerequisites
|
|---|---|---|
Core units |
||
1000-level units of study |
||
INFO1110 |
6 |
N INFO1910 or INFO1103 or INFO1903 or INFO1105 or INFO1905 or ENGG1810 |
INFO1910 |
6 |
A ATAR sufficient to enter Dalyell program, or passing an online programming knowledge test, which will be administered during the O-week prior to the commencement of the semester |
INFO1113 |
6 |
P INFO1110 or INFO1910 or ENGG1810 |
2000-level units of study |
||
COMP2017 |
6 |
A Discrete mathematics and probability (e.g. MATH1064 or equivalent); linear algebra (e.g. MATH1061 or equivalent) |
COMP2022 |
6 |
A Discrete mathematics and probability (e.g. MATH1064 or equivalent) |
COMP2922 |
6 |
A Discrete mathematics and probability (e.g. MATH1064 or equivalent) P Distinction level results in (INFO1110 or INFO1910 or INFO1113 or ENGG1810) C COMP2123 or COMP2823 N COMP2022 |
COMP2123 |
6 |
A Discrete mathematics and probability (e.g. MATH1064 or equivalent) |
COMP2823 |
6 |
A Discrete mathematics and probability (e.g. MATH1064 or equivalent) |
3000-level units of study |
||
COMP3027 |
6 |
A Discrete mathematics and probability (e.g. MATH1064 or equivalent) P COMP2123 or COMP2823 N COMP2007 or COMP2907 or COMP3927 |
COMP3927 |
6 |
A Discrete mathematics and probability (e.g. MATH1064 or equivalent) P Distinction level results in COMP2123 or COMP2823 N COMP2007 or COMP2907 or COMP3027 |
COMP3888 |
6 |
P (INFO1110 or INFO1910) and INFO1113 and (COMP2123 or COMP2823) and COMP2017 and (COMP2022 or COMP2922) |
COMP3988 |
6 |
P (INFO1110 or INFO1910) and INFO1113 and (COMP2123 or COMP2823) and COMP2017 and (COMP2022 or COMP2922) with Distinction level results in at least one of these units N INFO3600 or COMP3615 or COMP3600 or COMP3888 |
Selective units (major only) |
||
COMP3109 |
6 |
|
COMP3221 |
6 |
P (INFO1105 or INFO1905) or ((INFO1103 or INFO1113) and (COMP2123 or COMP2823)) |
COMP3308 |
6 |
A Data structures and algorithms as covered in COMP2123 or COMP2823. |
COMP3419 |
6 |
A Programming skills |
COMP3520 |
6 |
P (COMP2017 or COMP2129) and (COMP2123 or COMP2823 or INFO1105 or INFO1905) |
COMP3608 |
6 |
A Data structures and algorithms as covered in COMP2123 or COMP2823. P (INFO1110 or INFO1910 or ENGG1810 or DATA1002 or DATA1902) and distinction-level results in at least one 2000-level COMP or MATH or SOFT unit N COMP3308 COMP3308 and COMP3608 share the same lectures, but have different tutorials and assessment (the same type but more challenging). |
Selective units (minor only) |
||
COMP3027 |
6 |
A Discrete mathematics and probability (e.g. MATH1064 or equivalent) |
COMP3109 |
6 |
|
COMP3927 |
6 |
A Discrete mathematics and probability (e.g. MATH1064 or equivalent) |
COMP3221 |
6 |
P (INFO1105 or INFO1905) or ((INFO1103 or INFO1113) and (COMP2123 or COMP2823)) |
COMP3308 |
6 |
A Data structures and algorithms as covered in COMP2123 or COMP2823. |
COMP3419 |
6 |
A Programming skills |
COMP3520 |
6 |
P (COMP2017 or COMP2129) and (COMP2123 or COMP2823 or INFO1105 or INFO1905) |
COMP3608 |
6 |
A Data structures and algorithms as covered in COMP2123 or COMP2823. P (INFO1110 or INFO1910 or ENGG1810 or DATA1002 or DATA1902) and distinction-level results in at least one 2000-level COMP or MATH or SOFT unit N COMP3308 COMP3308 and COMP3608 share the same lectures, but have different tutorials and assessment (the same type but more challenging). |
