Fichas
Algorithim SFA
Fichas del conjunto (29)
- 1IterationA single pass through step(s) that are repeated.
- 2LoopThe ability to repeat steps.
- 3ConditionThe ability to ask a question to see if something is true or false.
- 4Pseudo codeFake code or code that looks more like plain English.
- 5Flow chartA visuals structure showing different steps and their order.
- 6VariableA piece of memory used to remember a value.
- 7CircleStart/End
- 8DiamondCondition
- 9RectangleIndividual instruction or step
- 10ArrowDirection or order of steps to follow
- 11What hardware component is most directly controlled by an algorithm?CPU
- 12Think about the 5 characteristics of a good algorithm, which of the following is true about their completion time?They are finite.
- 13Think about the 5 characteristics of a good algorithm, which of the following is true about their steps?They are always made up of concise instructions or steps.
- 14Think about the 5 characteristics of a good algorithm, which of the following is true about their steps?0 or more
- 15Think about the 5 characteristics of a good algorithm, how many outputs can it have?1 or more
- 16Think about the 5 characteristics of a good algorithm, what is true about the final results?The result is effective.
- 17What is a flowchart?A visuals diagram showing different steps and their order.
- 18A binary search algorithm can be best described as what?A divide and conquer technique
- 19Binary search is highly efficient compared to linear search when dealing with:Large, sorted data sets
- 20What are the correct intermediate steps of the following data set when it is being sorted with the bubble sort? 15,20,10,18None of these
- 21In a BUBBLE sort structure, there is/are?Two loops, one nested in the other
- 22In a flowchart a diamond hasone entry symbol and two exit symbols
- 23In a selection sort structure, there is/are?Two for loops, one nested in the other
- 24Which one of the following happens first in a selection sort algorithm?The minimum value in the list is found
- 25What are the correct intermediate steps(passes) of the following data set when it is being sorted with the SELECTION sort? 15,20,10,1810, 20,15,18 -- 10,15,20,18 -- 10,15,18,20
- 26Using binary search, what is the cost(number of card flips), to locate the number 36 in the following data set: 1, 2, 3, 5, 5, 7, 10, 36, 503
- 27Using binary search, what is the cost(number of card flips), to locate the number 36 in the following data set: 1, 2, 3, 5, 5, 7, 10, 36, 508
- 28A data set needs to be sorted in Binary Search and not in Linear SearchTrue
- 29In the Linear Search algorithm you ask if the current card matches the target. In a Binary Search algorithm you ask if the current card matches the target, you might also ask if the current card is less than or greater than the target.True