# Algorithms review

In this lesson, learners will have time to practise and cement their knowledge of some of the things they have learnt in the algorithms unit. The worksheets contain a range of questions on flow charts, searching algorithms, and sorting algorithms that will help prepare them for the summative assessment for the unit.

This quiz includes images that don't have any alt text - please contact your teacher who should be able to help you with an audio description.

Quiz:

# Intro quiz - Recap from previous lesson

Before we start this lesson, let’s see what you can remember from this topic. Here’s a quick quiz!

## Question 8

Q1.'The merge sort algorithm has two parts: splitting items and merging items'

1/8

Q2.The first part of a merge sort it to repeatedly split a list in half until all the elements are in a list by themselves.

2/8

Q3.Each stage of the merge sort algorithm can be shown in two parts: splitting the items and merging pairs of lists.

3/8

Q4.The merge sort algorithm is less complex to implement than bubble sort.

4/8

Q5.The advantage to merge sort is that it requires more memory, often due to the new lists that need to be created.

5/8

Q6."Executing a merge sort takes up extra space in memory, as new lists are made each time a list is split or two lists are combined."

6/8

Q7."A merge sort algorithm is usually slower to execute but more easier to write than bubble sort."

7/8

Q8."Merge sort is an efficient divide and conquer algorithm that can perform well in real-world use."

8/8

This quiz includes images that don't have any alt text - please contact your teacher who should be able to help you with an audio description.

Quiz:

# Intro quiz - Recap from previous lesson

Before we start this lesson, let’s see what you can remember from this topic. Here’s a quick quiz!

## Question 8

Q1.'The merge sort algorithm has two parts: splitting items and merging items'

1/8

Q2.The first part of a merge sort it to repeatedly split a list in half until all the elements are in a list by themselves.

2/8

Q3.Each stage of the merge sort algorithm can be shown in two parts: splitting the items and merging pairs of lists.

3/8

Q4.The merge sort algorithm is less complex to implement than bubble sort.

4/8

Q5.The advantage to merge sort is that it requires more memory, often due to the new lists that need to be created.

5/8

Q6."Executing a merge sort takes up extra space in memory, as new lists are made each time a list is split or two lists are combined."

6/8

Q7."A merge sort algorithm is usually slower to execute but more easier to write than bubble sort."

7/8

Q8."Merge sort is an efficient divide and conquer algorithm that can perform well in real-world use."

8/8

# Video

Click on the play button to start the video. If your teacher asks you to pause the video and look at the worksheet you should:

• Click "Close Video"
• Click "Next" to view the activity

Your video will re-appear on the next page, and will stay paused in the right place.

# Worksheet

These slides will take you through some tasks for the lesson. If you need to re-play the video, click the ‘Resume Video’ icon. If you are asked to add answers to the slides, first download or print out the worksheet. Once you have finished all the tasks, click ‘Next’ below.

This quiz includes images that don't have any alt text - please contact your teacher who should be able to help you with an audio description.

Quiz:

# Algorithms Review

This quiz is to assess your learning from this lesson. Read the description below and select which term it is referring to:

## Question 8

Q1.‘Split data until each item is in a list of its own and then combine pairs of lists repeatedly so that the items are in order.’

1/8

Q2.‘Move through a list repeatedly, comparing items next to each other and swapping them if they are in the wrong order.’

2/8

Q3.Analyse the flow chart below. Which algorithm does this represent?

3/8

Q4.What does the initial value of -1 indicate?

4/8

Q5.Which sort splits data repeatedly until each item is in a list of its own

5/8

Q6.Which sort creates a new list each time two lists are combined

6/8

Q7.An advantage of merge sort over bubble sort is that it is faster to sort large lists and lists that are less ordered.

7/8

Q8.Bubble sort can be quicker than merge sort on smaller lists and lists that are mostly in order.

8/8

This quiz includes images that don't have any alt text - please contact your teacher who should be able to help you with an audio description.

Quiz:

# Algorithms Review

This quiz is to assess your learning from this lesson. Read the description below and select which term it is referring to:

## Question 8

Q1.‘Split data until each item is in a list of its own and then combine pairs of lists repeatedly so that the items are in order.’

1/8

Q2.‘Move through a list repeatedly, comparing items next to each other and swapping them if they are in the wrong order.’

2/8

Q3.Analyse the flow chart below. Which algorithm does this represent?

3/8

Q4.What does the initial value of -1 indicate?

4/8

Q5.Which sort splits data repeatedly until each item is in a list of its own

5/8

Q6.Which sort creates a new list each time two lists are combined

6/8

Q7.An advantage of merge sort over bubble sort is that it is faster to sort large lists and lists that are less ordered.

7/8

Q8.Bubble sort can be quicker than merge sort on smaller lists and lists that are mostly in order.

8/8

# Lesson summary: Algorithms review

### It looks like you have not completed one of the quizzes.

To share your results with your teacher please complete one of the quizzes.

### Time to move!

Did you know that exercise helps your concentration and ability to learn?

For 5 mins...

Move around:
Climb stairs

On the spot:
Chair yoga

### Take part in The Big Ask.

The Children's Commissioner for England wants to know what matters to young people.

Share your views and have your voice heard.

This was the final lesson in the unit Algorithms.