Algorithms & Data Structures

Programme Overview

You will learn how to analyse and design computer algorithms and data structures. The focus will be on methods for evaluating algorithm efficiency and implementation of various data objects, programming styles, and performance expectations. Course topics will include key areas required to understand algorithmic design patterns, such as data concepts, arrays, stacks, queues, trees, and graphs. You will apply these concepts to create effective programs and solve problems in coding design. In addition, you will learn the importance of enhancing the performance of a program to ensure it is optimised and reusable for overall growth.

Learning Outcomes

1. Describe the characteristics and functionality of the fundamental basic algorithmic principles and data structure core concepts, including arrays, binary search trees, linked lists, hash tables, stacks, and queuesEvaluate critical methods and approaches of strategies to determine solutions to programming challenges involved in implementing different types of data structure designs to solve a problem to result in the desired outcome.
2. Analyse simple and complex programming designs to understand how decisions can impact the performance, growth, and optimisation of a software solution in both short-term and long-term usability goals. Implement simple proofs of concepts of a program design by using software development tools to write and troubleshoot programs.
3. Create technical design documentation for options based on specific use cases scenarios and solutions recommended.