Printable Loopcards | Topic 5—Abstract data structures (23 hours) | IB Computer Science

What are loop cards?

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

  1. Cut out the cards from the paper horizontally (but don't cut them in half!) and then shuffle them.
  2. Now start joining each question on the right hand side of the card to the matching answer on the next card.
  3. 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.

Edit Vocab

A queue implementation that uses a linked list data structure to store elements, with each element pointing to the next one in the list.
Dequeue
The operation of removing an element from the front of a queue.
Static Data Structure
A data structure that has a fixed size, and its size cannot be changed at runtime.
right-child
The child node in a binary tree that is positioned to the right of its parent node.
Perfect binary tree
A binary tree where all interior nodes have two children and all leaves have the same depth.
Recursive case
The condition that the function calls itself.
Recursive traversal
A traversal algorithm that uses recursion to visit nodes in a tree data structure.
Array
A dynamic data structure that represents a collection of elements in contiguous memory locations.
Job Queue
A queue used to manage the execution of multiple processes or tasks in a computer system.
Linked List
A data structure composed of nodes that are linked together by pointers or references.
Linked Queue