Flashcards
Data Structures 2 definitions page
Flashcards do conjunto (27)
- 1ArrayAn ordered group of items, each of the same data type. The number of items is fixed in size. Each item is identified by a subscript.
- 2Binary SearchA search on an ordered list where the middle item is inspected, if it does not match half the list is discarded. This process is repeated.
- 3Binary Sort TreeA binary tree where all the values in the left of any sub tree are smaller than the value in the node AND all the values in the right sub tree are larger in value than the node.
- 4Binary TreeA n tree where no node has more than two children.
- 5BranchA path joining part of the tree.
- 6Bubble SortA simple sort routine that compares successive values, exchanging them if necessary. Repeating the process until the values are sorted.
- 7ChildNode in a tree connected to and immediately below a given node.
- 8Data StructureA group of related data items that can be referred to individually or all together.
- 9Dynamic Data StructureA data structure that expands and contracts as data is added or removed.
- 10Insertion SortA sort that finds the highest value and swaps it with the item at the top of the list. Repeating this process with the second highest value etc.
- 11Linear SearchA search where each record is examined in turn until the required record is found or the end of the list is reached.
- 12Linked ListDynamic data structure operating on the principle of each item being linked to the next by a pointer. It is more versatile than a stack or a queue since data may be added and removed in any order.
- 13NodeA place where data is stored. Connected to other nodes by branches.
- 14ParentA node in a tree immediately above a given node.
- 15PointerA reference to a storage location,an address.
- 16PullRemoving an item from a stack.
- 17PushAdding an item to a stack.
- 18QueueA dynamic data structure operating on the principle of first in first out. When an item is removed it is always the item which has been in the queue the longest.
- 19Quick SortA sort that chooses a (pivotal) value then splits the list into values above and below the pivotal value. The two halves are then sorted recursively.
- 20RecordA data structure that holds number of related values (possibly of different data types), normally about one object.
- 21RootThe very top of the tree.
- 22Static Data StructureA data structure that is fixed in size, such as an array.
- 23SubtreeFrom any node the branches beneath it for a tree, since they have a tree structure and are part of a larger tree they are called sub trees.
- 24SwappingThe process of exchanging the contents of two storage locations.
- 25Terminal NodeA final node which has no branches beneath it.
- 26TraverseThe process of visiting in turn each element in a data structure.
- 27TreeA dynamic data structure organised as a series of layers. Each node is linked to exactly one element in the layer above and any number in the layer below.
Informações
- Descrição
- A-Level Computing FlashCards sobre Data Structures 2 definitions page, criado por elliot9678 em 03-04-2016.
- Criado por
- elliot9678
- Visualizações
- 0
- Avaliação