Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
25 Cards in this Set
- Front
- Back
Graph |
A mathematical structure that models the relationship between pairs of objects.
|
|
Uses of Graphs |
Transport Networks, where the stations departure and arrival points are nodes and the routes are the edges. The internet, where each devices is a vertex and the physical connection is an edge. |
|
Latency |
The time delay that occurs when transmitting data between devices.
|
|
Adjacency List |
A data Structure that stores a list of nodes with their adjacent nodes. |
|
Adjacency Matrix |
A data structure set up as a grid that shows whether there is an edge between each pair of nodes. |
|
Advantages of an Adjacency List: |
Good for graphs with fewer edges than nodes (a sparse graph) Only stores data where there is an adjacency edge so less memory is required. |
|
Advantages of an Adjacency Matrix: |
Good for graphs with more edges than nodes (a dense graph) Adjacencies can be identified more quickly as every combination is already stored |
|
Tree |
A connected, undirected graph with no cycles. |
|
Root |
The starting node in a rooted tree structure from which all other nodes branch off. |
|
Parent |
A type of node in a tree where there are further nodes below it. |
|
Child |
A node in a tree that has nodes above it. |
|
Leaf |
A node that has no other nodes beneath it. |
|
Binary Tree |
A tree where each node has a maximum of two child nodes attached to it. |
|
Hash Table |
A data structure that stores key/value pairs based on an index calculated from an algorithm. |
|
Hashing Algorithm |
Carried out on the key, which then acts as an index to the specific location of that data item within the table. |
|
Uses of hashing algorithms: |
Used to created indices for databases enabling quick storage and retrieval of data. Used to generate memory addresses where data will be stored Calculate a checksum value from a set of data that is going to be transmitted. When the data is received the algorithm is run again to see if the data was corrupted during transmission. |
|
Collisions |
When a hashing algorithm produces the same index for two ore more different keys. |
|
Rehashing |
The hashing algorithm is run again, or an alternative algorithm is run until a unique key is created. |
|
Chaining |
The colliding key/value is added to a list stored at the same index. |
|
Dictionary |
A data structure that maps keys to data. |
|
Associative array |
A two dimensional structure containing key/value pairs of data (for example, a dictionary). |
|
Clustering |
when a hashing algorithm produces indices that are not randomly distributed.
|
|
Load factor |
The number of keys divided by the number of slots. The higher the load factor, the harder it is for the algorithm to produce a unique result |
|
Convex Combination |
A method of multiplying two vectors together that produces a resulting vector within the convex hull. |
|
Convex Hull |
The area confined by two vectors. |