String Handling, Random Numbers & Exception Handling
AQA 75174.1.7–4.1.9A-levelLesson packSubscription
Also online
This worksheet marks itself
Set it as homework or classwork and every answer is marked as pupils go, with feedback on what they got wrong. The scores go straight into your mark book, so you can see who needs help before the next lesson.
- 11 questions
- 39 marks
- about 55 minutes
- marked instantly
Question types: multiple choice, multi-part, short answer, fill the gap, matching.
About this resource
AQA A-level Computer Science (7517) Paper 1, 4.1.1.7–4.1.1.9 — string-handling operations (length, position, substring, concatenation, character↔character code, string conversion operations), random number generation, and exception handling.
27 slides.
Lesson outline
- Do Now — Retrieval
- I-Do: Length and Position
- Hinge Check — Length
- I-Do: Substring and Slicing
- Hinge Check — Slicing is Exclusive at the Stop Index
- We-Do — Trace Indexing, Slicing and Concatenation
- I-Do: Concatenation
- I-Do: Character ↔ Character Code
- Hinge Check — chr()
- We-Do — Character Codes
- I-Do: String Conversion Operations
- Hinge Check — Concatenation Needs a Conversion
Unit bundlePaper 1
More from 4.1 Fundamentals of programming
- Lesson pack · 4.1.1.1Data TypesFree
- Lesson pack · 4.1.1.2–4.1.1.6Programming Concepts & OperationsSubscription
- Lesson pack · 4.1.1.15–16Stack Frames & Recursive TechniquesSubscription
- Lesson pack · 4.1.2Programming Paradigms & Hierarchy ChartsSubscription
- Lesson pack · 4.1.10–4.1.14Subroutines, Parameters, Return Values & ScopeSubscription
- Knowledge organiser · 4.1Programming (Part 1) — Data Types & Programming ConceptsFree
- Knowledge organiser · 4.1Programming (Part 2) — Strings, Random, Exceptions, Subroutines & ScopeSubscription
- Knowledge organiser · 4.1Programming (Part 3) — Stack Frames, Recursion, Paradigms & Hierarchy ChartsSubscription


