Karteikarten
Computing A-Level Chapter 12
Karten in diesem Stapel (15)
- 1Implementationcreating code to produce a programmed solution
- 2Arraya set of data items of the same type grouped together with the same identifier
- 3Edgea connection between 2 nodes in a graph or tree structure
- 4Grapha data type made up of nodes and edges
- 5Depth Firsta method for traversing a graph that starts at a chosen node and explores as far as possible along each branch away from the starting node before backtracking
- 6Breadth Firsta method for traversing a graph that explores nodes closest to the starting node first before progressively exploring nodes that are further away
- 7Queuea data structure where the first item added is the first item removed
- 8Nodean element of a graph or tree
- 9Binary Treea structure where each node can only have up to 2 child nodes attached to it
- 10Pre-ordera method of traversing a tree by visiting the root, traversing the left subtree and traversing the right subtree
- 11In-ordera method of traversing a tree by traversing the left subtree, visiting the root node and traversing the right subtree
- 12Post-ordera method of traversing a tree by traversing the left subtree, traversing the right subtree and then visiting the root node
- 13TraversalThe process of reading data from a tree or graph by visiting all of the nodes
- 14Binary Searcha technique for searching data that works by splitting datasets in half repeatedly until the search data is found
- 15Recursiona technique where a function can call itself in order to complete a task
Informationen
- Beschreibung
- A level Computing Karteikarten am Computing A-Level Chapter 12, erstellt von Sam Carvell am 18/05/2018.
- Erstellt von
- Sam Carvell
- Aufrufe
- 1
- Bewertung