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.:

Year 1

Fundamentals of programming

Pseudo Code -

Constants - Variables - Data Types -

Selection -

Repetition - Iteration -

Operators -

Subroutines - Functions -

Parameters - Global Variables -

Text Files -

Binary Files -

Handling Exceptions -

Fundamentals of data structures

Data Structures

Arrays -

Records

Fundamentals of algorithms

Structured Programming - Needs Quiz

Algorithms - Needs Quiz

Linear Search -

Binary Search -

Bubble Sort -

Theory of computation

Computational Thinking - Needs Quiz

Abstraction - Automation -

Finite State Machines -

Year 2

Fundamentals of programming

Programming Paradigms -

Object Orientated Programming -

Recursion -

Fundamentals of data structures

Dynamic vs Static -

Linked Lists - Lists - Needs Quiz

Stacks -

Queues -

Graphs -

Trees -

Dictionaries -

Hashing -

Vectors -

Fundamentals of algorithms

Merge Sort -

Shortest Path -

Traversals

Graph Traversals -

Tree Traversals -

Reverse Polish -

Theory of computation

Turing Machines -

BNF - Syntax Diagrams -

Regular Expressions -

Comparing Algorithms - Big O -

Intractable Problems -