Existing unit GCO9807 is reintroduced with new unit code FIT9015.

This unit has been updated as part of a 2009 review and comparison of data with current Handbook, Syllabus + and Callista data.

30/11/2017 - Unit disestablished at FEC 5/17 Item 7.3.

This unit provides knowledge and experience in: the application and implementation of common data structures; data representations; the design of application programs; and the design and implementation of new data structures. It also provides opportunity for the study of advanced algorithms.

At the completion of this unit students will have

• the ability to analyse simple algorithms to work out an order of magnitude estimate of running time and space;
• familiarity with some of the most common data structures: stacks, queues, lists, priority queues, tables, sets, collections;
• the ability to implement these data structures using various common data representations: arrays, linked lists, heaps, trees (including balanced trees), hashing;
• the ability to evaluate which implementation would be most appropriate for a given data structure and application;
• the ability to apply the same principles used in implementing the common data structures to implement other data structures;
• the ability to design and implement new data structures;
• an understanding of some more advanced algorithms in areas such as: graph theory (shortest path etc), pattern searching, data compression (precise selection of advanced algorithms will vary from year to year);
• the ability to design new algorithms to solve new problems;
• an enjoyment of programming as an intellectual exercise;
• appreciation of the elegance of certain data structures and algorithms as a form of art;
• an interest in understanding how data structures and algorithms are implemented rather than merely using other peoples implementations (and consequently a preference for open source software).

020111

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

On-campus and Off-Campus Learning(OCL)

Examination (3 hours): 60%; In-semester assessment: 40%

FIT

One of FIT9013, GCO9808, GCO1812, FIT1007 or FIT2034