Programming code identifies Raise as expert programmers

What we offer

Our Preparing To Teach Programme (ITT Provision)

Part one duration:

As a teacher training provider, part one of our provision is through a hybrid programme of in person workshops and pre-recorded webinars and interactive tasks. This programme enables graduates to master the knowledge and skills required to deliver high quality teaching and learning based on how learning happens; using research informed pedagogy.. Behaviour management, safeguarding, planning and assessment aspects are also covered to support graduates whilst they are in schools.

Part two duration:

Graduates undertake a PGCE with a university and continue to work in a salaried role with a school to obtain QTS.

Subject Knowledge Enhancement Courses: New Pathway Programme

This course will transform your career, enabling teachers to deliver computer science at key stage 3, 4, and 5 . Dedicated subject specialist providing deep computational knowledge and skills through a hybrid programme of online and face to face person provision. High-quality schemes of learning come with this package for all secondary years, teachers taking this course are able to select topics from lessons which have been planned based on how learning happens.

*Government bursary funding maybe available, for more information visit

https://getintoteaching.education.gov.uk/

8 weeks £1200

12 weeks £1800

16 weeks £2400

* Component content shared below is not an exhaustive list and will be dependent on duration of the pathway chosen.

Component one:

Logic gates and truth tables

Binary to hexadecimal

Denary to Binary

Binary to Denary

Binary addition

Binary subtraction

Trace tables

Mantissa and exponent

Two’s compliment

DeMorgan’s laws

Calculating available IP Address

Karnaugh maps

Component two:

Programming concepts

Object Oriented theory

Java programming skills

Python programming skills

Databases

SQL, PL/SQL

Component three:

Von Neumann Architecture

Harvard Architecture

Computer Performance

Fetch, Decode, Interrupt, Execute

Recursion

Tree traversal algorithm (including Depth first, Breadth-first, In, Pre and Post order)

Graph traversal (including Dijkstra’s Algorithm, A star)

Vectors (including calculating dot product)

Sorting algorithms (including Quick, Insertion, Bubble, Merge)

Searching Algorithms

Big O notation

Networks

Backus Naur Form

Teaching and learning packages:

Lesson resources for A level and GCSE computer science courses, suitable for all examination boards.