AP-CSP - November 24th

AP-CSP - November 24th

Algorithm Efficiency &

Heuristics

Algorithms - Unreasonable Time

Lesson 3

In the next video think about ...

• What are the the differences between problems that run in a reasonable time and those that do not ?

• What are ways we can describe the efficiency of an algorithm?

Multiple Choice

Which line best represents the time complexity n!

• Orange

• Blue

• Green

• Red

• Pink

Multiple Choice

The O (n!) is so inefficient, there is no practical use for it

• True

• False

Multiple Choice

Which notation is consistent for every execution?

• O (n)

• O (n^2)

• O (1)

• O (2^n)

Multiple Choice

Which notation grows in proportion to the size of the input

• O (n)

• O (n^2)

• O (1)

• O (2^n)

Limits of Algorithms

Lesson 4

Objectives

• Determine if an algorithm runs in unreasonable time.

• Develop a heuristic to solve a problem.

• Distinguish between decision problems and optimization problems.

• Explain the existence of undecidable problems

Goto Canvas...

• Find Unit 6 - Lesson 4 Assignment

• Make a copy of the activity guide

• Watch the video

• Submit the activity guide to canvas.

Lesson wrapup

Please look over the slide deck posted on canvas for Unit 6. Browse through Lesson 3 and 4. Make note of the key takeaways and definitions. Take notes on any definitions you come across....

that is all! have a great tgiving break!

Lesson wrapup

Please look over the slide deck posted on