Unit 6 APCSP

Unit 6 Innovative Technologies

Computing Innovations

  • Definition by College Board

    • Includes computer or program code

    • Examples: self-driving cars, phone apps, smartwatches

  • Not computing innovations

    • Internet cables, Bluetooth technology

Impact of the Internet

  • Changes in society

  • Internet as utility or luxury

  • Commerce changes

    • E-commerce, online storefronts, crowdfunding

  • News consumption changes

Cloud Computing

  • Definition and function

  • Server explanation

  • Advantages of cloud computing

    • Portability, off-site storage

  • Disadvantages

    • Privacy concerns, data transmission issues

Digital Divide

  • Definition and causes

  • Lack of internet access in rural areas

  • Efforts to bridge the digital divide

The Internet

  • Definition and components

  • Ownership and control

  • Bandwidth and scalability

  • Distinction from the World Wide Web

Communication Protocols

  • Definition and purpose

  • Application Layer standards

  • HTTP vs HTML

  • Link Layer and Internet Layer standards

Internet Protocols

  • IP address and its significance

  • Internet Protocol versions (IPv4 and IPv6)

  • Domain name system (DNS) function

Conclusion

  • Importance of understanding innovative technologies and their impact

  • Role of internet and communication protocols in modern society

Page 31

  • Encryption

    • Cryptography is about securing information from third parties.

    • Encryption converts data into a code to prevent unauthorized access.

    • Decryption reverses encryption to reveal the original text.

Page 32

  • Caesar Cipher

    • Example of encryption method.

    • Key: change every letter by 13.

    • Example: "free pizza in the cafeteria" encrypted as "serr cvmmn va gur pnsrgrevn".

Page 33

  • Types of Encryption

    • Symmetric Key Encryption: uses one key for both encryption and decryption.

Page 34

  • Types of Encryption

    • Public Key Encryption: uses a public key for encryption and a private key for decryption.

    • Sender needs recipient's public key to encrypt but recipient uses private key to decrypt.

Page 35

  • Public Key Encryption

    • Recipient knows both public and private keys.

    • Sender only knows recipient's public key.

Page 36

  • Certificate Authorities

    • Issue digital certificates certifying ownership of a public key.

Page 37

  • Cybersecurity

    • Measures to protect computers from unauthorized access.

    • Includes encryption, passwords, and multi-factor authentication.

    • Multi-Factor Authentication requires multiple pieces of evidence for access.

Page 38

  • Net Neutrality

    • Ensures free and open access to information on the internet.

    • ISPs should not control access to websites.

    • Ongoing debate and legal actions on net neutrality.

Page 39

  • Distributed Computing

    • Programs run on multiple devices for complex problems.

    • Parallel Computing breaks programs into smaller pieces for faster processing.

Page 40

  • Sequential vs. Parallel

    • Sequential: steps performed in order.

    • Parallel: some steps performed simultaneously.

Page 41

  • Closed Source vs. Open Source

    • Closed Source: privately owned and proprietary.

    • Open Source: publicly available and free to use.

    • Creative Commons Licensing allows specified use of works.

Page 42

  • Keylogging and Rogue Access Point

    • Keylogging: records keystrokes for data retrieval.

    • Rogue Access Point: gives unauthorized network access.

Page 44

  • Algorithmic Efficiency

    • Measure of computational resources used by an algorithm.

    • Efficiency varies with input size.

    • Polynomial and linear efficiencies run in reasonable time.

Page 46

  • Solvability

    • Problems algorithms aim to solve.

    • Decision and Optimization problems.

    • Some problems are undecidable.

Page 48

  • Undecidable Problems

    • Halting Problem: cannot determine if programs will halt.

    • Some problems have no algorithmic solution for all instances.

Page 49

  • Heuristics

    • Method for deriving approximate solutions.

    • Not perfect but provides a sufficient result.

Page 50

  • Traveling Salesman Problem

    • Requires massive computing power for exhaustive search.

    • Heuristic solutions offer quicker but not optimal results.

Page 52

  • Overflow Errors

    • Occur when a program calculates a number outside the allocated range.

    • Different from rounding errors caused by