ECS Unit 2: Problem Solving

is 00101 shown as a decimal number

• 3

• 4

• 5

• 6

is 3 shown as a binary number.

• 00011

• 01001

• 11001

• 11111

is 16 shown as a binary number.

• 10000

• 01000

• 00100

• 00001

in programming means repeating steps, or instructions, over and over again. This allows algorithms to be simplified by stating that certain steps will repeat until told otherwise. This makes designing algorithms quicker and simpler because they don’t need to include lots of unnecessary steps.

• algorithm

• iterating

• variable

• abstracting

Kilobyte

• 1,000,000 bytes

• 10,000 bytes

• 1000 bytes

• 10 bytes

1,000,000 bytes

• Bit

• Gigabyte

• Megabyte

• Kilobyte

is a search is used to find an item in a list. The items do not have to be in order. To search for an item, start at the beginning of the list and continue searching until either the end of the list is reached or the item is found.

• Linear Search

• Meta Search

• Binary Search

• Bubble Sort

a sorting algorithm that works by repeatedly stepping through lists that need to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. This passing procedure is repeated until no swaps are required, indicating that the list is sorted.

• Linear Search

• Binary Search

• Bubble Sort

• Meta Search

an efficient algorithm for finding an item from an ordered list of items. It works by repeatedly dividing in half the portion of the list that could contain the item, until you've narrowed down the possible locations to just one. Works with an ORDERED list.

• Linear Search

• Binary Search

• Bubble Sort

• Meta Search

a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. We created one when we solved the Muddy City problem.

• Histogram

• Minimal Spanning Tree

• Bar Graph

• Pie Chart