Design and Analysis of Algorithms
COMP3001
Option

Year 3, Sem 1 Option Elective Enabling Knowledge and Skills Practical and ‘Hands-on’ Experience Integrated Engagement with Professional Practice

Back
Code COMP3001
Credits 25
Graduate Attributes

Introduction

Welcome to the Design and Analysis of Algorithms!

New exciting computer applications have been developed to meet rapidly increasing user demand for computing technologies. Good algorithms are needed to produce effective and efficient applications, and therefore computing students must have sufficient knowledge of standard algorithm design techniques and analysis. In this unit, students will learn and use several standard algorithm design techniques to solve basic problems, such as sorting problem. Effective algorithm design techniques such as divide and conquer, greedy and dynamic programming will be covered in the unit. The students will also learn how to use the growth of functions concept to analyse algorithm's resource requirement.

This unit, in line with current research and university values, strives to achieve a positive and inclusive educational environment. This supports improved academic performance, increased confidence and creates a greater sense of safety and belonging. Your teaching team is committed to providing a safe and inclusive learning experience and requires students to take reasonable and appropriate measures to actively eliminate discrimination on the basis of ability; cultural and social background; and diverse sex, sexuality, and gender.
Lecture 1 x 2 Hours Weekly 
Tutorial 1 x 2 Hours Weekly 

Unit Learning Outcomes

  • 1 use industry standard techniques, such as asymptomatic upper bound, lower bound and tight bound, to analyse algorithm's time complexity, GC1, GC3
  • 2 identify and apply efficient algorithms to solve a range of computing problems, GC1, GC2, GC3, GC6
  • 3 understand and implement industry standard techniques, such as greedy, divide and conquer and dynamic programming, to develop algorithms, GC1, GC3, GC6
  • 4 develop, present and analyse efficient algorithms using standard-techniques to solve real-world computing problems, GC1, GC2, GC3, GC6

Course Learning Outcomes

  • 1 Apply the theory of computer systems networking within the engineering design method, whilst remaining cognisant of network operational issues
  • 2 Define a problem and apply creative thinking to the formulation of a solution; verify and implement the solution

Assessment Breakdown

Recent Unit Changes & Response to Student Feedback

Students are encouraged to provide feedback through student surveys (such as Insight and the annual Student Experience Survey) and interactions with teaching staff.

Listed below are some recent changes to the unit as a result of student feedback.

Some revisions in the lecture slides and tutorial worksheets.