[GCSE + IGCSE] Computer Science Trace Tables, Algorithms and Efficiency

This is an excellent resource that I have created and used with my Y10 and Y11 GCSE class (Y10 are IGCSE, and is relevant to both courses)
I use this as a collaborative carousel activity where students in pairs (or however you want to work it) look at two algorithms at a time, tracing the values of the variables.

This is a problem solving activity that should hopefully challenge students Computational Thinking, as well as revising their skills with Trace Tables and predicting output of code, as well as spotting Logical errors.

I have also used it to introduce the idea of preprocessing. This series of activities leads nicely into more challenging activities, such as sorting of data. When I teach this lesson, I use some theory resources and plenary activities, as well as some on-line quizzes over 3 lessons.

Had a looking for learning observation whilst using these activities and feedback from observation was excellent. Having reviewed it with students, their feedback was (a long with the Data Structures activities uploaded and used prior to these activities) is that it really helped them to visualise how data is stored and manipulated in arrays, as well as introducing preprocessing (which appeared in this year exam) as well as revising trace tables. Allowing the students to work in collaboration, discussing with one another and doing some peer review tied in neatly with some of the observational areas which we are looking at with ATL and Life After Levels.

I was also toying with doing this as a group presentation activity, where the students can ‘lead’ this activity and ‘Be the Teacher’ explaining the inefficiency of their algorithm and how the data can be as issue also.

This was also a perfect opportunity to revise why we use arrays in the first place - as I got students to re-write the code without arrays and it was a crazy series of IF statements, so plenty of scope to draw in other areas of the course.