Year 1

Semester 1

Week 1

• 1.2.1 Define the terms: hardware, software, peripheral, network, human resources.
• 4.3.1 State the fundamental operations of a computer.

Week 2

• 2.1.1 Outline the architecture of the central processing unit (CPU) and the functions of
the arithmetic logic unit (ALU) and the control unit (CU) and the registers within the
CPU.

Week 3

• 2.1.2 Describe primary memory.

• 2.1.3 Explain the use of cache memory.
• 4.3.2 Distinguish between fundamental and compound operations of a computer.

Week 4

• 2.1.4 Explain the machine instruction cycle.

• 4.3.3 Explain the essential features of a computer language.

Week 5

• 4.3.4 Explain the need for higher-level languages.

• 4.3.5 Outline the need for a translation process from a higher-level language to machine
executable code.

Week 6

• 4.3.6 Define the terms: variable, constant, operator, object.

• 4.3.7 Define the operators =, ≠, <=, >, >=, mod, div.

Week 7

• 4.3.8 Analyze the use of variables, constants, and operators in algorithms.

• 4.3.9 Construct algorithms using loops, branching.

Week 8
 • D.1.1 Outline the general nature of an object.
• D.1.2 Distinguish between an object (definition, template or class) and instantiation.

Week 9

• D.1.3 Construct unified modelling language (UML) diagrams to represent object designs.
• D.1.4 Interpret UML diagrams.

Week 10

• D.1.5 Describe the process of decomposition into several related objects.

• D.1.6 Describe the relationships between objects for a given problem.

Week 11

• D.1.7 Outline the need to reduce dependencies between objects in a given problem.
• D.1.8 Construct related objects for a given problem.

Week 12

• D.1.9 Explain the need for different data types to represent data items.
• D.1.10 Describe how data items can be passed to and from actions as parameters.

Week 13

• D.3.1 Define the terms: class, identifier, primitive, instance variable, parameter variable,
local variable.
• D.3.2 Define the terms: method, accessor, mutator, constructor, signature, return value.
• D.3.3 Define the terms: private, protected, public, extends, static.

Week 14

• D.3.4 Describe the uses of the primitive data types and the reference class string.
• D.3.5 Construct code to implement assessment statements D.3.1–D.3.4.

Week 15

• 4.1.1 Identify the procedure appropriate to solving a problem.

• 4.1.2 Evaluate whether the order in which activities are undertaken will result in the
required outcome.
• 4.1.3 Explain the role of sub-procedures in solving a problem.
• 4.1.17 Identify examples of abstraction.
• 4.1.18 Explain why abstraction is required in the derivation of computational solutions
for a specified situation.
Week 16

• 4.1.19 Construct an abstraction from a specified situation.

• 4.1.20 Distinguish between a real-world entity and its abstraction.
• 4.2.1 Describe the characteristics of standard algorithms on linear arrays.
• 4.2.2 Outline the standard operations of collections.
• 4.2.3 Discuss an algorithm to solve a specific problem.
• 4.2.4 Analyze an algorithm presented as a flow chart.
• 4.2.5 Analyze an algorithm presented as pseudocode.

Year 1
Semester 2

Week 1

• 1.2.4 Identify the relevant stakeholders when planning a new system.

• 1.2.5 Describe methods of obtaining requirements from stakeholders.
• 1.2.6 Describe appropriate techniques for gathering the information needed to arrive at a
workable solution.
• 1.2.7 Construct suitable representations to illustrate system requirements.

Week 2

• 1.2.8 Describe the purpose of prototypes to demonstrate the proposed system to the
client.
• 1.2.9 Discuss the importance of iteration during the design process.
• 1.2.10 Explain the possible consequences of failing to involve the end-user in the design
process.
• 1.2.11 Discuss the social and ethical issues associated with the introduction of new IT
systems.

Week 3

• 1.1.1 Identify the context for which a new system is planned.

• 1.1.2 Describe the need for change management.
• 1.1.3 Outline compatibility issues resulting from situations including legacy systems or
business mergers.
• 1.1.4 Compare the implementation of systems using a client’s hardware with hosting
systems remotely.

Week 4
 • 1.1.5 Evaluate alternative installation processes.
• 1.1.6 Discuss problems that may arise as a part of data migration.
• 1.1.7 Suggest various types of testing.
• 1.1.8 Describe the importance of user documentation.

Week 5

• 1.1.9 Evaluate different methods of providing user documentation.

• 1.1.10 Evaluate different methods of delivering user training.
• 2.1.6 Describe the main functions of an operating system.
• 2.1.7 Outline the use of a range of application software.

Week 6

• 2.1.8 Identify common features of applications.

• 2.1.9 Define the terms: bit, byte, binary, denary/decimal, hexadecimal.
• 2.1.10 Outline the way in which data is represented in the computer.
• 2.1.11 Define the Boolean operators: AND, OR, NOT, NAND, NOR, and XOR.

Week 7

• 2.1.12 Construct truth tables using the above operators.

• 2.1.13 Construct a logic diagram using AND, OR, NOT, NAND, NOR, and XOR gates.
• 4.3.10 Describe the characteristics and applications of a collection.
• 4.3.11 Construct algorithms using the access methods of a collection.

Week 8

