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 situation in which a program fails to release memory that is no longer needed, leading to a reduced amount of available memory and potential program crashes.
descendants
Nodes that are reachable from a given node by following descending edges.
Priority Queue
A specialized type of queue in which each element is associated with a priority and is served according to its priority.
Depth-first traversal
A method of traversing a tree data structure where each branch is visited as far as possible before backtracking.
Enqueue
The operation of adding an element to the end of a queue.
Iteration vs. recursion
Two problem-solving approaches that are used to solve problems. Iteration involves using loops to repeat a set of instructions, while recursion involves calling a function within the same function.
Push
A method of adding an item to the top of the stack.
Tower of Hanoi
A puzzle in which a tower of discs of different sizes is moved from one peg to another, with the constraint that only one disc can be moved at a time, and a larger disc cannot be placed on top of a smaller one.
Preorder traversal
A method of traversing a binary tree such that the root is visited, then the left subtree, then the right subtree.
Base case
The condition that stops the recursion; the simplest possible solution to a particular problem.