menu

CECS Professional Skills Mapping

COMP3600 — Algorithms

code: COMP3600
name: Algorithms
unit value: 6
description: Algorithms is the foundation of Computer Science. It enables advances in Artificial Intelligence, Machine Learning, Cyber Security, Distributed, Mobile, and Cloud Computing, Computer Graphics and Animation, and many more. These advances have made Computer Science an indispensable part of our everyday life.

In this course, we will study the basics of Algorithms Design and Analysis. We will focus on two fundamental problems in computing: Sorting and Searching. We will cover various data structures and algorithm design techniques for solving these two classes of problems, as well as performance measures and analysis techniques of these algorithms and data structures.

Topics covered in this class include:
*/ The Problem: Search and Sort
*/ Analysis Framework:
**/ Model of Computation
**/ Asymptotic Analysis
**/ Recurrence Analysis
**/ Basic analysis of Randomized Algorithms
**/ Empirical Analysis
*/ Algorithm Design Techniques:
**/ Brute Force
**/ Divide & Conquer
**/ Decrease & Conquer
**/ Transform & Conquer
**/ Dynamic Programming
**/ Greedy
**/ Iterative Improvement
P&C: https://programsandcourses.anu.edu.au/course/COMP3600
course learning outcomes:
  1. Students who successfully complete this subject will be able to comprehend, describe, discuss, adistinguish, and interpret various asymptotic analysis of time and space complexities of algorithms, such as big Oh, little oh, big Omega, small omega, and Theta (DL1)
  2. Students who successfully complete this subject will be able to comprehend, discuss, explain a variety of algorithms and data structures (DL1)
  3. Students who successfully complete this subject will be able to determine and apply the most effective variety of algorithms and data structures for solving computational problems (DL2)
  4. Students who successfully complete this subject will be able to analyze the time and space complexities of various types of algorithms, including recursion, dynamic programming, and simple randomized algorithms (DL2)
  5. Students who successfully complete this subject will be able to integrate a variety of algorithms to design and propose efficient solution to a simplified version of real-life problems, and justify the efficiency of his/her solution (DL3)
assessment:
  1. Assignment 1 (20%)
  2. Assignment 2 (20%)
  3. Assignment 3 (20%)
  4. Final Exam (40%)

Mapped learning outcomes

learning outcome1. KNOWLEDGE AND SKILL BASE2. ENGINEERING APPLICATION ABILITY3. PROFESSIONAL AND PERSONAL ATTRIBUTESassessment tasks
1.11.21.31.41.51.62.12.22.32.43.13.23.33.43.53.61234
  1. Students who successfully complete this subject will be able to comprehend, describe, discuss, adistinguish, and interpret various asymptotic analysis of time and space complexities of algorithms, such as big Oh, little oh, big Omega, small omega, and Theta (DL1)
✓✓✓✓✓✓✓✓
  1. Students who successfully complete this subject will be able to comprehend, discuss, explain a variety of algorithms and data structures (DL1)
✓✓✓✓✓✓✓✓✓
  1. Students who successfully complete this subject will be able to determine and apply the most effective variety of algorithms and data structures for solving computational problems (DL2)
✓✓✓✓✓✓✓✓✓✓✓
  1. Students who successfully complete this subject will be able to analyze the time and space complexities of various types of algorithms, including recursion, dynamic programming, and simple randomized algorithms (DL2)
✓✓✓✓✓✓✓✓✓✓✓✓✓✓
  1. Students who successfully complete this subject will be able to integrate a variety of algorithms to design and propose efficient solution to a simplified version of real-life problems, and justify the efficiency of his/her solution (DL3)
✓✓✓✓✓✓✓✓✓✓✓✓✓✓✓✓✓

Course contribution towards the Engineers Australia Stage 1 Competency Standard

This table depicts the relative contribution of this course towards the Engineers Australia Stage 1 Competency Standard. Note that this illustration is indicative only, and may not take into account any recent changes to the course. You are advised to review the official course page on P&C for current information..

1. KNOWLEDGE AND SKILL BASE
1.1
 
1.2
 
1.3
 
1.4
 
1.5
 
1.6
 
2. ENGINEERING APPLICATION ABILITY
2.1
 
2.2
 
2.3
 
2.4
3. PROFESSIONAL AND PERSONAL ATTRIBUTES
3.1
3.2
 
3.3
 
3.4
 
3.5
 
3.6

Engineers Australia Stage 1 Competency Standard — summary

1. KNOWLEDGE AND SKILL BASE
✓1.1Comprehensive, theory based understanding of the underpinning natural and physical sciences and the engineering fundamentals applicable to the engineering discipline.
✓1.2Conceptual understanding of the, mathematics, numerical analysis, statistics, and computer and information sciences which underpin the engineering discipline.
✓1.3In depth understanding of specialist bodies of knowledge within the engineering discipline.
✓1.4Discernment of knowledge development and research directions within the engineering discipline.
✓1.5Knowledge of contextual factors impacting the engineering discipline.
✓1.6Understanding of the scope, principles, norms, accountabilities and bounds of contemporary engineering practice in the engineering discipline.
2. ENGINEERING APPLICATION ABILITY
✓2.1Application of established engineering methods to complex engineering problem solving.
✓2.2Fluent application of engineering techniques, tools and resources.
✓2.3Application of systematic engineering synthesis and design processes.
2.4Application of systematic approaches to the conduct and management of engineering projects.
3. PROFESSIONAL AND PERSONAL ATTRIBUTES
3.1Ethical conduct and professional accountability.
✓3.2Effective oral and written communication in professional and lay domains.
✓3.3Creative, innovative and pro-active demeanour.
✓3.4Professional use and management of information.
✓3.5Orderly management of self, and professional conduct.
3.6Effective team membership and team leadership.

Updated:  18 February 2021/ Responsible Officer:  Dean, CECS/ Page Contact:  CECS Academic Education Services