Year 13 Computer Science
Term 1 |
Term 2 |
Term 3 |
Term 4 + |
|
---|---|---|---|---|
Content |
1.4.1 Data Types
|
1.5.1 Computing Legislation
|
2.1.4 Thinking Logically
|
2.3.1 Algorithms
Revision for final examinations |
Key Terminology and skills |
Binary Integers |
DPA |
Decision Points |
Dijkstra’s shortest path algorithm; Revision:Revising for examinations using past paper practice questions and identifying topics which students need more support on through our knowledge checking website as well as student preference. |
Firefly Links* |
||||
* Firefly links will only work for Trinity staff members, students and parents. | ||||
Assessments |
After learning new theory content, students make their own notes before answering questions using our bespoke knowledge checking website. They have access to supporting videos as well as knowledge organisers. During each lesson, students have access to past paper questions for each topic. Time is allocated to answering these and the creation of model answers. The mark schemes are available to support and check responses. |
|||
Homeworks |
Students are set up to 3 hours of homework per week for this subject. This time is tracked through our knowledge checking website and performance is closely monitored and rewarded with house points. Students are directed to spend time on topics which most benefit them for revision (based on previous performance). |