1. Arrange students into groups. Each group needs at least ONE person who has a mobile device.
2. If their phone camera doesn't automatically detect and decode QR codes, ask students to
4. Cut them out and place them around your class / school.
1. Give each group a clipboard and a piece of paper so they can write down the decoded questions and their answers to them.
2. Explain to the students that the codes are hidden around the school. Each team will get ONE point for each question they correctly decode and copy down onto their sheet, and a further TWO points if they can then provide the correct answer and write this down underneath the question.
3. Away they go! The winner is the first team to return with the most correct answers in the time available. This could be within a lesson, or during a lunchbreak, or even over several days!
4. A detailed case study in how to set up a successful QR Scavenger Hunt using this tool can be found here.
Question | Answer |
| 1. Von Neumann Architecture | Ues a single control unit to manage program control. Executes one instruction at a time in a linear sequence. | 2. Memory Address Register | Receives the address of instructions/data (from PC). | 3. Stacks | A dynamic data structure that operates on the last-in first-out (LIFO) principle. Items can either be added to or removed from the top. | 4. Insertion Sort | This algorithm inserts one number at a time into the correct position so a list of sorted numbers is built up. | 5. Serial Search | The simplest searching algorithm, it starts at the first element in the list and checks every element until it finds the one it is looking for. | 6. Data Dictionary | A file containing descriptions of data in a database stored in tables, also known as metadata. | 7. Attribute | One piece of data about an object or person. Also known as a field. | 8. Declarative Languages | In this type of language the computer is given a set of facts and a goal. They state what is required but not how to do it. | 9. Classes | A template for a set of objects that have states and behaviours. They have methods and attributes. | 10. Data Encapsulation | This is the concept of only accessing data through the methods of a class. This maintains data integrity as it helps to prevent the data being altered accidentally. | 11. Indirect Addressing | Uses the address field as a pointer to the address to be used. | 12. Segmentation | A method of partitioning memory using logical divisions. | 13. Virtual Memory | Needed to allow programs to run that need more memory than is available. | 14. Disc Threshing | Occurs when more time is spent transferring pages between main memory and secondary storage than on processing. | 15. Round Robin | A scheduling algorithm in which each user is allocated a time slice. | 16. Backus-Naur Form | A notation used to unambiguously define the syntax of a computer language. | 17. Lexical Analysis | In this stage variable names are loaded into a symbol table. | 18. Intermediate Code | Partly translated code which can be run on any computer using an interpreter. | 19. Assembly Language | Uses mnemonics to represent machine code instructions. | 20. Register | A location in the processor used for a particular purpose. Temporarily stores data or control information. Allows very high speed access. |
Question 1 (of 20)
Question 2 (of 20)
Question 3 (of 20)
Question 4 (of 20)
Question 5 (of 20)
Question 6 (of 20)
Question 7 (of 20)
Question 8 (of 20)
Question 9 (of 20)
Question 10 (of 20)
Question 11 (of 20)
Question 12 (of 20)
Question 13 (of 20)
Question 14 (of 20)
Question 15 (of 20)
Question 16 (of 20)
Question 17 (of 20)
Question 18 (of 20)
Question 19 (of 20)
Question 20 (of 20)
