Computer Science Semester 2 Final Vocab

Parameter

A variable in a function definition. Used as a placeholder for values that will be passed through the function.

Argument

The value passed to the parameter.

Return

Used to return the flow of control to the point where the procedure (also known as a function) was called and to return the value of expression.

Procedural abstraction

A process and allows a procedure to be used only knowing what it does, not how it does it. Procedural abstraction allows a solution to a large problem to be based on the solution of smaller subproblems.

Library

A group of functions (procedures) that may be used in creating new programs.

API (Application Program Interface)

Specifications for how functions in a library behave and can be used.

Modularity

The subdivision of a computer program into separate subprograms.

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 Key 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 algorithm.

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.

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?).

Optimization Problem

A problem with the goal of finding the "best" solution among many (e.g., what is the shortest path from A to B?).

Undecidable Problem

A problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer.

Sequential Computing

A model in which programs run in order, one command at a time.

Parallel Computing

A model in which programs are broken into small pieces, some of which are run simultaneously.

Distributed Computing

A model in which programs are run by multiple devices.

Speedup

The time used to complete a task sequentially divided by the time to complete a task in parallel.