• 4.3.12 Discuss the need for sub-programs and collections within programmed solutions.
• 4.3.13 Construct algorithms using predefined sub-programs, one-dimensional arrays,
and/or collections.
• D.2.1 Define the term encapsulation.
• D.2.2 Define the term inheritance.

Week 9

• D.2.3 Define the term polymorphism.

• D.2.4 Explain the advantages of encapsulation.
• D.2.5 Explain the advantages of inheritance.
• D.2.6 Explain the advantages of polymorphism.

Week 10

• D.3.6 Construct code examples related to selection statements.

• D.3.7 Construct code examples related to repetition statements.
• D.3.8 Construct code examples related to static arrays.
 • 4.1.4 Identify when decision-making is required in a specified situation.

Week 11

• 4.1.5 Identify the decisions required for the solution to a specified problem.
• 4.1.6 Identify the condition associated with a given decision in a specified problem.
• 4.1.7 Explain the relationship between the decisions and conditions of a system.
• 4.1.8 Deduce logical rules for real-world situations.

Week 12

• 4.1.9 Identify the inputs and outputs required in a solution.

• 4.1.10 Identify pre-planning in a suggested problem and solution.
• 4.1.11 Explain the need for pre-conditions when executing an algorithm.
• 4.1.12 Outline the pre- and post-conditions to a specified problem.

Week 13

• 4.1.13 Identify exceptions that need to be considered in a specified problem solution.

• 4.1.14 Identify the parts of a solution that could be implemented concurrently.
• 4.1.15 Describe how concurrent processing can be used to solve a problem.
• 4.1.16 Evaluate the decision to use concurrent processing in solving a problem.

Week 14

• 4.2.6 Construct pseudocode to represent an algorithm.

• 4.2.7 Suggest suitable algorithms to solve a specific problem.
• 4.2.8 Deduce the efficiency of an algorithm in the context of its use.
• 4.2.9 Determine the number of times a step in an algorithm will be performed for given
input data.

Week 15

• 4.3.10 Describe the characteristics and applications of a collection.

• 4.3.11 Construct algorithms using the access methods of a collection.
• 4.3.12 Discuss the need for sub-programmes and collections within programmed
solutions.
• 4.3.13 Construct algorithms using predefined sub-programmes, one-dimensional arrays
and/or collections.

Week 16

• Commencement of internal assessment.

• Commencement of group 4 project.
Year 2
Semester 1

Week 1

• 1.1.11 Identify a range of causes of data loss.

• 1.1.12 Outline the consequences of data loss in a specified situation.

Week 2

• 1.1.13 Describe a range of methods that can be used to prevent data loss.
• 1.1.14 Describe strategies for managing releases and updates.

Week 3

• 1.2.2 Describe the roles that a computer can take in a networked world.
• 1.2.3 Discuss the social and ethical issues associated with a networked world.

Week 4

• 1.2.12 Define the term usability.

• 1.2.13 Identify a range of usability problems with commonly used digital devices.

Week 5

• 1.2.14 Identify methods that can be used to improve the accessibility of systems.
• 1.2.15 Identify a range of usability problems that can occur in a system.

Week 6

• 1.2.16 Discuss the moral, ethical, social, economic, and environmental implications of
the interaction between humans and machines.

Week 7

• D.3.9 Discuss the features of modern programming languages that enable

internationalization.
• D.3.10 Discuss the ethical and moral obligations of programmers.

Week 8
 • Revision and catch-up week (if needed).

Week 9

• Additional time for project completion or review.

Week 10

• Additional time for project completion or review.

Week 11

• Additional time for project completion or review.

Week 12

• Completion of internal assessment.

Week 13

• Completion of group 4 project.

Week 14

• Assessment preparation and review.

Week 15

• Final assessment completion and submission.

Week 16

• Reflection and wrap-up of the course.

Year 2
Semester 2

Week 1

• 3.1.1 Identify different types of networks.

• 3.1.2 Outline the importance of standards in the construction of networks.

Week 2
 • 3.1.3 Describe how communication over networks is broken down into different layers.
• Introduction to network architecture and OSI model.
• 3.1.4 Identify the technologies required to provide a VPN.
• 3.1.5 Evaluate the use of a VPN.

Week 3

• 3.1.6 Define the terms: protocol, data packet.

• 3.1.7 Explain why protocols are necessary.

Week 4

• 3.1.8 Explain why the speed of data transmission across a network can vary.
• 3.1.9 Explain why compression of data is often necessary when transmitting across a
network.

Week 5

• 3.1.10 Outline the characteristics of different transmission media.

• 3.1.11 Explain how data is transmitted by packet switching.

Week 6

• 3.1.12 Outline the advantages and disadvantages of wireless networks.

• 3.1.13 Describe the hardware and software components of a wireless network.

Week 7

• 3.1.14 Describe the characteristics of wireless networks.

• 3.1.15 Describe the different methods of network security.

Week 8

• 3.1.16 Evaluate the advantages and disadvantages of each method of network security.

Week 9

• D.2.7 Describe the advantages of libraries of objects.

• D.2.8 Describe the disadvantages of OOP.

Week 10

• D.2.9 Discuss the use of programming teams.

• D.2.10 Explain the advantages of modularity in program development.
• Submission of internal assessment.