1️⃣ Decision vs Optimization

A. Is there a path from your house to school?

A B

B. What is the shortest path from your house to school?

A B

C. Can all classes fit into a weekly schedule without overlap?

A B

D. Minimize total travel time for deliveries to 10 cities.

A B

Type A or B for each question below
A.
B.
C.
D. 

2️⃣ Algorithm Efficiency Table

Input Size (n)	Algorithm X Steps	Algorithm Y Steps	Algorithm Z Steps
1	3	2	1
2	6	4	2
3	9	8	6
4	12	16	24
5	15	32	120

```python Type the growth types for each algorithim below: Algorithm X: Algorithm Y: Algorithm Z: Which is most reasonable for large n? ```

3️⃣ Algorithm A (grows by 3ⁿ)

Input Size (n)	Steps
1	3
2
3
4
5

```python Type the following steps that belong in the blank boxes below: What is the efficency type? Is this algorithm reasonable for large input sizes? Type yes or no. ```

4️⃣ Counting Steps

Compares every pair of items in a list of size n.

1) Steps for n=4:

A. 4 B. 8 C. 16 D. 24

2) Efficiency type:

A. O(n) B. O(n²) C. O(2ⁿ) D. O(n!)

3) Reasonable for very large lists?

A. Yes B. No

```python Types the letter corresponding to the correct answer for each question below: 1. 2. 3. ```

5️⃣ Heuristic Scenario

Scenario: A city wants to design bus routes covering all neighborhoods. There are hundreds of possible routes, and finding the perfect shortest set is too complex.

1) Explain one heuristic approach the city could use:

2) Why might this heuristic not give the optimal solution?

```python Type your free response to the questions below: 1. 2. ```

6️⃣ Algorithm B

Input Size (n)	Steps
1	2
2	4
3	8
4	?
5	?

Efficiency type:

A. Linear
B. Quadratic
C. Exponential
D. Factorial

Reasonable for large n?

A. Yes
B. No

```python Type the letter corresponding to the correct answer below: Efficency type: Reasonable for large n? ```

7️⃣ TSP Heuristic

Scenario: A city wants to design bus routes covering all neighborhoods. There are hundreds of possible routes, and finding the perfect shortest set is too complex.

Select the approach the city could use:

A. Check all 120 possible routes
B. Always go to nearest unvisited city
C. Randomly choose cities and hope for shortest path
D. List routes alphabetically

```python Type the letter corresponding to the correct answer choice below: ```

8️⃣ Efficiency Ranking

n	Algorithm P	Algorithm Q	Algorithm R
1	1	1	2
2	2	4	4
3	3	9	8
4	4	16	16
5	5	25	32

```python Rank each algorithm from most -> least efficent below: ```