A graph of points that are all connected
A. Sort
B. Spanning Tree
C. Binary
D. Aggregate
What is B Spanning Tree
100
How many steps are there in the Problem Solving Process?
What is 4
100
Base 2 language - 0 and 1
What is Binary
100
How many "breaks" it will take to break the candy bar into 12 equal pieces. One break of one piece of the candy bar will result in that one piece being divided into two pieces.
What is the formula to solve this problem?
What is N - 1 /12 pieces of candy = 11 Breaks
100
Data that informs a discovery
What is discovery data
200
A set of directions for solving a problem
A. Aggregate
B. Sort
C. Binary
D. Algorithm
What is D Algorithm
200
Review and reflect on the situation
What is step 4
200
In what place value setting does a 1 represent 32 in a Binary Number.
What is the 100 Thousands place value, or in a 6 digit binary number the first place when reading from left to right.
200
Assume there are 50 people in a room, including you. You must shake hands with everyone else in the room. How many hands will you shake? If there are N (where N > 0) people in the room, how many hands will you shake?
What is 49 / N - 1
200
Searching by comparing each element with every other element
What is linear search
300
Data that has been processed
A. Information
B. Aggregate
C. Algorithm
D. Sort
What is Information
300
Carry out the plan / solution
What is Step 3 of the Problem Solving Process
300
Convert the following from Binary to Decimal
1001
What is 9
300
You need to build one side of a fence that is 12 yards long. This fence will be built with fence posts and rails that connect one fence post to another. If each fence post is 1 yard away from the next fence post, how many fence posts will be needed for this side of the fence? How many fence posts will be needed for a side of a fence that is N (where N > 0) yards long?
What is the Formula for this problem?
What is N+1 / 12 yards long = 13 fenceposts
300
The arrangement of data in a prescribed sequence
What is sort
400
A graph of points that are connected all together but with the fewest links
A. Binary Search
B. Linear Search
C. Information
D. Minimal Spanning Tree
What is D Minimal Spanning Tree
400
Step 1
What is Understanding the problem
400
0011^2 = 2^10
True or False
What is True
400
Assume there are N people in a room, including you. Each person in the room must shake hands one time, and only one time, with ALL the other people in the room. If there are N (where N> 0) How many TOTAL handshakes will occur?
Provide the Plan and the Solution
What is N-1 *N = Total
400
Raw facts entered into the computer, or collected
What is data
500
Continually dividing data in halves to search
A. Minimal Spanning Tree
B. Linear Search
C. Binary Search
D. Sort
What is C Binary Search
500
Make a plan to solve the problem
What is Step 2
500
What is the powers of two that are represented in sequence in binary?
What is 1, 2, 4, 8, 16, 32, 64, etc. Each number doubles every place value
500
Trying to find the shortest and most efficient route between all of your classes is best done by using a what.