Sparklabs Learning / Digital Technology
JSS 3 Second Term
Week 3: BASIC One-Dimensional Arrays: Concepts
- School
- Creative Brains Academy
- Subject
- Digital Technology
- Pack
- Curriculum only
- Prepared
- 7 November 2026
Week index
- 01Revision of First-Term Work
- 02Graphics: CorelDRAW Practical
- 03BASIC One-Dimensional Arrays: Concepts
- 04BASIC One-Dimensional Arrays: Practical
- 05High-Level Languages: Review
- 06Data Representation and Number Bases: Review
- 07Security and Ethics
- 08Intensive Revision and Mock Preparation
- 09Mock Examination
Week 3 / Second Term
BASIC One-Dimensional Arrays: Concepts
Curriculum outline
Lesson objectives
By the end of the week, learners should be able to:
- Define a one-dimensional array and state its indexing rule.
- Name three use cases for arrays such as storing scores.
- Declare an array of ten elements and index correctly.
- Explain why arrays help organise repeated data.
- Trace an indexed access returning the correct value.
Key vocabulary
- Array: a sequence stored in consecutive memory slots.
- One-dimensional array: an array storing values along one axis.
- Index: the position number of an element in the array.
- Indexing rule: the convention assigning position numbers to elements.
- Repeated data: values occurring multiple times in a task.
- Consecutive slots: memory positions stored contiguously.
- Declaration: stating the size and type of an array explicitly.
- Access: retrieving a stored element by its index.
Common misconceptions
- "Arrays store text separately." Arrays store homogeneous values; text often sits in a string type separately.
- "Index starts at one always." Zero-based indexing is common but some languages start elsewhere.
- "An array stores unrelated rows." Related rows belong together because of shared field types.
Teacher activities
- Starter: show ten number cards and ask where they would store them.
- Define an array and explain indexing by showing a zero-based declaration.
- Name three use cases such as storing exam scores or inventory.
- Demonstrate declaring an array of ten elements step by step.
- Explain why arrays help organise repeated data efficiently.
- Close with the index-access task and exit question.
Student activities
- Answer the starter and identify the array as the right storage.
- Define an array in their own words and name the indexing convention.
- Name three use cases for arrays in their own words.
- Declare an array of ten elements and index correctly.
- Trace an indexed access and write the returned value.
- Answer the exit question comparing arrays with separate variables in one sentence.
Practical / learning evidence
A declared array worksheet with indexing exercises, a three-use-case chart and an index-access trace. Submit all three for marking.
Resources and preparation
Computers with the interpreter, blank arrays and sample tracing cards. Prebuild the interpreter in a read-only folder. Disable Caps Lock before typing. Verify the computer starts reliably.
Assessment for learning
Inspect the array declaration for correct size and indexing. Mark the use cases for genuine relevance. Check the index-access trace for correct retrieval. Flag any learner who thinks arrays store text only.
Inclusion and homework
Provide the array template predeclared for size and allow oral completion of indexing. Extend confident learners with two arrays and a second use case homework. Homework: declare two arrays of different sizes and compare memory usage in one paragraph.