A Level Computer Science Year 13

Year 13 Computer Science

Term of Study

Practical

Theory

Assessments

Autumn Term

• 4.1.3 - Systems life cycle
• 4.1.3 - Systems life cycle
• Search Algorithms
• 4.1.3 - Systems life cycle
• 4.3.6.1 Shortest Path Algorithms
• 4.1.3 - Systems life cycle
• Optimising Algorithms
• 4.1.3 - Systems life cycle
• Optimising Algorithms
• 4.4.2 FSM
• FSM - with output
• Turing Machines

• 4.4.4.1 Comparing Algorithms
• 4.4.4.2 Maths for Big O
• 4.4.4.3 Order of Complexity
• 4.2.6 Hash Tables
• 4.2.7 Dictionaries
• 4.4.4.4 Limits of computation
• 4.4.4.5 Classification of Algorithms
• 4.4.4.6 Computable|non-computable
• 4.2.8 Vectors
• Review of Queues, stacks, trees, graphs, hash tables, dictionaries and vectors.
• 4.4.4.7 Halting Problem
• 4.3.1 Graph Traversal Algorithms
• 4.5.1.6 Ordinal Numbers
• 4.5.1.7 Counting and Measuring
• 4.3.2 Tree Traversal Algorithms
• 4.5.4.4 Floating Point
• 4.5.4.5 Rounding Errors
• 4.5.4.6 Relative & Absolute
• 4.5.4.7 Range and Precision
• 4.5.4.9 Overflow and Underflow
• 4.5.4.8 Normalisation of floating point
• 4.8.1 Social, Morale, Ethical and Legal consequences of computers
• 4.4.2.2 Maths for Regular Expressions
• 4.4.2.3 Regular Expressions
• 4.4.2.4 Regular Language
• 4.4.3.1 BNF
• 4.3.3.1 RPN

Mock Examinations

Exercises and homework(s) on topics

Submission of programming work

Spring Term

• Mock Feedback
• Revise Databases
• Client Server Databases
• Big Data

• 4.12 Functional Programming
• 4.11.1 Connection to big data
• 4.12.1 Functional Programming Paradigm
• 4.12.2 Writing Functional Programs
• 4.12.3 Lists in Functional Programming
• 4.8.1 Social, Morale, Ethical and Legal consequences of computers

Coursework

End of term tests

Summer Term

• Revision

• Revision

• Past exam questions
• Kahoots
• ItsLearning Exercises