Overview

To view overview information, please select an offering from the drop-down menu above.

Academic contacts

To view unit coordinator information, please select an offering from the drop-down menu above.

Offerings

DUBAI-ISC-TJD-INT-2021-ONGOING
DUBAI-ISC-TMD-INT-2021-ONGOING
DUBAI-ISC-TSD-INT-2021-ONGOING
KAPLAN-SGP-TJA-INT-2018-2020
KAPLAN-SGP-TJA-INT-2021-ONGOING
KAPLAN-SGP-TMA-INT-2018-2020
KAPLAN-SGP-TMA-INT-2021-ONGOING
KAPLAN-SGP-TSA-INT-2018-2020
KAPLAN-SGP-TSA-INT-2021-ONGOING
MURDOCH-S2-EXT-2018-ONGOING
MURDOCH-S2-INT-2018-ONGOING
OUA-OUA1-EXT-2020-ONGOING
OUA-OUA3-EXT-2019-ONGOING

To view more information about assessments, contacts and learning activities specific to one of these offerings, please select an offering from the drop-down menu above.

Other learning activities

To view other learning activity information, please select an offering from the drop-down menu above.

Learning activities

To view learning activity information, please select an offering from the drop-down menu above.

Learning outcomes

1.
Design, implement, test and document solutions to problems using the sequence, selection and iteration constructs of structured programming.
2.
Explain the object-oriented programming paradigm.
3.
Use the object-oriented programming approach to design, implement, test and document solutions to problems.
4.
Demonstrate understanding of the mechanics of parameter passing in the context of object-oriented programming.
5.
Explain how class mechanism supports encapsulation and information hiding.
6.
Design and implement appropriate classes for modelling a given problem.
7.
Explain the need for range checking and error handling and be able to write robust programs that implement these features.
8.
Design, implement and test the implementation of hierarchical relationship among objects using a simple class hierarchy and inheritance.
9.
Explain event-driven programming and be able to describe the behaviour of simple GUI programs.
10.
Write object-oriented programs that use each of the following: arrays, strings, files, lists, stacks and queues.
11.
Explain algorithm complexity and the need for selecting appropriate algorithms and structures for a given problem.
12.
Implement searching and sorting algorithms in a programming language.
13.
Explain the concept of recursion and be able to write recursive solutions for simple to intermediate problems.

Assessments

To view assessment information, please select an offering from the drop-down menu above.

Additional information

Unit content:• Introduction & Program Design • Defining Classes and Methods • Basics of OOP • Programming with Methods • Programming with Classes • Arrays • Inheritance, and introduction to Event-driven programming • Exception Handling • Streams and File I/O • Data Structures • More on Algorithms, introduction to Recursion
Other notes:Each student is expected to spend on average three hours per teaching week reading the lecture notes, books chapters and other recommended materials relevant to the topic covered in that week and spend a similar amount of time working on the lab exercises for that week. In addition, each student is required to complete two assignments and sit the final examination.