Karteikarten
Computing A-Level Chapter 9
Karten in diesem Stapel (18)
- 1Grapha mathematical structure that models the relationship between pairs of objects
- 2Graph Theorythe underlying mathematical principles behind the use of graphs
- 3Arca join or relationship between 2 nodes - also known as an edge
- 4Vertex/verticesan object in a graph - also known as a node
- 5Weighted grapha graph that has a data value labelled on each edge
- 6Undirected grapha graph where the relationship between vertices is two-way
- 7Directed grapha graph where the relationship between vertices is one-way
- 8Latencythe time delay that occurs when transmitting data between devices
- 9Adjacency Lista data structure that stores a list of nodes with their adjacent nodes
- 10Adjacency Matrixa data structure set up as a two-dimensional array or grid that shows whether there is an edge between each pair of nodes
- 11Treea data structure similar to a graph, with no loops
- 12Nodean object in a graph - also known as a vertex
- 13Edgea join of relationship between nodes - also known as an arc
- 14Rootthe starting node in a rooted tree structure from which all the other nodes branch off
- 15Parenta type of node in a tree, where there are further nodes below
- 16Childa node in a tree that has nodes above it in the hierarchy
- 17Leafa node that does not have any other nodes beneath it
- 18Binary Treea tree where each node can only have up to 2 child nodes attached to it
Informationen
- Beschreibung
- A level Computing Karteikarten am Computing A-Level Chapter 9, erstellt von Sam Carvell am 18/05/2018.
- Erstellt von
- Sam Carvell
- Aufrufe
- 0
- Bewertung