Bachelor of Advanced Computer Science (Honours) in Algorithms and Computing

Griffith University - Gold Coast Campus

Australia,Queensland

 0 Shortlist

48 Months

Duration

CAD 38,000/year

Tuition Fee

CAD 50

Application Fee

Jul 2025

Apply Date

Australia, Queensland

Type: University

Location Type: Semi-Urban

Founded: 1971

Total Students: 50,000 +

Int. Students: 8,500 +

Campus Detail

Main Campus Address

1 Parklands Dr, Southport QLD 4215, Australia

Bachelor of Advanced Computer Science (Honours) in Algorithms and Computing

Program Overview

Computer Science is a dynamic and developing field that is increasingly pervading every aspect of society. In this program you will learn the fundamental principles underpinning computer science and learn practical software technology development skills for many different platforms and applications.

You will have the choice of studying topics such as Programming Languages, Distributed Computing, Computer Architectures, Algorithms and Operating Systems, Machine Learning, Intelligent Systems, Robotics, Programming for Web, Mobile and Embedded Applications, Scientific Computing, Visualisation and Big Data Mining, and Analytics. You can choose between one of two majors and also select from a range of elective courses. In the last year of your studies, you will complete a practical project for industry or research placement providing first-hand experience of the knowledge, skills and attributes required to succeed in full-time employment.

 

Major: Algorithms and Computing

The real-world performance of any software system depends on the algorithms used and the efficiency of their implementation. The ability to select algorithms appropriate to solving particular problems, based on understanding the range of algorithms that address well-defined problems, analyzing their complexity and performance, and their suitability in particular contexts and implementing them is critical for building effective software. A number of general algorithmic strategies are presented including brute force, heuristics, greedy, recursive backtracking and divide and conquer. Common algorithms pertaining to searching, sorting, binary trees, graphs, and string / expression parsing are also discussed. Also both in-memory and file data structures and their interrelationship with specific algorithms are reviewed.