CS Principles Review

4. of a program, the WHY of the program
7. a computing technique that uses multiple devices to run different parts of a program
11. ___ time or polynomial time, run time for an algorithm that doesn't increase faster than a polynomial function of the input size
13. a lightweight data transport protocol with minimal error checking
14. the idea that some communities or populations have less access to computing than others (2 words)
16. the idea that using non-diverse data sets can lead to biased programs (2 words)
18. estimation of the amount of computational resources used by an algorithm
20. a computing technique that splits programs into multiple tasks which are executed simultaneously

1. a model in which many online users combine efforts to generate ideas and creates goods/services (2 words)
2. the process of finding the best solution of many (find the shortest path)
3. data about data, like information about a photo's location or time taken, but not the pixels of the photo
5. a compression technique that discards some data (discarded data can never be revived)
6. a problem that can never have a correct 'yes' or 'no' answer (the halting problem)
8. a transport protocol that includes mechanisms for reliably transmitting packets to a destination (2)
9. an asymmetrical encryption technique (2 words)
10. a boolean condition to determine which of two paths are taken in an algorithm or program
12. an algorithm that searches a sorted list by repeatedly splitting it in half (2 words)
15. the improvement in the amount of time a parallelized program takes to solve a problem(amount of time sequentially divided by amount of time in parallel)
17. a solution to an unreasonable problem that is good enough but not optimal
19. data that changes smoothly rather than in discrete intervals