Undergraduate - UnitFIT2009 - Data structures and 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;
• 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;
• an 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.