Unit 8/10 - Cybersecurity and Global Impacts/ Algorithms Flashcards
(30 cards)
Computing Innovation
includes a program as an integral part of its function. Can be physical (e.g. self-driving car), non-physical computing software (e.g. picture editing software), or non-physical computing concepts (e.g., e-commerce).
Personally Identifiable Information (PII)
information about an individual that identifies, links, relates, or describes them.
Phishing
a technique that attempts to trick a user into providing personal information. That personal information can then be used to access sensitive online resources, such as bank accounts and emails
Keylogging
the use of a program to record every keystroke made by a computer user in order to gain fraudulent access to passwords and other confidential information
Malware
software intended to damage a computing system or to take partial control over its operation
Rogue Access Point
a wireless access point that gives unauthorized access to secure networks.
Encryption
a process of encoding messages to keep them secret, so only “authorized” parties can read it.
Decryption
a process that reverses encryption, taking a secret message and reproducing the original plain text.
Symmetric Key Encryption
involves one key for both encryption and decryption
Public Eye Encryption
pairs a public key for encryption and a private key for decryption. The sender does not need the receiver’s private key to encrypt a message, but the receiver’s private key is required to decrypt the message
Multi-Factor Authentication
a system that requires at least two steps to unlock protected information; each step adds a new layer of security that must be broken to gain unauthorized access
Computer Virus Scanning Software
protects a computing system against infection.
Problem
a general description of a task that can (or cannot) be solved with an algorithm
Algorithm
a finite set of instructions that accomplish a task.
Sequencing
putting steps in an order.
Selection
deciding which steps to do next
Iteration
doing some steps over and over
Efficiency
a measure of how many steps are needed to complete an algorithmL
Linear Search
a search algorithm which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked.
Binary Search
a search algorithm that starts at the middle of a sorted set of numbers and removes half of the data; this process repeats until the desired value is found or all elements have been eliminated.
Reasonable Time
Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time.
Unreasonable Time
Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time.H
Heuristic
provides a “good enough” solution to a problem when an actual solution is impractical or impossible
Decision Problem
a problem with a yes/no answer (e.g., is there a path from A to B?)
