Hero image

Simply Teach

Average Rating4.89
(based on 79 reviews)

Any queries please don't hesitate to contact me via email: info@mysimplyteach.co.uk If you're interested in a yearly subscription for £150 per year then go to: www.mysimplyteach.co.uk

679Uploads

105k+Views

84k+Downloads

Any queries please don't hesitate to contact me via email: info@mysimplyteach.co.uk If you're interested in a yearly subscription for £150 per year then go to: www.mysimplyteach.co.uk
WJEC GCSE Digi Tech Unit 3: Lesson 7
dco7785dco7785

WJEC GCSE Digi Tech Unit 3: Lesson 7

(0)
Lesson 7: Risks (Part 2) Each lesson pack includes: • Lesson PPT with embedded activities and information. • Student workbook including a teacher version with answers. • A copy of an NEA scrapbook for an assignment-related activity (not in all packs) • Knowledge organiser which can be used as support material in the lesson (not in all packs) • New case studies, practice assignment and scenarios not provided by WJEC.
WJEC GCSE Digital Technology - Unit 1.6 Bundle
dco7785dco7785

WJEC GCSE Digital Technology - Unit 1.6 Bundle

(0)
This pack includes 4 topics with: Lesson slides and a built-in discussion activity Knowledge retrieval starter Activity sheets with answers Revision workbooks with answers Knowledge capture with answers Knowledge organisers.
WJEC GCSE Digital Technology - 1.3 Bundle
dco7785dco7785

WJEC GCSE Digital Technology - 1.3 Bundle

(0)
This pack includes 3 topics with: Lesson slides and a built-in discussion activity Knowledge retrieval starter Activity sheets with answers Revision workbooks with answers Knowledge capture with answers Knowledge organisers.
WJEC Voc IT - 2.3 Automated documents
dco7785dco7785

WJEC Voc IT - 2.3 Automated documents

(0)
3 lessons that include a starter, new information and/or worked examples. Written and video tutorials provided if students need upskilling. NEA Scrapbook (Student and teacher version) Scheme of work with commentary.
Exam Walkthrough - CS29: Searching & Sorting algorithms
dco7785dco7785

Exam Walkthrough - CS29: Searching & Sorting algorithms

(0)
A set of questions that cover all the key specification points. Closely aligned to the range of questions they may get in the exam. For example, questions that fit into AO1 and AO2 strands. Mark scheme that explicitly mentions which strand each question falls into. Lesson PPT which is the walkthrough element, focusing on exam technique and how to better understand what is being asked of them.
Exam Walkthrough - CS28: Computational thinking
dco7785dco7785

Exam Walkthrough - CS28: Computational thinking

(0)
A set of questions that cover all the key specification points. Closely aligned to the range of questions they may get in the exam. For example, questions that fit into AO1 and AO2 strands. Mark scheme that explicitly mentions which strand each question falls into. Lesson PPT which is the walkthrough element, focusing on exam technique and how to better understand what is being asked of them.
Exam Walkthrough - CS31: High-level languages
dco7785dco7785

Exam Walkthrough - CS31: High-level languages

(0)
A set of questions that cover all the key specification points. Closely aligned to the range of questions they may get in the exam. For example, questions that fit into AO1, AO2 and AO3 strands. Mark scheme that explicitly mentions which strand each question falls into. Lesson PPT which is the walkthrough element, focusing on exam technique and how to better understand what is being asked of them.
Exam Walkthrough - CS34: Selection
dco7785dco7785

Exam Walkthrough - CS34: Selection

(0)
A set of questions that cover all the key specification points. Closely aligned to the range of questions they may get in the exam. For example, questions that fit into AO1, AO2 and AO3 strands. Mark scheme that explicitly mentions which strand each question falls into. Lesson PPT which is the walkthrough element, focusing on exam technique and how to better understand what is being asked of them.
Exam Walkthrough - CS32: Programming basics
dco7785dco7785

Exam Walkthrough - CS32: Programming basics

(0)
A set of questions that cover all the key specification points. Closely aligned to the range of questions they may get in the exam. For example, questions that fit into AO1, AO2 and AO3 strands. Mark scheme that explicitly mentions which strand each question falls into. Lesson PPT which is the walkthrough element, focusing on exam technique and how to better understand what is being asked of them.
Exam Walkthrough - CS30: Algorithmic thinking
dco7785dco7785

Exam Walkthrough - CS30: Algorithmic thinking

(0)
A set of questions that cover all the key specification points. Closely aligned to the range of questions they may get in the exam. For example, questions that fit into AO1, AO2 and AO3 strands. Mark scheme that explicitly mentions which strand each question falls into. Lesson PPT which is the walkthrough element, focusing on exam technique and how to better understand what is being asked of them.
Exam Walkthrough - CS33: String manipulation
dco7785dco7785

Exam Walkthrough - CS33: String manipulation

(0)
A set of questions that cover all the key specification points. Closely aligned to the range of questions they may get in the exam. For example, questions that fit into AO1, AO2 and AO3 strands. Mark scheme that explicitly mentions which strand each question falls into. Lesson PPT which is the walkthrough element, focusing on exam technique and how to better understand what is being asked of them.
Exam Walkthrough - CS36: Condition controlled iteration
dco7785dco7785

Exam Walkthrough - CS36: Condition controlled iteration

(0)
A set of questions that cover all the key specification points. Closely aligned to the range of questions they may get in the exam. For example, questions that fit into AO1, AO2 and AO3 strands. Mark scheme that explicitly mentions which strand each question falls into. Lesson PPT which is the walkthrough element, focusing on exam technique and how to better understand what is being asked of them.
Exam Walkthrough - CS38: Data structures
dco7785dco7785

Exam Walkthrough - CS38: Data structures

(0)
A set of questions that cover all the key specification points. Closely aligned to the range of questions they may get in the exam. For example, questions that fit into AO1, AO2 and AO3 strands. Mark scheme that explicitly mentions which strand each question falls into. Lesson PPT which is the walkthrough element, focusing on exam technique and how to better understand what is being asked of them.
Exam Walkthrough - CS39: File handling
dco7785dco7785

Exam Walkthrough - CS39: File handling

(0)
A set of questions that cover all the key specification points. Closely aligned to the range of questions they may get in the exam. For example, questions that fit into AO1, AO2 and AO3 strands. Mark scheme that explicitly mentions which strand each question falls into. Lesson PPT which is the walkthrough element, focusing on exam technique and how to better understand what is being asked of them.
Exam Walkthrough - CS37: Subprograms
dco7785dco7785

Exam Walkthrough - CS37: Subprograms

(0)
A set of questions that cover all the key specification points. Closely aligned to the range of questions they may get in the exam. For example, questions that fit into AO1, AO2 and AO3 strands. Mark scheme that explicitly mentions which strand each question falls into. Lesson PPT which is the walkthrough element, focusing on exam technique and how to better understand what is being asked of them.
Exam Walkthrough - CS35: Counter-controlled iteration
dco7785dco7785

Exam Walkthrough - CS35: Counter-controlled iteration

(0)
A set of questions that cover all the key specification points. Closely aligned to the range of questions they may get in the exam. For example, questions that fit into AO1, AO2 and AO3 strands. Mark scheme that explicitly mentions which strand each question falls into. Lesson PPT which is the walkthrough element, focusing on exam technique and how to better understand what is being asked of them.