INFORMATION TECHNOLOGY

PREPARATION GUIDELINES FOR MARCH FORMAL ASSESSMENT

TASKS 2025
ALL GRADES

TABLE OF CONTENTS
GRADE 12 TERM 1 FORMAL ASSESSMENT TASK (PRACTICAL) ............................................................... 2
GRADE 12 TERM 2 FORMAL ASSESSMENT TASK (THEORY) .................................................................... 3
GRADE 11 TERM 1 FORMAL ASESSMENT TASK (PRACTICAL) ................................................................. 5
GRADE 11 TERM 1 FORMAL ASSESSMENT TASK (THEORY) .................................................................... 6
GRADE 10 TERM 1 FORMAL ASSESSMENT TASK (THEORY) .................................................................... 7
GRADE 12 TERM 1 FORMAL ASSESSMENT TASK (PRACTICAL)
PREPARATION GUIDE
Task Description Practical (P1)
Assessment Date - 18 March 2025
Number of Questions Two (2)
Duration and total: 1.5 hours (50 marks)
Preparation Guide
All content regarding OOP concepts will be assessed in the paper. General
programming and problem solving will be needed to answer all the questions.

SECTION A
General programming
- Extract data from components
Question 1 (15 marks) - String handling
General programming - String manipulation
skills - Conditional statements
- Looping
- Display output in components

SECTION B
Concepts about OOP principles tested:
- Constructors
- Mutator methods
Question 2 (35 marks) - Accessor methods
Object Oriented - Auxillary methods
Programming - toString methods
- Instantiate an object
- Method calls

BACK TO TABLE OF CONTENTS

GRADE 12 TERM 1 FORMAL ASSESSMENT TASK (THEORY)
PREPARATION GUIDE
Task Description Theory (P2)
Assessment Date - 11 March 2025
Number of Questions Six (6)
Duration and total: 1.5 hours (60 marks)
Preparation Guide
SECTION A
Question 1 (5 marks) Short questions cover all content
Multiple choice
questions

Question 2 (5 marks) Short questions cover all content

Match column A to B

SECTION B
Hardware & software
- Mobile devices
- Battery power
- Memory and Storage
Question 3 (15 marks)
- Caching
Systems technologies -
- CPU and GPU
Hardware
- Bus performance
- Convergence
- Types of computer users

SECTION C
- Normalisation
- Anomalies
- Primary & foreign keys
- Database tables in a relationship
- SQL injection
- Parallel data sets
- Data integrity
Question 4 (20 marks) - Inputting data in a database
Data and information - Data collection
management - RFID
- Data warehousing
- Data mining
- Data integrity
- Data independence
- Data security
- Data validation
- Data verification
 SECTION D
- UML
- OOP concepts
- Constructor methods
Question 5 (10 marks) - Accessor methods
Solution development - Mutator methods
- Encapsulation
- Procedures and functions

SECTION E
- SQL
Question 6 (5 marks)
- SELECT all or some fields (FROM)
Solution development

BACK TO TABLE OF CONTENTS

GRADE 11 TERM 1 FORMAL ASESSMENT TASK (PRACTICAL)
PREPARATION GUIDE
Task Description Practical (P1)
Assessment Date - 24 March 2025
Number of Questions Two (2)
Duration and total: 1.5 hours (50 marks)
Preparation Guide
All content regarding 1D arrays to be assessed in the paper. General programming
and problem solving will be needed to answer all the questions.

- String manipulation using string methods:

General programming o Inserting and deleting characters
(Question 1) o Determine the position of a character
(15 marks) o Find a character, substring
o Determine the length of a string

- Using arrays as a data structure (1-D)

- Loop through items
- Extracting items using their index in an array
- Replacing items in an array
- Basic mathematical operations, e.g. aggregates
(sum, average, product), minimum, maximum
Arrays (Question 2) - Search using the linear and binary search
(35 marks) algorithm
- Sorting an array (bubble and selection sort)
- Working with parallel arrays
- Formatting output
- Using conditional statements (nested if / case)
- Problem solving

BACK TO TABLE OF CONTENTS

GRADE 11 TERM 1 FORMAL ASSESSMENT TASK (THEORY)
PREPARATION GUIDE
Task Description Theory (P2)
Assessment Date - 4 March 2025
Number of Questions Three (3)
Duration and total: 1 hour (50 marks)
Preparation Guide
SECTION A
Short questions cover all content:
Question 1 (10 marks) - Multiple choice
Short questions - Give ONE word for the following descriptions

SECTION B
Hardware & software
- Motherboard
- ROM
- Firmware
- CPU
- Machine cycle
- GPU
- PCI/PCI-e slot
- Operating systems
- Bus and Point-to-Point connections
Question 2 (30 marks) - Modular design
Systems technologies - IRQ’s
- Connectors / ports
- Caching
- Primary memory and Secondary memory
- Multiprocessing / Multithreading / Multitasking
- Plug and Play
- Machine language
- Compiler vs interpreter
- Compiled languages
- Virtualisation

SECTION C
- Algorithms:
o Search using the linear and binary search
algorithm
Question 3 (10 marks)
o Sorting an array (bubble and selection sort)
Solution development
- Explain the purpose of code
- Create new lines of code

BACK TO TABLE OF CONTENTS

GRADE 10 TERM 1 FORMAL ASSESSMENT TASK (THEORY)
PREPARATION GUIDE
Task Description Theory (P2)
Assessment Date - 11 March 2025
Number of Questions Five (5)
Duration and total: 1 hour (50 marks)
Preparation Guide:
SECTION A
Short questions cover all theory content:
- Match column A to B
Question 1 (10 marks)
- Multiple choice
Short questions
SECTION B
- Identify types of computing devices
- Uses of computing devices, e.g. desktop, laptop
- Advantages and disadvantages of computers
- Differences between data and information
Question 2 (15 marks)
- System software vs application software
Basic concepts of
- Operating systems
computing
- shareware, freeware, free open-source software
(FOSS) and proprietary software
- Data warehousing vs data mining

SECTION C
- Convert a binary number to a decimal number
(showing all the calculations)
- Convert a decimal number to a binary number
(showing all the calculations)
- Convert a decimal number to a hexadecimal
Question 3 (15 marks) number (showing all your calculations)
Data Representation and - Reasons why computers store data
File Management - Structures used to store data
(Storage) - File specifications (example of a file path)
- Explain compressed files, database files, text files
and source code (including applications and
extensions)
- Data warehouses
 SECTION D
- Algorithms (Flowcharts)
o Know the basic flowchart elements, functions
and shapes, symbols, e.g. oval, rectangle,
Question 4 (5 marks) arrows, etc.
Algorithms o Know the formulas to find the Area of a circle
and Area of a rectangle, etc.
o Flowcharts with YES and NO options

SECTION E
- Delphi programming
o Debug code
Question 5 (5 marks) o Identify syntax errors
Algorithms o Correct syntax errors by rewriting lines of
code

BACK TO TABLE OF CONTENTS