Useful links
The growing connected-ness of modern society translates into simplifying global communication and accelerating spread of news, information and epidemics. The focus of this unit is on the key concepts to address the challenges induced by the recent scale shift of complex networks. In particular, the course will present how scalable solutions exploiting graph theory, sociology and probability tackle the problems of communicating (routing, diffusing, aggregating) in dynamic and social networks.
Study level | Undergraduate |
---|---|
Academic unit | Computer Science |
Credit points | 6 |
Prerequisites:
?
|
DATA3888 or COMP3888 or COMP3988 or CSEC3888 or SOFT3888 or ENGG3112 or SCPU3001 |
---|---|
Corequisites:
?
|
None |
Prohibitions:
?
|
COMP5313 |
Assumed knowledge:
?
|
A major in a computer science area. Algorithmic skills gained through units such as COMP2123 or COMP2823 or COMP3027 or COMP3927 or equivalent. Basic probability knowledge |
At the completion of this unit, you should be able to:
This section lists the session, attendance modes and locations the unit is available in. There is a unit outline for each of the unit availabilities, which gives you information about the unit including assessment details and a schedule of weekly activities.
The outline is published 2 weeks before the first day of teaching. You can look at previous outlines for a guide to the details of a unit.
Session | MoA ? | Location | Outline ? |
---|---|---|---|
Semester 1 2024
|
Normal evening | Camperdown/Darlington, Sydney |
View
|
Session | MoA ? | Location | Outline ? |
---|---|---|---|
Semester 1 2025
|
Normal evening | Camperdown/Darlington, Sydney |
Outline unavailable
|
Find your current year census dates
This refers to the Mode of attendance (MoA) for the unit as it appears when you’re selecting your units in Sydney Student. Find more information about modes of attendance on our website.