FreeMathWorksheet

Full Practice

TN-PROG-GR12-94607 · v2.5

Introduction to Data Structures

Grade 12 · Programming · Data Structures · National Curriculum (UK)

Grade

Grade 12

Subject

Programming

Topic

Data Structures

Subtopic

Introduction to Data Structures

Curriculum

National Curriculum (UK)

Difficulty

Mixed

Time

50 minutes

Total marks

64

Student name

Teacher name

Date

Learning objectives

Recognise introduction to data structures accurately in programming contexts.
Explain the underlying rule of introduction to data structures in the student's own words.
Apply introduction to data structures to multi-step and unfamiliar problems.
Justify a chosen method and identify errors in another student's work.

Skills assessed

Fluency and recall
Method and setting out
Reasoning and justification
Problem solving in context
Self-assessment

Instructions

Write your name, your teacher's name and the date in the header.
Answer every question in the space provided. Continue on the back if needed.
Show all working — method marks are awarded even when the final answer is wrong.
Aim to finish in about 50 minutes.
Complete the reflection box at the end before you hand the sheet in.

Warm-up

Bloom: Remember · 5 marks

Answer quickly. These check you are ready for the topic.

1.Circle one fact you already know about introduction to data structures.
[1]
2.State one fact you already know about introduction to data structures.
[1]
3.Name one fact you already know about introduction to data structures.
[1]
4.Circle one fact you already know about introduction to data structures.
[1]
5.Circle one fact you already know about introduction to data structures.
[1]

FreeMathWorksheet · Grade 12 Programming

Introduction to Data Structures

Recall

Bloom: Remember · 5 marks

Complete from memory. No calculator, no notes.

1.Complete the key term used in introduction to data structures described here: item 1.
[1]
2.Complete the key term used in introduction to data structures described here: item 2.
[1]
3.List the key term used in introduction to data structures described here: item 3.
[1]
4.Define the key term used in introduction to data structures described here: item 4.
[1]
5.List the key term used in introduction to data structures described here: item 5.
[1]

Basic Practice

Bloom: Understand · 6 marks

Work through each item. Show the step you used.

1.Work out part 1 using the rule for introduction to data structures.
[1]
2.Complete part 2 using the rule for introduction to data structures.
[1]
3.Work out part 3 using the rule for introduction to data structures.
[1]
4.Work out part 4 using the rule for introduction to data structures.
[1]
5.Identify part 5 using the rule for introduction to data structures.
[1]
6.Match part 6 using the rule for introduction to data structures.
[1]

FreeMathWorksheet · Grade 12 Programming

Introduction to Data Structures

Guided Practice

Bloom: Understand · 10 marks

The first step is given. Finish the reasoning.

1.Using the first step given, finish part 1. Step 1 has been started for you.
[2]
2.Continue the working for part 2. Step 1 has been started for you.
[2]
3.Complete the method for part 3. Step 1 has been started for you.
[2]
4.Using the first step given, finish part 4. Step 1 has been started for you.
[2]
5.Continue the working for part 5. Step 1 has been started for you.
[2]

Independent Practice

Bloom: Apply · 12 marks

No scaffolding. Set out your full method.

1.Solve part 1 on introduction to data structures without help.
[2]
2.Work out fully part 2 on introduction to data structures without help.
[2]
3.Work out fully part 3 on introduction to data structures without help.
[2]
4.Determine part 4 on introduction to data structures without help.
[2]
5.Work out fully part 5 on introduction to data structures without help.
[2]
6.Work out fully part 6 on introduction to data structures without help.
[2]

FreeMathWorksheet · Grade 12 Programming

Introduction to Data Structures

Challenge Questions

Bloom: Analyse · 12 marks

Harder items. Attempt every one, even partially.

1.Show that the statement in part 1 about introduction to data structures.
[3]
2.Prove the statement in part 2 about introduction to data structures.
[3]
3.Prove the statement in part 3 about introduction to data structures.
[3]
4.Find and justify the statement in part 4 about introduction to data structures.
[3]

Real-life Application

Bloom: Apply · 6 marks

Use the skill in context. State units in your answer.

1.Apply a real programming situation that depends on introduction to data structures.
[3]
2.Apply a real programming situation that depends on introduction to data structures.
[3]

FreeMathWorksheet · Grade 12 Programming

Introduction to Data Structures

Critical Thinking

Bloom: Evaluate · 8 marks

Explain your reasoning in full sentences.

1.Evaluate whether a student's method for introduction to data structures is or is not efficient.
[4]
2.Evaluate whether a student's method for introduction to data structures is or is not efficient.
[4]

Reflection

Bloom: Create · 0 marks

Not marked. Answer honestly — this guides your next worksheet.

1.Reflect on how confident you feel with introduction to data structures and what you will practise next.
[—]
2.Describe how confident you feel with introduction to data structures and what you will practise next.
[—]