Flashcards
2.1
Flashcards do conjunto (18)
- 1Computational ThinkingTakes a complex problem, allow us to understand what the problem is and even find a solution
- 2AbstractionIt is where you remove unnecessary details and focus / include the relevant detail
- 3DecompositionBreaking down complex problems into more simpler, manageable parts
- 4Algorithmic ThinkingAllow us to set step by step rules on how to sort a problem
- 5Problem inputsYou put in a problem to solve
- 6Problem processesThe problem is getting processed by the computer so it can find any errors or solution
- 7Problem OutputThe result from being processed of the problem
- 8Structure DiagramHow things are going to be set up/planned out to solve a problem
- 9PseudocodeCoding to be able to output a result of a certain task/ problem
- 10FlowchartA step by step diagram of how to solve a task.
- 11Trace TableTechnique used to test algorithms to show if there is any errors
- 12Searching AlgorithmsA step by step process of finding specific data
- 13Linear Search(A searching Algorithm) - Easy to use BUT time consuming!
Starts as position 0, compares the search value to the current value IF it matches, then return location. IF it doesn't, it moves to the next value and repeats. - 14Binary Search(A searching algorithm) - Quicker BUT more complicated.
HAS to be IN ORDER! Examines the range of the items, determines the range using UB, LB AND MP. Sub - divides the list. Continues to search the relevant half until found. - 15Sorting AlgorithmArranging Items into a required order. Can be ascending or descending
- 16Bubble Sort(SORTING ALGORITHM) - Slow + inefficient. Not to be used on large data set (50+). Uses an incremental approach - (Sorts one item each pass).
Takes the first value and see if it's greater than the next value. Take the second value and see if it's greater than the next etc. - 17Insertion Sort(SORTING ALGORITHM) - Quicker than Bubble Sort. Can be used on large data set.
Check if a value is greater IF not puts it in the right place . IF it is moves it further up the list. - 18Merge Sort(SORTING ALGORITHM) - Quicker than Bubble Sort. Can be used in large data set.
Divide the list in half. From the first half divide again and put the numbers in order. Repeat these steps with the second half afterwards put the list back together and put them in order
Informações
- Descrição
- FlashCards sobre 2.1, criado por Samiha Haque em 03-02-2021.
- Criado por
- Samiha Haque
- Visualizações
- 0
- Avaliação