FreeMathWorksheet

Full Practice

TN-CSCI-GR12-99114 · v3.9

Introduction to Algorithms

Grade 12 · Computer Science · Algorithms · International Baccalaureate

Grade

Grade 12

Subject

Computer Science

Topic

Algorithms

Subtopic

Introduction to Algorithms

Curriculum

International Baccalaureate

Difficulty

Mixed

Time

50 minutes

Total marks

64

Student name

Teacher name

Date

Learning objectives

Recognise introduction to algorithms accurately in computer science contexts.
Explain the underlying rule of introduction to algorithms in the student's own words.
Apply introduction to algorithms 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.Write down one fact you already know about introduction to algorithms.
[1]
2.Circle one fact you already know about introduction to algorithms.
[1]
3.Write down one fact you already know about introduction to algorithms.
[1]
4.Name one fact you already know about introduction to algorithms.
[1]
5.Name one fact you already know about introduction to algorithms.
[1]

FreeMathWorksheet · Grade 12 Computer Science

Introduction to Algorithms

Recall

Bloom: Remember · 5 marks

Complete from memory. No calculator, no notes.

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

Basic Practice

Bloom: Understand · 6 marks

Work through each item. Show the step you used.

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

FreeMathWorksheet · Grade 12 Computer Science

Introduction to Algorithms

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.Using the first step given, finish 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.Calculate part 1 on introduction to algorithms without help.
[2]
2.Calculate part 2 on introduction to algorithms without help.
[2]
3.Work out fully part 3 on introduction to algorithms without help.
[2]
4.Solve part 4 on introduction to algorithms without help.
[2]
5.Determine part 5 on introduction to algorithms without help.
[2]
6.Determine part 6 on introduction to algorithms without help.
[2]

FreeMathWorksheet · Grade 12 Computer Science

Introduction to Algorithms

Challenge Questions

Bloom: Analyse · 12 marks

Harder items. Attempt every one, even partially.

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

Real-life Application

Bloom: Apply · 6 marks

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

1.Apply a real computer science situation that depends on introduction to algorithms.
[3]
2.Apply a real computer science situation that depends on introduction to algorithms.
[3]

FreeMathWorksheet · Grade 12 Computer Science

Introduction to Algorithms

Critical Thinking

Bloom: Evaluate · 8 marks

Explain your reasoning in full sentences.

1.Explain why a student's method for introduction to algorithms is or is not efficient.
[4]
2.Compare and justify a student's method for introduction to algorithms 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 algorithms and what you will practise next.
[—]
2.Describe how confident you feel with introduction to algorithms and what you will practise next.
[—]