Teacher guide

How to use exit tickets in Computing lessons

By Ash, Computing teacher and founder of RADevo · · 6 minute read

An exit ticket is a short task students answer before they leave: two or three questions on what the lesson set out to teach. It takes three minutes and tells you something a confident-sounding plenary often hides: who actually understood it. Here's how to write and use exit tickets in Computer Science and IT lessons.

Why use exit tickets?

What the research says

Writing a good exit ticket

Example exit tickets

GCSE: binary search (OCR J277 2.1)

  1. What must be true about a list before you can use a binary search?
  2. A sorted list has 8 items. Which item does a binary search check first?
  3. True or false: a binary search always finds an item faster than a linear search.

Answers: it must be sorted; the middle item (item 4 or 5, depending on how you round); false. In a small list, or when the item is first, a linear search can be quicker. The third question catches the most common mistake.

GCSE: the CPU (OCR J277 1.1)

  1. Name the register that holds the address of the next instruction.
  2. Put these in order: decode, fetch, execute.
  3. True or false: a CPU with more cores always runs every program faster.

Answers: the program counter; fetch, decode, execute; false. A program has to be written to use several cores at once to benefit.

A Level: stacks (OCR H446 1.4.2)

  1. Push 3, push 8, pop, push 5. What is now at the top of the stack?
  2. Give one real use of a stack in a computer.

Answers: 5; for example storing return addresses when subroutines are called, or the undo feature in an application.

KS3: selection in Python

  1. age = 12. What does if age >= 13: print("Teen") else: print("Child") print?
  2. Which word starts selection in Python: for, if or while?

Answers: Child; if.

What to do with the answers

  1. Sort them into three piles after the lesson: got it, nearly, not yet. This takes a few minutes, not a marking session.
  2. Most of the class got it? Move on, and put the topic in a Do Now in a week or two so it doesn't fade.
  3. A big "not yet" pile? Start next lesson by reteaching it a different way. A new example usually works better than repeating the same explanation.
  4. A handful of students? Catch them at the start of next lesson while the rest do the starter.
  5. Feed it into your Do Nows. The question most students got wrong is a perfect Do Now question for next week. See Using quiz data to plan your next Computing lesson.

Common pitfalls

How RADevo helps

RADevo's Exit ticket lists your recent lessons. Pick one and it puts the questions that lesson's quiz found hardest on the board, ready to answer before the bell, so you don't have to write the questions yourself. The results feed straight into next lesson's Do Now. If you want example questions to start with, our free revision quizzes cover GCSE, A Level, Cambridge Nationals, BTEC and KS3 Computing.

References

Teaching Computer Science or IT?

Set every topic as homework in two clicks, see who has done it and which questions your class got wrong, and start every lesson with a Do Now built from their mistakes.

Start a free 2-week trial

Revising for this?

If your school uses RADevo, sign in to do the full quizzes and keep your progress. If it doesn't, show this page to your Computing teacher.

Log in to RADevo