Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
ECS-PS
Problem Solving Unit Vocabulary
| Term | Definition |
|---|---|
| Problem Solving Process | Define, Prepare, Try, Reflect |
| Computational Thinking | A method of problem solving that involves analyzing and breaking down problems into smaller, more manageable problems. |
| Binary | A method of representing data in which only the digits 0 and 1 are used. |
| Code | A collection of computer instructions written using human compatible computer language. |
| Metadata | A set of data that describes and gives information about other data. |
| Algorithm | A process, formula, or set of rules to be followed in calculations or other problem-solving operations, especially by a computer. |
| Sort | The criteria that identifies how to organize data |
| Order | The arrangement of data in a prescribed sequence (set order). |
| Selection Sort | Sort by find the biggest element, put first in the resulting list, find the second biggest element, put next in the resulting list, etc.... |
| Insertion Sort | Sort by taking the first element, put it in the list. Take the next element and insert it into the right place in the list. Continue for every element from the original batch. |
| Bubble Sort | Sort by comparin two elements that are side by side. Swap the items with the larger element to the right. Repeat until all the elements are sorted. |
| Bucket Sort | Sort elements into different collections. Categories are set up at the start of the sort and are 'filled' with the relevant elements . This is a good sorting algorithm if there are duplicates. |
| Merge Sort | Sort by splitting all the elements into smaller groups, sort each group, then merge the sorted groups. |
| Linear Search | An algorithm method for finding a particular value in a list (sequential search). Checks every element, one at a time and in sequence (sorted or unsorted), until the desired result is found. |
| Binary Search | An algorithm method for finding the position of a specified value within a sorted list (array). Compares the search value with the key value of the middle of the array. |
| Dijkstra's Algorithm | A search algorithm that finds the shortest distance between two or more items, vertexes, or nodes. This creates a "minimal spanning tree" or "shortest path". |
Created by:
TheMsAllsop
Popular Computers sets