AP CSP Notes

LINKS

Alliyalamangalam.Raghav,Das.Sohom,Bandi.Harshith CSP U6L5

Sohom Das - Class Data Algorithm Activities Sohom Das - Travelling Salesman Brute Force

Sohom Das - Traveling Salesman Algorithms

AP TEST NOTES

• Binary (2) -> Hexadecimal (16)

• INTERNET: how it works

1. Safe & Ethical Practices Online

2. Key Words: bits (the most basic unit of information in computers), packets (a formatted unit of data to be sent over the internet to a destination), protocols; DNS (domain name server, turns domain names into IPs), TCP (transmission control protocol, comms standard that lets computers communicate) fault tolerance (multiple paths for information to get where it needs to go), network maps (a map of all the possible routes information can take), brute force (a way to solve a problem by checking all of the possible solutions, very inefficient but always works)

• Computing Innovation (read a passage and answer 5 questions)

ALGORITHMS

• Heuristic: definition and how it applies to cs -> answer questions that involve it

1. A “good enough” solution🐝, only used when most efficient solution is impossible to attain

• Traveling Salesman Problem: its implications to cs and algos (what approach can i take to find the shortest route every time)

• Efficient (and inefficient) algo patterns

1. Binary vs. Linear Search

1. Linear Search: searches unsorted data one by one, very slow with large datasets

2. Binary Search: searches sorted data repeatedly dividing in half the part of the list that could have the searched data, much more efficient than linear search

• Parallel Programming & Speed up

1. Sequential: performed in order

2. Parallel: multiple steps performed at the same time

3. Speedup: Sequential time/parallel time (each additional processor is less significant: the speedup eventually reaches a limit) 

• Distributed Computing: programs run by multiple devices