Back to search results

A Level - Computer Science

Thomas Aveling School, The

Arethusa Road, Rochester, Kent, ME1 2UW

GCE A/AS Level or Equivalent
Level 3
Information and Communication Technology

Available start dates

Available start dates

Tuesday, 01 September 2026
The Thomas Aveling School
2 Year(s)
Full time
Daytime/working hours

Application Instructions

Applications Open: Thursday, 6 November from 5pm

Applications Close: date and time to be confirmed by the school soon!

How To Apply:

Internal students - Apply via Applicaa using this link - https://thomasaveling.applicaa.com/year12

External students - Apply via KentChoices using this link - https://www.kentprospectus.co.uk/login. Please note - After sending your application, you'll receive a welcome email from Applicaa asking for further information.

Entry Requirements: Five GCSEs grade 4 and above. Refer to individual subjects for the specific entry requirements.

Course Summary

Candidates will study various Computer Science topics ranging from theoretical mathematical skills through to advanced programming. The course is 80% externally assessed through two examinations, with the last 20% being covered by a course work piece that is marked internally and externally moderated.

Our A Level Computer Science qualification helps students understand the core academic principles of computer science. Classroom learning is transferred into creating real-world systems through the creation of an independent programming project. Our A Level will develop the student’s technical understanding and their ability to analyse and solve problems using computational thinking in order to take them to the next level on their Computer Science career led pathway

Course Details

Year 12

• Data Representation, sign and magnitude, twos compliment, negative float point binary conversion, hexadecimal, data types, data structures, databases, stacks and queues, compression, encryption and hashing.
• Boolean Algebra- logic gate circuits, truth tables, Karnaugh maps, simplifying Boolean algebraic expressions.
• Structure and function of the processor, types of processor, Input, output and storage.
• Operating Systems software, application generation.
• Software Development, types of programming language, programming techniques.
• Networks, web technologies, cyber security, computer related legislation, ethical, moral and cultural issues.
• Computational thinking, thinking Abstractly, thinking ahead, thinking procedurally, thinking concurrently.
• Data Structures and Algorithms, Advanced Algorithms and data representation - A*algorithm, Dijkstra’s algorithm.
• Data representation, binary trees, reverse polish notation, sign and magnitude, twos compliment.
• Boolean Algebra- Flip Flop circuits, full adders, karnaugh maps, simplifying Boolean algebraic expressions.

Year 13

• Programming project- Software Development, types of programming language, programming techniques, Computational methods.
• Revisiting with Diagnosis, Therapy, Retes.
• Data Representation, sign and magnitude, twos compliment, negative float point binary conversion, hexadecimal, data types, data structures, databases, stacks and queues, Compression, encryption and hashing.
• Boolean Algebra- logic gate circuits, truth tables, Karnaugh maps, simplifying Boolean algebraic expressions.
• Structure and function of the processor, types of processor, Input, output and storage.
• Operating Systems software, application generation.
• Software Development, types of programming language, programming techniques
• Networks, web technologies, cyber security, computer related legislation, ethical, moral and cultural issues.
• Computational thinking, thinking Abstractly, thinking ahead, thinking procedurally, thinking concurrently.
• Data Structures and Algorithms, Advanced Algorithms and data representation - A* algorithm, Dijkstra’s algorithm.
• Data representation, binary trees, reverse polish notation, sign and magnitude, twos compliment.
• Boolean Algebra- Flip Flop circuits, full adders, karnaugh maps, simplifying Boolean algebraic expressions.

How will it be delivered and assessed?

The course is 80% externally assessed through two examinations, with the last 20% being covered by a course work piece that is marked internally and externally moderated.

Entry requirements

Grade 5 or above in Computer Science and Grade 6 in Mathematics

Your next steps...

https://www.ocr.org.uk/qualifications/as-and-a-level/computer-science-h046-h446-from-2015/


For more courses like this, check our courses page.