Fill in the blanks with the correct words. Click "Check Answer" to see if you're right!
Term: Abstraction
Definition:
Makes solving easier by including only the necessary details the unnecessary details
No attempts
Term: Algorithmic thinking
Definition:
Makes problem solving easier by identifying the needed to a problem.
No attempts
Term: Decomposition
Definition:
Makes problem solving easier by a problem down into smaller . By solving each of the sub-problems the overall problem is solved.
No attempts
Term: Algorithm
Definition:
A of to perform a particular task.
No attempts
Term: Flowchart
Definition:
a visual method of designing . Uses .
No attempts
Term: Trace table
Definition:
Writing down the of a variable each time it changes in a table to find errors in a program.
No attempts
Term: Binary search
Definition:
Search algorithm that calculates item and compares that with the search term. If found then discards either the or lower half of the array and repeats until found or no more items to check.
No attempts
Term: Bubble sort
Definition:
Inefficient but sort algorithm. Repeatedly steps through a data set comparing each pair of items swaps pairs of items if they are in the wrong order. Stops when swaps are made
No attempts
Term: Insertion sort
Definition:
Sort algorithm that divides the list into and partitions. Remove the first item from the unsorted partition and place it in the correct place in the sorted partition. until no more items in the unsorted partition.
No attempts
Term: Linear search
Definition:
Search algorithm that starts at index 0 and examines data item in turn until the item is found or the of the list is reached.
No attempts
Term: Merge sort
Definition:
An sort algorithm. A list is repeatedly into smaller lists eventually containing just one item.
each element is compared with the adjacent list and back together from two lists into one