AQA • Computer Science

This is a description of an automated theory course and its practical applications, including regular expressions, finite automata, and context-free grammars. An example of a finite automaton representing a game of tennis is provided. It also covers the concepts of languages, transition functions, and a simple protocol for sending data.

You are advised to spend no longer than 40 minutes on this section. Type your answers to Section A in your Electronic Answer Document. You must save this document at regular intervals. Big-O notation is used to express the time complexity of an algorithm. Table 1 contains a list of algorithms. State the Big-O time complexity of each of these algorithms. The first row has been completed for you. Table 1 Algorithm Time complexity Binary tree search O(log n) Bubble sort Linear s...

Describe how a 12-bit unsigned binary integer such as 110 can be converted directly into hexadecimal. The method you describe must not involve converting into decimal. [2 marks] . State one reason why hexadecimal is often used in preference to binary. [1 mark] . A data communications system uses parallel data transmission. Describe how parallel data transmission works. [2 marks] . State one advantage of serial data t...

All marks AO1 (knowledge) A. O(n x log n) NE. O(log n) I. missing brackets I. missing O Mark as follows: 1 mark: 1st row correct 1 mark: 2nd row correct 1 mark: 3rd row correct

AQA A-level COMPUTER SCIENCE 7517/1 Paper 1 Mark scheme June 2022 Version: 1.0 Final Mark schemes are prepared by the Lead Assessment Writer and considered, together with the relevant questions, by a panel of subject teachers. This mark scheme includes any amendments made at the standardisation events which all associates participate in and is the scheme which was used by them in this examination. The stan...

Summarised revision notes of the specification topics, helping students achieve top grades in exams.

Notes for the computer systems and architecture module of AQA A Level Computer Science. Information is summarised into bullet points and can be easily turned into flashcards. Condense notes with diagrams

The complete summary of the AQA AS level Computer Science specification Written by a Cambridge offer-holder and A*A*A* predicted student. Hand-drawn diagrams and detailing included. Programming, theory and ethics all within this document.

Level 3 Technical Level IT: CYBER SECURITY IT: NETWORKING IT: PROGRAMMING IT: USER SUPPORT Y/507/6424 Unit 1 Fundamental principles of computing Mark scheme June 2019 Version 1.0: Final *196AY/MS* Mark schemes are prepared by the Lead Assessment Writer and considered, together with the relevant questions, by a panel of subject teachers. This mark scheme includes any amendments made at the standardisation events which all asso...

Covers the following topics of the 'Fundamentals of Programming' in an accessible way: - Subroutines and their local/global variables -Exception handling -Object orientated concepts Created by a final year A-Level student with the aid of mark schemes so all information is accurate. Easy to understand and adapt to own needs if necessary