Skip to Content

Future Students - Courses

click here for a printable version of this page  

Algorithmic Problem Solving

Unit Code: HIT1301




Duration

Contact Hours

Campus

Prerequisite

Corequisite

1 Semester

48 Hours

Hawthorn

Nil
 
Preclusions: HIT2080 Introduction to Programming and HIT1404 Introduction to Programming in .NET. Students may undertake only one introductory programming unit.

Nil

Credit Points: 12.5 Credit Points


Related Course/s:

A unit of study in the Bachelor of Computing, Bachelor of Science (Professional Software Development)), Bachelor of Science (Information Technology) and Bachelor of Information Technology

Aims & Objectives:

On completion of this unit of study students will be able to:

  • Explain the the structured programming principles and how they relate to program construction and programming language features.
  • Describe the elements that make up the semantics and syntax of an imperative programming language.
  • Read code, describe its purpose, and locate errors in syntax and/or logic and control flow.
  • Design, develop, test and debug small programs using the structured programming principles.
  • Describe and explain factors that contribute to good quality code and program structure, and demonstrate their use in programs they have written.

Teaching Methods:

Lectures (2 hrs per week), Laboratory (2 hr per week), Lab tests (3 sessions of 2hrs)

Assessment:

Assignments, Tests, Portfolio and Presentation (100%).

Generic Skills Outcomes:

You will be provided with feedback on your progress in attaining the following generic skills:

  • Are capable in their chosen professional areas
  • Are adaptable and manage change
  • Operate effectively in work and community situations
  • Are aware of environments

Content:

  • Working with Computers: Binary, memory, variables, and data types. Giving the computer instructions using statements, expressions, and conditions. Control flow using branches and loops.
  • Programming language syntax: Data, and types of data. Statements, Conditions, and Expressions. Implementing functions and procedures. Working with multiple data elements. Representing composite date.
  • Solving problems programmatically: Understanding the problem. Planning a solution using text and diagrams. Problem decomposition. Testing and evaluating a solution.

Reading Materials:

Sally Fincher, Studying Programming, Palgrave MacMillan, 2006