Be able to describe and apply the following 4.2.3 4.2.3.1 operations: push Stacks pop Stacks peek or top test for empty stack test for full Be of a graph as a data structure used to 4.2.4 4.2.4.1 represent more complex relationships Be familiar with typical uses for graphs Graphs Graphs Be able to explain the terms: graph weighted graph vertex/node edge/arc undirected graph directed graph Know how an adjacency matrix and an adjacency list may be used to represent a Be able to compare the use of adjacency matrices and adjacency lists Know that a tree is a connected, undirected graph 4.2.5 binary 4.2.5.1 with no cycles Know that a rooted tree is a tree in which one Trees trees) Trees vertex has been designated as the root. A rooted tree has parent-child relationships between (including nodes. The root is the only node with no parent and all other nodes are descendants of the root Know that a binary tree is a rooted tree in which each node has at most two children Be familiar with typical uses for rooted trees Be familiar with the concept of a hash and its tables 4.2.6 tables 4.2.6.1 uses Be able to apply simple hashing algorithms Hash Hash Know what is by a collision and how collisions are handled using rehashing Be familiar with the concept of a dictionary Dictionaries 4.2.7 Dictionaries 4.2.7.1 Be familiar with simple applications of dictionaries, for example information retrieval, and have experience of using a dictionary data structure in a programming language Be familiar with the concept of a vector and the 4.2.8 4.2.8.1 following notations for specifying a vector: [2.0, -1.0, 2.718281828] Vectors 4-vector over written as Vectors ℝ ℝ4 function interpretation 0 2.0 ↦ 1 3.14159 ↦ 2 -1.0 ↦ 3 2.718281828 ↦ means maps to ↦ That all the entries must be drawn from the same
4.2.3 Stacks 4.2.3.1 Stacks Be able to describe and apply the following operations: push pop peek or top test for empty stack test for full 4.2.4 Graphs 4.2.4.1 Graphs Be of a graph as a data structure used to represent more complex relationships Be familiar with typical uses for graphs Be able to explain the terms: graph weighted graph vertex/node edge/arc undirected graph directed graph Know how an adjacency matrix and an adjacency list may be used to represent a Be able to compare the use of adjacency matrices and adjacency lists 4.2.5 Trees 4.2.5.1 Trees (including binary trees) Know that a tree is a connected, undirected graph with no cycles Know that a rooted tree is a tree in which one vertex has been designated as the root. A rooted tree has parent-child relationships between nodes. The root is the only node with no parent and all other nodes are descendants of the root Know that a binary tree is a rooted tree in which each node has at most two children Be familiar with typical uses for rooted trees 4.2.6 Hash tables 4.2.6.1 Hash tables Be familiar with the concept of a hash and its uses Be able to apply simple hashing algorithms Know what is by a collision and how collisions are handled using rehashing 4.2.7 Dictionaries 4.2.7.1 Dictionaries Be familiar with the concept of a dictionary Be familiar with simple applications of dictionaries, for example information retrieval, and have experience of using a dictionary data structure in a programming language 4.2.8 Vectors 4.2.8.1 Vectors Be familiar with the concept of a vector and the following notations for specifying a vector: [2.0, -1.0, 2.718281828] 4-vector over ℝ written as ℝ4 function interpretation 0 ↦ 2.0 1 ↦ 3.14159 2 ↦ -1.0 3 ↦ 2.718281828 ↦ means maps to That all the entries must be drawn from the same
AQA-A-Level-Computer-Science-7517-PLC.docx