Corresponds to previous unit CSE4603 - Advanced topics in algorithms and complexity in previous BCS (Hons) course code 4608.

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

June 2016: Additional algorithm types added to the list of topics that may be covered in this subject. This allows greater flexibility in presenting algorithms of current interest.

12/06/2017: Admin - updating location of offering to reflect actual campus offerings at the ADE's request.

05/10/2018: Update to prerequisites to allow Software engineering students to enrol as an approved elective. Effective 2019.

19/11/2020: Admin - this unit was disestablished at FEC 5/20 on 12/11/2020 as it is no longer required.

This is a fourth level unit for one of three elective coursework units in the Bachelor of Computer Science (BCompSci) (Hons).

On successful completion of this unit, you should be able to:

• critically analyse and assess algorithms for use in the chosen specialisation area;
• be able to formally analyse algorithms in this specialisation area;
• choose and apply algorithms and data structures in the specialisation area;
• design and implement modified algorithms in the chosen area to suit particular problem structures.

020109

Algorithms are the most fundamental area for all aspects of computer science and software engineering. Discrete structures, such as those treated in graph theory, set theory, combinatorics and symbolic logic form the mathematical underpinning of the study of algorithms. As well-designed algorithms and data structures are essential for the good performance of an information system, an in-depth understanding of the theoretical properties of algorithms is essential for any computer scientist. As importantly, the theoretical investigation of algorithms leads to a deeper understanding of problem structures and classes of problems and the knowledge of a large variety of algorithm types enables the designer to approach a new problem from different angles. Topics for this unit may include: Computability and Complexity, Automata Theory, Advanced Analysis and Design of Algorithms, Parallel and Distributed Algorithms, Numerical Algorithms, Cryptographic Algorithms, Spatial/geometric Algorithms, Approximation Algorithms and Randomised Algorithms.

Assignment and Examination, relative weight depending on topic composition. When no exam is given students will be expected to demonstrate their knowledge by solving practical problems and maybe required to give an oral report. This variability is designed to give flexibility to the lecturer to decided the most appropriate form of examination for a given choice of topics.

Minimum total expected workload equals 12 hours per week comprising:

(a.) Contact hours for on-campus students:

(b.) Additional requirements (all students):

FIT

Completion of the Bachelor of Computer Science or equivalent to the entry requirements for the Honours program. Students must also have enrolment approval from the Honours Coordinator.

For students enrolled in E3001, E3002, E3005, E3010, E3011, E3007 completing the Software Engineering specialisation: completion of 144 credit points of study in the Bachelor of Software Engineering (Honours) degree.