Section A AL

From TRCCompSci - AQA Computer Science
Revision as of 11:34, 11 June 2018 by Admin (talk | contribs) (Fundamentals of algorithms)
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. The year 1 topics are here:

Fundamentals of programming

Object Orientated Programming - Incomplete

Recursion - Incomplete

Fundamentals of data structures

Dynamic vs Static - Incomplete

Linked Lists - Lists - Incomplete Needs Quiz

Stacks - Incomplete

Queues - Incomplete

Graphs - Incomplete

Trees - Incomplete

Dictionaries - Incomplete

Hashing - Incomplete Needs Quiz

Vectors - Incomplete

Fundamentals of algorithms

Merge Sort - Incomplete

Shortest Path - Incomplete

Traversals

Graph Traversals - Incomplete Needs Quiz

Tree Traversals - Incomplete

Reverse Polish - Incomplete

Theory of computation

Turing Machines - Incomplete

BNF - Syntax Diagrams - Incomplete

Regular Expressions - Incomplete

Comparing Algorithms - Big O - Incomplete

Intractable Problems - Incomplete