How to use exit tickets in Computing lessons
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?
- You hear from everyone. In a plenary, the five students who put their hands up answer. An exit ticket gets an answer from all thirty.
- It shapes the next lesson. Exit tickets are a formative assessment tool: the point is to change what you teach next, not to give a grade. Dylan Wiliam's Embedded Formative Assessment (2011) describes them as a quick way to decide where the next lesson starts.
- It's one more retrieval. Recalling something at the end of the lesson, without notes, helps it stick.
- It's honest. Students often feel they understood when they followed along. Answering alone shows them, and you, whether they can do it.
What the research says
- Formative assessment works. Black and Wiliam's (1998) review of over 250 studies found that checking what students understand during teaching, and changing the teaching in response, raises attainment, with some of the biggest gains for lower-attaining students.
- Check everyone, not volunteers. Rosenshine's (2012) Principles of Instruction include checking the understanding of all students, not just those who put their hands up. The most effective teachers in the studies he reviewed asked more questions and checked more often.
- Feedback should change what happens next. The Education Endowment Foundation's (2021) guidance on feedback stresses that feedback should be planned to move learning forward. An exit ticket tells you where the class needs to go next.
Writing a good exit ticket
- Two or three questions, no more. It should take three minutes, and you should be able to sort thirty answers in five.
- Test the lesson's main idea, not the details. If the lesson was on binary search, ask about binary search, not about the history of algorithms.
- Include one question that catches the common mistake. This is the most useful question on the ticket.
- Make answers quick to sort. Multiple choice, a calculation, a one-line trace or a short sentence. You're sorting into "got it", "nearly" and "not yet", not marking an essay.
Example exit tickets
GCSE: binary search (OCR J277 2.1)
- What must be true about a list before you can use a binary search?
- A sorted list has 8 items. Which item does a binary search check first?
- 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)
- Name the register that holds the address of the next instruction.
- Put these in order: decode, fetch, execute.
- 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)
- Push 3, push 8, pop, push 5. What is now at the top of the stack?
- 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
age = 12. What doesif age >= 13: print("Teen") else: print("Child")print?- Which word starts selection in Python:
for,iforwhile?
Answers: Child; if.
What to do with the answers
- Sort them into three piles after the lesson: got it, nearly, not yet. This takes a few minutes, not a marking session.
- 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.
- 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.
- A handful of students? Catch them at the start of next lesson while the rest do the starter.
- 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
- Running out of time. Set a timer for the exit ticket in your plan, five minutes before the bell. Don't let it be the first thing cut.
- Asking how they feel. "How confident are you, 1 to 5?" tells you how they feel, not what they know. Ask a question they have to answer.
- Collecting them and never looking. If the answers don't change next lesson, students soon notice and stop trying.
- Making them high stakes. Don't record exit tickets as marks. Students should feel safe writing "I don't know".
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
- Black, P. and Wiliam, D. (1998). Inside the black box: raising standards through classroom assessment. Phi Delta Kappan, 80(2), 139–148.
- Education Endowment Foundation (2021). Teacher feedback to improve pupil learning: guidance report.
- Rosenshine, B. (2012). Principles of Instruction: research-based strategies that all teachers should know. American Educator, 36(1), 12–19, 39.
- Wiliam, D. (2011). Embedded Formative Assessment. Bloomington, IN: Solution Tree Press.