Programming Techniques

Unit Outline (Higher Education)

   
?   Display Outline Guidelines      


Effective Term: 2025/05
Institute / School :Institute of Innovation, Science & Sustainability
Unit Title: Programming Techniques
Unit ID: ITWSU2015
Credit Points: 15.00
Prerequisite(s): (ITECH1400)
Co-requisite(s): Nil
Exclusion(s): Nil
ASCED: 029999
Other Change:  
Brief description of the Unit

This subject is intended as a second subject of study in programming. It builds on a basic understanding of procedural programming as would be developed in a first subject. This subject continues the development of programming skills and methodologies required for professional programming and for further study in later computing subjects. Topics covered include multi-dimensional arrays, file I/O, searching and sorting, and an introduction to object-oriented programming involving classes and inheritance.

Grade Scheme: Graded (HD, D, C, P, MF, F, XF)
Work Experience Indicator:
No work experience
Placement Component:
Supplementary Assessment:Yes
Where supplementary assessment is available a student must have failed overall in the Unit but gained a final mark of 45 per cent or above, has completed all major assessment tasks (including all sub-components where a task has multiple parts) as specified in the Unit Description and is not eligible for any other form of supplementary assessment
Course Level:
Level of Unit in CourseAQF Level(s) of Course
5678910
Introductory                                                
Intermediate                                        
Advanced                                                
Learning Outcomes:
Knowledge:
K1.

With a chosen programming language in mind, analyse a given problem and:

a)  Develop an algorithm that applies structured programming techniques such as sequence, selection, iteration and modularisation that solve the given problem;

b)  Choose suitable data typee to store relevant data for the given problem.

c)  Implement the solution algorithm using the chosen programming language, data types and control structures.

d)  Test and debug the program code to produce a working computer program.

Skills:
S1.

Write and implement programs that use data structures such as arrays to solve problems in programming involving multiple data items.

S2.

Demonstrate how different searching and sorting methods operate and be able to implement them in working computer programs 

Application of knowledge and skills:
A1.

Store, retrieve and manipulate data programmatically from secondary storage 

A2.

Use object-oriented methodology to analyse relatively simple problems and develop object-oriented computer program solutions

Unit Content:

·Revision and extension of procedural programming structures including:

o   Data types

o   I/O statements

o   Calculations

o   Problem solving techniques

o   decision making constructs

o   repetition structures

o   writing and using functions

· one-dimensional arrays

· Multi-dimensional arrays

· Character strings and textual data

· Sorting and searching algorithms: Sequential Search, Binary Search, Selection Sort, Bubble Sort

. Object-Oriented Programming including:

o   Introduction to classes and objects

o   Class construction

o   Constructors and destructors

o   Inheritance

o   Polymorphism

. Data files

Graduate Attributes:
 Learning Outcomes AssessedAssessment TasksAssessment TypeWeighting
1.K1, S1, A1

2 x Practical Deliverables. 

Practical Exercises

30%

2.K1, S1, S2, A1, A2

Programming Project

Applied Project

40%

3.K1, S1, S2, A1, A2

Practical Programming Test

Programming Task

30%

Adopted Reference Style:
APA  ()

Professional Standards / Competencies:
 Standard / Competency