Overview

This unit introduces students to problem solving concepts and techniques fundamental to the science of programming. In doing this it covers problem specification, algorithmic design, analysis and implementation. Detailed topics include analysis of best, average and worst-case time and space complexity; introduction to numerical algorithms; recursion; advanced data structures such … For more content click the Read More button below.

Offerings

S1-01-CLAYTON-FLEXIBLE
S1-01-MALAYSIA-ON-CAMPUS
S2-01-CLAYTON-FLEXIBLE
S2-01-MALAYSIA-ON-CAMPUS

Contacts

Chief Examiner(s)

Dr Rafael Dowsley
Dr Lei Yang

Unit Coordinator(s)

Dr Lim Wern Han

Teaching approach

Active learning

Assessment summary

This unit has threshold mark hurdles. You must achieve at least 45% of the available marks in the final scheduled assessment, at least 45% in total for in-semester assessments, and an overall unit mark of 50% or more to be able to pass the unit. If you do not achieve the threshold mark, you will receive a fail grade (NH) and a maximum mark of 45 for the unit.

Assessment

1 - Quiz
2 - Assignment 1
3 - Assignment 2
4 - Scheduled final assessment (2 hours and 10 minutes)
5 - Quizzes
6 - Assignment 1
7 - Assignment 2
8 - Scheduled final assessment (2 hours and 10 minutes)

Scheduled and non-scheduled teaching activities

Applied sessions
Seminars

Workload requirements

Workload

Learning resources

Recommended resources
Technology resources

Availability in areas of study

Computer science
Computational science