Loop cards are a great game that can be played individually or as a class. They are perfect for review key vocabulary or questions at the end of a topic or when revising for an exam.
Instructions
Cut out the cards from the paper horizontally (but don't cut them in half!) and then shuffle them.
Now start joining each question on the right hand side of the card to the matching answer on the next card.
Carry on until all the cards loop together and you have competed the game!
Hint: Make sure that you set your paper to portrait to print 4 cards per sheet of A4 paper.
A data structure in which elements are inserted at one end and removed from the other end, following a First-In-First-Out (FIFO) order.
Insertion
The process of adding a new node to a linked list.
Binary search
A searching algorithm that divides the search interval in half at every step.
Recursion
A problem-solving technique that involves solving a problem by calling a function within the same function.
Time Complexity
The amount of time required by an algorithm to complete its execution as a function of the size of the input data.
leaf
A node in a tree structure that does not have any child nodes attached to it.
Big O Notation
A mathematical notation that describes the upper bound of the time complexity of an algorithm in terms of the size of the input data. It is used to compare the performance of different algorithms.
Array
A collection of elements of similar data type stored in contiguous memory locations.