Section A AL

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 -

Constants - Variables - Data Types -

Selection -

Repetition - Iteration -

Operators -

Subroutines - Functions -

Parameters - Global Variables -

Text Files -

Binary Files -

Handling Exceptions -

Year 2

Programming Paradigms -

Object Orientated Programming -

Recursion -

Fundamentals of data structures

Year 1

Data Structures -

Arrays -

Records -

Year 2

Dynamic vs Static -

Abstract Data Structures -

Linked Lists - Lists -

Stacks -

Queues -

Graphs -

Trees -

Dictionaries -

Hashing -

Vectors -

Fundamentals of algorithms

Year 1

Structured Programming -

Algorithms -

Linear Search -

Binary Search -

Bubble Sort -

Year 2

Merge Sort -

Shortest Path -

Graph Traversals -

Tree Traversals -

Reverse Polish -

Theory of computation

Year 1

Computational Thinking -

Abstraction - Automation -

Finite State Machines -

Year 2

Turing Machines -

BNF - Syntax Diagrams -

Regular Expressions -

Maths for Regular Expressions -

Comparing Algorithms - Big O -

Intractable Problems -