Want to create interactive content? It’s easy in Genially!

Get started free

APCSP Unit 6 Project

Start designing with a free template

Discover more than 1500 professional designs like these:

Transcript

APCSP Unit 6 Overview Project

By: Maddux Wilkerson

Index

Lesson 1 Algorithms

Lesson 2 Algorithm Efficiency

Lesson 3 Reasonable VS Unreasonable Time

Lesson 4 The Limits of Algorithms

Lesson 5 Distributed Algorithms

01

Unit 6 Lesson 1 Algorithms

Algorithms Solve Problems

Algorithms and Problems

Algorithm: Something that solves the problemProblem: The thing you need to solve

Sometimes Algorithms can look different but do the same thing and the same for codes that look similar but do different things

EXAMPLE

Click on buttons to open windows to more information!
Notice how both of these codes look different but end up with the same product

+ info

Different Types of Algorithms

Iteration

Selection

Sequencing

02

Unit 6 Lesson 2 Algorithmic Efficiency

Linear and Binary Searches

Different Types of Searches

Binary Searches

Linear Searches

03

Unit 6 Lesson 3 Reasonable VS Unreasonable Time

Factorial, Exponential, Linear and Polynomial Efficiency

Different Times

Reasonable Time

Unreasonable Time

04

Unit 6 Lesson 4 The Limits of Algorithms

Heuristics and the limits of computers

Heuristics

Heuristics: Gives a good enough solution to a problem when a solution to the problem is unreasonable or impossible

Even with the power of our computers there are some problems that computers will never be able to solve even if we continue to upgrade our computer processing power
The traveling salesmen problem is a popular heurstic in which it depicts a certain number of houses and the salesmen has to find the shortest distance to get to each house and back to the original house.
This problem is one of the best examples for a heurstic algorithm as once you add enough houses it will be either impossible or take too long for a computer to calculate but you can still get a "good enough" solution to the problem yourself

+ info

TravelinG Salesmen

05

Unit 6 Lesson 5 Distributed Algorithms

Comparing parallel and sequential computing solutions

Different Types of Algorithms

Distibuted Computing

Parallel Computing

Sequencial Computing

Sequencial and Parallel Computing Execution Time Example

The End