The Cipher Vault: Linear vs Binary Search | Video-Based CS Worksheet Pack (100 Marks + Marking Scheme)
🔐 THE CIPHER VAULT: Linear Search vs Binary Search
The video-based computer science pack your students will actually remember.
Two people. One locked vault in Alexandria. 1,000 lockers. One key. 🗝️
Amira and Tariq have minutes to find it, and the only way out is to understand how searching algorithms really work.
Your students watch the story, then prove they understood it by tracing, coding, calculating and evaluating.
🎬 STEP 1: WATCH THE VIDEO FIRST (REQUIRED)
⚠️ This worksheet is built on the video. Students must watch it before they start.
👉 WATCH “THE CIPHER VAULT” FREE ON THE NAZLI TECH SCHOOL YOUTUBE CHANNEL:
🔗 https://www.youtube.com/watch?v=rainMnWXi0Q&t=16s
⏱️ It’s only about 3 minutes.
📝 The questions use numbers, code lines and scenes from the video.
🧭 The Teacher Guide includes a scene-by-scene video map showing where to pause.
📦 WHAT’S INSIDE (31-page PDF, four parts in one)
📘 1. Concept Briefing: vocabulary, linear search, binary search, recursion, Big-O, a comparison table and university extensions. Pseudocode and Python are included.
👩🏫 2. Teacher Guide: learning outcomes, a ready-made 90-minute lesson plan, the video map, common misconceptions with fixes, and differentiation for support, core and stretch.
✏️ 3. Student Worksheet: 27 questions across 5 sections (100 marks), plus a bonus challenge and a self-review checklist. It covers trace tables, debugging, pseudocode and complexity analysis.
✅ 4. Full Marking Scheme: model answers, mark points, accept / do-not-accept notes, grade bands and a skills map.
🎓 ALIGNED TO
✔️ Cambridge IGCSE and A Level
✔️ IB Diploma
✔️ AP CSP and AP CSA
✔️ University CS1 / CS2
A curriculum map shows exactly which questions fit each programme.
🚀 WHY TEACHERS LOVE IT
⚡ Zero prep. Print it and teach.
🧠 Real thinking, not just recall. Marks are tagged AO1, AO2 and AO3, and by skill.
🔍 A built-in “gotcha.” The video says “10 comparisons”, but the real count is 9. Students learn the difference between an upper bound and an exact count.
🐞 Debugging and evaluation tasks. Find the infinite loop. Decide whether to sort first or not.
🎯 Differentiated. It works for foundation and for stretch learners.
🛠️ HOW IT WORKS
1️⃣ Buy and download the PDF instantly
2️⃣ Watch the free video: 🔗 [PASTE YOUTUBE LINK HERE]
3️⃣ Teach the lesson or hand out the worksheet
4️⃣ Mark with the included scheme
📄 DETAILS
📑 Format: PDF, 31 pages, A4, print-ready
⏳ Time: 90 minutes (briefing, two viewings, worksheet, review)
💯 Marks: 100 (+5 bonus)
🐍 Language: Python, with Cambridge / IB-style pseudocode
🏫 Licensed for classroom use. Not for resale or redistribution.
👩💻 Created by Engineer Alisia Habibi, Academic Director & Co-Founder, Nazli Tech School · AI Tech Cognoscentia