Fichas
Decision 1
Fichas del conjunto (17)
- 1Bubble SortCompare adjacent values and if they are not in order swap them
- 2Shuttle SortInitially compare 1st and 2nd values, then 1st, 2nd and 3rd and so on
- 3Quick SortUse the 1st term as a pivot, any numbers that are less go to the left, and any that a more go to the right
- 4ShellDivide into n/2 sublists, then order these and merge them. Continue ad finally shuttle sort
- 5Node/VertexUsually represent places
- 6Edgeoften represent roads
- 7Degree/orderThe number of edges at a vertex
- 8Connected graphYou can get from one node to any other but not necessarily directly
- 9Complete graphDirect route between any node
- 10Hamilton CycleRoute that visits every vertex once, starting and finishing at the same one, but nor every edge
- 11EulerianEvery edge must be visited, so the order of all vertices is even
- 12Prims Algoritm for graph(Point to Point) Smallest edge connected to the start vertex
- 13Prims Algorithm for MatrixLabel the start column and delete the corresponding row, and circle the smallest number in that row
- 14KruskalsSmallest edge overall, then highlight the next smallest
- 15DijkstrasWork out the value of each route and put the smallest into boxes
- 16Chinese PostmanFind the shortest route between the odd vertices. This can then be used twice
- 17Travelling salesmanUpper bound; nearest neighbour
Lower bound; delete a vertex or column and use prims/kruskals
Información
- Descripción
- A2 level Maths Flashcards on Decision need to know, created by Erifwa on 04/18/2016.
- Creado por
- Marika Rutlin
- Visitas
- 21
- Etiquetas
- Valoración