1. Resources Home
  2. High School
  3. Computing
  4. Computational thinking
  5. Decomposition
Python Programming–Jumbled Code Task Cards (Beginner) Coding Unplugged Activity

Python Programming–Jumbled Code Task Cards (Beginner) Coding Unplugged Activity

This resource is a brilliant way to get students to begin coding in Python! A set of 12 different Jumbled Code Python Task Cards which can be cut out, laminated and distributed to students. Instructions: Students need to look at the code and read the English statements (pseudo code) in order to put the jumbled python code in the correct order. These have been brilliant in my classroom and I have used them for starter and review activities. I have even used these as an introduction to coding in Python. These task cards also test students understanding of the following programming concepts: 1) syntax errors 2) logical errors 3) variables 4) print() function 5) input() function 6) int() function 6) if statements 7) while loops 8) lists 9) sorting & reverse sorting data in lists. Each task card also allows you to question students further on their knowledge of Python i.e: • “why was the data type string and not integer?” • “what is the difference between the input() and print() functions?” • “why did we need to use the int() function?E • Etc… Python software can be downloaded for free from: https://www.python.org/downloads/ There are also many online platforms in which Python can be used such as codeacademy.com
balsamgr8
Introduction to Creating Algorithms!

Introduction to Creating Algorithms!

The aim of this resource is to introduce students to the basic concepts of algorithm design. This resource is aimed at absolute beginners of algorithm design and takes you through the following parts: 1. Understanding algebra 2. Understanding Boolean 3. Using Variables 4. Introduction to Algorithm Design i. Sequence ii. Selection (IF, ELSE, ELSE IF) iii. Variables iv. Looping (WHILE and REPEAT) v. Functions Each section includes activities to develop student understanding of the concept. The work finishes with a differentiated consolidation challenge, applying the concepts learned throughout the unit. ***Please leave a Review!***
RobbotResources
Fundamentals of Algorithms  GCSE revision student workbook

Fundamentals of Algorithms GCSE revision student workbook

This is the ONLY comprehensive and accurate workbook that covers ALL of the “Fundamentals of Algorithms” syllabus. Includes 82 pages covering the theory and giving lots of practical activities and even includes the answers. Ideal as a GCSE revision aid or as a teaching resource and includes lots of help with understanding and comparing linear search, binary search, bubble sort and merge sort algorithms. This book has been written to give you practical hands-on approach to help you learn how to write algorithms. Instead of chapters of technical jargon and mind-numbing tedium the theory is broken down into smaller, manageable chunks with practical tasks for you to perform as you go along. This helps you ensure you understand the theory and remember it as you apply it to practical problems. This book was specifically written to assist students preparing for their AQA GCSE Computer Science examination (8520), and the pseudocode and objectives have been written specifically to match the syllabus, as of February 2018. However, the theory and methods would be beneficial to anybody who wants to know how to create good algorithms. Includes a single 82-page PDF document which can be given to the pupils to work through for homework tasks or in class. Table of contents: Introduction What are algorithms? Computer programs and algorithms Decomposition Abstraction Basic Pseudocode Recap programming basics What is an expression? Arithmetic Operations Relational Operators Boolean Operators Input and Output Iteration Selection Nesting statements Flowcharts Flowchart symbols Drawing loops in flowcharts Understanding flowcharts Trace Tables More complex trace tables Dealing with Arrays Subroutines Writing subroutines in pseudocode Showing subroutines in flowcharts Dealing with strings ASCII and Unicode Searching Algorithms Linear search Binary Search Compare the two search algorithms Sorting Algorithms Bubble Sort Merge Sort Compare the two sort algorithms
nwilkin
AS Level Computer Science: Abstraction and Automation

AS Level Computer Science: Abstraction and Automation

Abstraction and Automation are key aspects of Computer Science, but at A Level their definitions are rather overlooked by some exam boards than others. This powerpoint serves the purpose of defining and explaining abstraction and automation, with relation to computational thinking, and helps students with the problem solving questions on AQA's syllabus.
mro2013
Computational Thinking and the Digital Competence Framework

Computational Thinking and the Digital Competence Framework

My latest poster shows how the understanding of Computational Thinking underpins all concepts of the Digital Competence Framework (DCF). I have given examples of how each concept can be applied to primary strands of the framework. Feel free to download and use as part of CPD sessions! ***Please leave a review!***
RobbotResources
Computing Who Wants to be a Millionaire Python Project

Computing Who Wants to be a Millionaire Python Project

A Python Programming Project to simulate the popular quiz show "Who wants to be a Millionaire" Answer 15 questions to win the Million jackpot Use your 3 lifelines to help you Read in the questions and randomly select more difficult questions as the player progresses through the quiz. Help notes, PowerPoint with code explanations, student worksheet and full python solution for teachers provided.
HeatonMoorDigital