Flashcards
Algorithms revision
Cards in this deck (13)
- 1What is abstractionRemoving unnecessary detail
- 2What is decompositionBreaking one large problem down into multiple smaller and simpler problems
- 3Why is linear searching normally inefficient for large data setsIt starts at the first item and checks every one, taking a long time
- 4When is a linear search more efficient than a binary searchfor an item at the start of a list
- 5how does a bubble sort differ from an insertion sort1) A bubble sort takes multiple passes whereas an insertion sort does it in one
2) In a bubble sort the highest number bubbles to the top being swapped with everything whereas in an insertion sort each number is immediately inserted into the correct place - 6what happens to an item without a pair in a merge sortit is only added at the final stage of sorting.
- 7what is an algorithma series of instructions that if followed correctly have a predictable outcome
- 8what is pseudocodepseudocode is halfway between English and any programming language
- 9what is a flowcharta chart that shows the series of instructions to be followed
- 10what shape is used for a decision in a flowcharta rhombus
- 11what does a rectangle represent in a flowcharta process
- 12what shape is used to represent an input in a flowcharta parallelogram
- 13—
Information
- Description
- Flashcards on Algorithms revision, created by Jay Biddle on 12/03/2019.
- Created by
- Jay Biddle
- Views
- 0
- Rating