Learning activities and Stretch and Challenge in RED (to be https://code.g contextualising Specification resources enhanced by unit teacher as appropriate for reference (opportunities for learner group). Plenary skills What will be development). Key learning objectives learners a wonderfully practical and learner led? How will learner expressive method for designing and What will be progress be implementing simple recursive in PURPLE. Consider inclusion and led? checked? English in differentiation (as appropriate algorithms. Topics for GREEN. and relevant). Equality and Evidence plenary? Diversity in BLUE (to be Python requirements? Transferable Homework? python.org/ enhanced by unit teacher as Skills in Classroom based or off-site? appropriate for learner group). pyscripter - An open-source Python ORANGE. Embedding Employer engagement? Integrated Development Environment (IDE) or oogle.com/p/p def F(n): yscripter/ if n == 0: return 0 elif n == 1: return 1 Sample else: return F(n‐1)+F(n‐2) Python code: print F(10) discussion detailing where simple iterative techniques may be more efficient.
Specification reference Key learning objectives Consider inclusion and differentiation (as appropriate and relevant). Equality and Diversity in BLUE (to be enhanced by unit teacher as appropriate for learner group). Learning activities and resources What will be learner led? What will be led? Topics for plenary? Homework? Classroom based or off-site? Employer engagement? Stretch and Challenge in RED (to be enhanced by unit teacher as appropriate for learner group). learners a wonderfully practical and expressive method for designing and implementing simple recursive algorithms. Python python.org/ pyscripter - An open-source Python Integrated Development Environment (IDE) https://code.g Plenary How will learner progress be checked? Evidence requirements? Embedding or contextualising (opportunities for skills development). in PURPLE. English in GREEN. Transferable Skills in ORANGE. oogle.com/p/p yscripter/ Sample Python code: def F(n): if n == 0: return 0 elif n == 1: return 1 else: return F(n‐1)+F(n‐2) print F(10) discussion detailing where simple iterative techniques may be more efficient.
AQA-TVQ01009-TVQ01010-MC-SOW.DOCX