Skip to main content
Start of main content.

ENAI71-102: Algorithms and Data Structures with AI-Assisted Implementation

Description

This subject introduces students to the core principles of algorithms and data structures, equipping them with the skills to design efficient solutions to computational problems. The subject covers fundamental data structures such as arrays, stacks, queues, trees, and graphs. It also covers classic algorithms for sorting and searching, and their time and space complexity are discussed. Key algorithmic paradigms, including divide and conquer, greedy methods, and dynamic programming, are introduced. AI tools are integrated in the learning, supporting the development process and code generation, debugging, and optimisation of code. Through hands-on programming and reflective practice, students will gain technical proficiency and an understanding of how AI can enhance coding practice.

Subject details

Type: Postgraduate Subject
Code: ENAI71-102
Faculty: Bond Business School
Credit: 10
Study areas:
  • Business, Commerce, and Entrepreneurship

Learning outcomes

  1. Describe, apply and evaluate fundamental data structures such as arrays, stacks, queues, trees, and graphs to solve computational problems.
  2. Critically assess the time and space complexity of algorithms using Big-O notation to evaluate their efficiency and justify design decisions for efficiency.
  3. Implement advanced sorting and searching algorithms using a real programming language and optimise for performance.
  4. Formulate and apply algorithm design paradigms such as divide and conquer, greedy algorithms, and dynamic programming to develop new programming solutions.
  5. Integrate and critique the use of AI tools to assist in the design, implementation, and refinement of algorithms, while evaluating their limitations and appropriate use in programming tasks.

Enrolment requirements

Requisites:

Nil

Assumed knowledge:

Assumed knowledge is the minimum level of knowledge of a subject area that students are assumed to have acquired through previous study. It is the responsibility of students to ensure they meet the assumed knowledge expectations of the subject. Students who do not possess this prior knowledge are strongly recommended against enrolling and do so at their own risk. No concessions will be made for students’ lack of prior knowledge.

Assumed Prior Learning (or equivalent):

Restrictions:

Nil