Section A AL

From AQA Computer Science
Jump to: navigation, search

Introduction

You are advised to spend no more than 45 minutes on this section. Questions will examine the specification content not specific to the Preliminary Material.

This section covers short answer theory questions on the topics within unit 1 from both year 1 and 2.:

Fundamentals of programming

Year 1

Pseudo Code - Incomplete

Constants - Variables - Data Types - Incomplete

Selection - Incomplete

Repetition - Iteration - Incomplete

Operators - Incomplete

Subroutines - Functions - Incomplete

Parameters - Global Variables - Incomplete

Text Files - Incomplete

Binary Files - Incomplete

Handling Exceptions - Incomplete

Year 2

Programming Paradigms - Incomplete

Object Orientated Programming - Incomplete

Recursion - Incomplete

Fundamentals of data structures

Year 1

Data Structures - Incomplete

Arrays - Incomplete

Records - Incomplete

Year 2

Dynamic vs Static - Incomplete

Abstract Data Structures - Incomplete

Linked Lists - Lists - Incomplete

Stacks - Incomplete

Queues - Incomplete

Graphs - Incomplete

Trees - Incomplete

Dictionaries - Incomplete

Hashing - Incomplete

Vectors - Incomplete

Fundamentals of algorithms

Year 1

Structured Programming - Incomplete

Algorithms - Incomplete Needs Quiz

Linear Search - Incomplete

Binary Search - Incomplete

Bubble Sort - Incomplete

Year 2

Merge Sort - Incomplete

Shortest Path - Incomplete

Graph Traversals - Incomplete

Tree Traversals - Incomplete

Reverse Polish - Incomplete

Theory of computation

Year 1

Computational Thinking - Incomplete

Abstraction - Automation - Incomplete

Finite State Machines - Incomplete

Year 2

Turing Machines - Incomplete

BNF - Syntax Diagrams - Incomplete

Regular Expressions - Incomplete

Maths for Regular Expressions - Incomplete

Comparing Algorithms - Big O - Incomplete

Intractable Problems - Incomplete