Note: More information will become available after 2020-12-31

COMP2823: Data Structures & Algorithms (Adv) (2020 - Semester 1)

Unit: COMP2823: Data Structures & Algorithms (Adv) (6 CP)
Mode: Normal-Day
On Offer: Yes
Level: Intermediate
Faculty/School: School of Computer Science
Unit Coordinator/s: Dr Mestre, Julian
Session options: Semester 1
Versions for this Unit:
Site(s) for this Unit:
Campus: Camperdown/Darlington
Pre-Requisites: INFO1110 OR INFO1910 OR INFO1113 OR DATA1002 OR DATA1902 OR INFO1103 OR INFO1903. Distinction-level result in at least one the above 1000 level programming units
Prohibitions: INFO1105 OR INFO1905 OR COMP2123.
Brief Handbook Description: This unit will teach some powerful ideas that are central to solving algorithmic problems in ways that are more efficient than naïve approaches. In particular, students will learn how data collections can support efficient access, for example, how a dictionary or map can allow key-based lookup that does not slow down linearly as the collection grows in size. The data structures covered in this unit include lists, stacks, queues, priority queues, search trees, hash tables, and graphs. Students will also learn efficient techniques for classic tasks such as sorting a collection. The concept of asymptotic notation will be introduced, and used to describe the costs of various data access operations and algorithms.
Assumed Knowledge: None.