FIT2009 Data Structures and Algorithms

Algorithm analysis. Application and implementation of some common data structures: stacks, queues, lists, priority queues, tables, sets and collections. Data representations including: arrays, linked lists, heaps, trees (including balanced trees) and hashing. Design of application programs making use of common data structures. Design and implementation of new data structures. Study of advanced algorithms in areas such as: graph theory, pattern searching and data compression. Access to the University's computer systems through an Internet service provider is compulsory for off-campus students

Teaching

• two hours of lectures per week
• two hours of tutorials per week

Assessment

• Programming assignments: 40%
• Final examination (three hours) worth 60%

Prerequisites

Prerequisites

FIT2034

Corequisites

None

Prohibitions

None