Starter Complete the Word Search

CG3.7 Algorithms (The Insertion Sort (Chapter 46) & Algorithm Testing)

Objectives 1.Understand and be able to describe the Insertion sort in terms of description and pseudo code. 2.Understand how algorithms can be tested using suitable test data.

Assessment Target Grade Grade A –B: Be able to fully explain the Insertion Sort, carry out the Insertion sort on a set of data, explain it to others and demonstrate understanding using pseudo code. Be able to demonstrate how an algorithms can be tested. Grade C-D : Be able to explain the Insertion Sort, carry out the insertion sort on a set of data and be able to attempt creating the pseudo code for it. Be able to test algorithms using suitable data. Grade E: Know what the Insertion sort is and be able to attempt to implement it on some data and be able to test algorithms.

The Insertion Sort Activity 1) Reciprocal Teaching Activity – Read and highlight keywords / phrases from the notes. Come up with as many questions as you can that you could ask other students based upon the text you read. (15 Minutes) 2) Judge, Questioner, Answerer (15 Minutes)

The Insertion Sort Continue sorting this list after the 4th pass (starting from 19)

What is Algorithm Testing? Computer Systems need to be reliable. To make sure of this, testing is undertaken at many different stages of software development. Algorithms can be tested by checking the outputs for selected input data values, to make sure they are as expected.

Selection of Test Data When testing an algorithm, you need to run a sequence of tests. If one test works, that does not mean the program will work every time. You must select data which is: 1) Normal 2) Extreme 3) Incompatible e.g. data of the wrong type (Erroneous) 4) Non-Existence e.g. zero or null

Test Data Activity Type of testDefinitionExample used in a scenario Normal Extreme Incompatible Non-Existence

Test Data Activity For a student to be eligible to be in secondary school they have to be aged between 11 and 19. If we had a field called Age. Give examples of test data that could be used to test the data. NormalExtremeIncompatibleNon-Existence

Insertion Sort Stretch & Challenge Activity 1)Create the Pseudo Code for the Insertion Sort 2)Create the animation using PowerPoint to demonstrate the Insertion Sort Activity 3)Perform an insertion sort on the following data list

1) An algorithm is written for a bubble sort in one particular application. The input to the algorithm is a set of 6 positive integers. One set of data which would test this algorithm is: Write down two other sets of data which will more fully test the algorithm. [2] Exam Questions Progress Scale?

Plenary m.socrative.com Room No

Assessment Target Grade Grade A –B: Be able to fully explain the Insertion Sort, carry out the Insertion sort on a set of data, explain it to others and demonstrate understanding using pseudo code. Be able to demonstrate how an algorithms can be tested. Grade C-D : Be able to explain the Insertion Sort, carry out the insertion sort on a set of data and be able to attempt creating the pseudo code for it. Be able to test algorithms using suitable data. Grade E: Know what the Insertion sort is and be able to attempt to implement it on some data and be able to test algorithms.

Plenary