Know that procedural decomposition means Decomposition 4.4.1.9 breaking a problem into a number of so that each sub-problem accomplishes an identifiable task, which might itself be further subdivided Know how to build a composition abstraction Composition 4.4.1.10 by combining procedures to form compound procedures Know how to data abstractions by combining data objects to form compound data, for example tree data structure Understand that automation requires putting 4.4.1.11 models (abstraction of real world objects/ phenomena) into action to solve problems. This is achieved by: Automation creating algorithms implementing the algorithms in program code (instructions) implementing the models in data structures executing the code Be able to draw and interpret simple 4.4.2 output with machines 4.4.2.1 transition diagrams and state transition tables for FSMs with no output and with output (Mealy and Regular Finite machines only) without (FSMs) state languages Be familiar with the concept of a set and the 4.4.2.2 following notations for specifying a set: A = {1, 2, 3, 4, 5 } or set comprehension: Maths A = {x | x x 1 } ∈ ℕ ∧ ≥ where A is the set consisting of those objects x for such that x and x 1 is true. ∈ ℕ ≥ regular Know that the empty set, {}, is the set with no elements. Know that an alternative symbol for the set is expressions Ø Be familiar with the compact representation of a set, for example, the set {0n1n | n 1}. This set ≥ contains all strings with an equal number of 0 s and 1s Be familiar with the concept of: finite sets infinite sets countably infinite sets cardinality of a finite set Cartesian product of sets
4.4.1.9 Decomposition Know that procedural decomposition means breaking a problem into a number of so that each sub-problem accomplishes an identifiable task, which might itself be further subdivided 4.4.1.10 Composition Know how to build a composition abstraction by combining procedures to form compound procedures Know how to data abstractions by combining data objects to form compound data, for example tree data structure 4.4.1.11 Automation Understand that automation requires putting models (abstraction of real world objects/ phenomena) into action to solve problems. This is achieved by: creating algorithms implementing the algorithms in program code (instructions) implementing the models in data structures executing the code 4.4.2 Regular languages 4.4.2.1 Finite state machines (FSMs) with and without output Be able to draw and interpret simple transition diagrams and state transition tables for FSMs with no output and with output (Mealy machines only) 4.4.2.2 Maths for regular expressions Be familiar with the concept of a set and the following notations for specifying a set: A = {1, 2, 3, 4, 5 } or set comprehension: A = {x | x ∈ ℕ ∧ x ≥ 1 } where A is the set consisting of those objects x such that x ∈ ℕ and x ≥ 1 is true. Know that the empty set, {}, is the set with no elements. Know that an alternative symbol for the set is Ø Be familiar with the compact representation of a set, for example, the set {0n1n | n ≥ 1}. This set contains all strings with an equal number of 0 s and 1s Be familiar with the concept of: finite sets infinite sets countably infinite sets cardinality of a finite set Cartesian product of sets
AQA-A-Level-Computer-Science-7517-PLC.docx