AP CSP Vocabulary

4.0(1)
studied byStudied by 1 person
4.0(1)
full-widthCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/73

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

74 Terms

1
New cards

DNS (Domain Name System)

is a fundamental internet service that translates human-readable domain names, such as 'example.com,' into their corresponding IP addresses, like '192.168.0.1.' This process facilitates user-friendly browsing by allowing people to easily remember and enter website names rather than numeric IP addresses.

2
New cards

Citizen Science

scientific research conducted in whole or part by distributed individuals, many of whom may not be scientists, who contribute relevant data to research using their own computing devices. 'This project would benefit from using a citizen science model for gathering photographs of birds from amateur photographers around the world.'

3
New cards

Internet Engineering Task Force

is an open standards organization, which develops and promotes voluntary Internet standards, in particular the standards that comprise the Internet protocol suite. It has no formal membership roster or membership requirements.

4
New cards

Digital Divide

the gulf between those who have ready access to computers and the internet, and those who do not. (Low income, rural areas, disabled people all have less access)

5
New cards

Creative Commons License

can be used by creators of digital music to specify how the samples can be used by others. A no-rights-reserved license allows others to freely make use of the samples.

6
New cards

Floating Point Imprecision

stems from the problem of trying to store values less than 1 like 1/10 or (. 10) in a computer with a binary number system with a finite amount of numbers.

7
New cards

Open Protocol

is one that is not owned by any particular company and not limited to a particular company's products. The protocols in the Internet stack are open so that any computing device can follow the protocol to join the global network.

8
New cards

Reasonable Run Time

If n represents the size of the data that you are dealing with, anything less than n^n or n! is considered reasonable run time. So, for example linear search (checking every single item in a list to find something) is considered n run time because the maximum or worst case number of steps required would be n or checking every single element in the list. n^2 is considered reasonable. As is n^6, etc… For our purposes, I think you can consider anything less than n^n as reasonable run time…

9
New cards

Public Key/Private Key

Public-key cryptography, or asymmetric cryptography, is a cryptographic system that uses pairs of keys: public keys (which may be known to others), and private keys (which may never be known by any except the owner). The generation of such key pairs depends on cryptographic algorithms which are based on mathematical problems termed one-way functions. Effective security requires keeping the private key private; the public key can be openly distributed without compromising security.

10
New cards

Symmetric Encryption

uses a single key for both encryption and decryption of data. Since the key can be used to unlock the data, it should be kept secret.

11
New cards

Linear Search

is checking every single item in a list or data structure to find something. The items do not have to be sorted.

12
New cards

Binary Search

is when you have a SORTED list and you check the middle to see if the value is there, then make another guess depending on whether the value you are looking for is higher or lower than that value. is considered to have a log(n) run time which is better than the n run time of linear search, BUT you do have to SORT the elements in the list first to run a binary search…

13
New cards

Symmetric Key Cryptography

also known as Symmetric Encryption is when a secret key is leveraged for both encryption and decryption functions. This method is the opposite of Asymmetric Encryption (Public Key/Private Key) where one key is used to encrypt and another is used to decrypt. (The Caesar cipher is an example of symmetric encryption)

14
New cards

Machine Learning

is the study of computer algorithms that improve automatically through experience and by the use of data.

15
New cards

Caesar cipher

An example of symmetric encryption.

16
New cards

Machine learning

The study of computer algorithms that improve automatically through experience and by the use of data, seen as a part of artificial intelligence.

17
New cards

Crowdsourcing

The practice of obtaining information or input into a task or project by enlisting the services of a large number of people, either paid or unpaid, typically via the internet.

18
New cards

Abstraction

Hiding or suppressing detail; the MORE detail which is suppressed the HIGHER LEVEL of abstraction.

19
New cards

Cloud Computing

The practice of using a network of remote servers hosted on the internet to store, manage, and process data, rather than a local server or a personal computer.

20
New cards

Turing Complete

Refers to the ability of a computer or system to run any algorithm or solve any computational problem, provided it is given the necessary instructions, time, and memory.

21
New cards

Phishing

An email attack where the attackers are trying to access private/sensitive information, attempting to trick a user into providing personal information.

22
New cards

DDOS (Dedicated Denial of Service) Attack

Means that hackers have attempted to make a website or computer unavailable by flooding or crashing the website with too much traffic.

23
New cards

Rogue access point

A wireless access point that gives unauthorized access to secure networks.

24
New cards

Internet Packets (TCP)

Data transmitted on the Internet is broken into packets and then reassembled upon arrival.

25
New cards

Heuristic approach

A problem-solving technique that uses practical methods, shortcuts, or educated guesses to find approximate solutions to complex problems more efficiently.

26
New cards

Analog signals

Are sampled digitally at discrete intervals over time, represented at the lowest level as a sequence of bits.

27
New cards

The Internet

The global system of interconnected computer networks that uses open protocols to connect devices worldwide.

28
New cards

World Wide Web

An information system (of pages, programs, and files) that is accessible over the Internet.

29
New cards

Strong password

Something that is easy for a user to remember but would be difficult for someone else to guess based on knowledge of that user.

30
New cards

Weak passwords

Can often be guessed based on publicly available information about a user.

31
New cards

Weak Passwords

Other weak passwords (such as 'password' or '1234') can often be guessed because they are commonly used.

32
New cards

Bandwidth

The bandwidth of a computer network is the maximum amount of data that can be sent in a fixed amount of time, typically measured in megabytes per second, or Mbps.

33
New cards

Latency

or ping, is the time between you sending a request for data and that data getting back to you, usually measured in milliseconds.

34
New cards

Parallel Computing

a type of computation in which many calculations or processes are carried out simultaneously.

35
New cards

Keylogging

use of a program to record every keystroke made by a computer to gain fraudulent access to passwords and other confidential information.

36
New cards

Algorithm

step-by-step, structured set of instructions or procedures designed to solve a specific problem or accomplish a task.

37
New cards

Bit

shorthand for binary digit and is either 0 or 1, the smallest piece of memory in a computer; 4 bits can store 16 values (0-15).

38
New cards

Byte

8 bits, with a maximum value of 255.

39
New cards

Data Compression

can reduce the size (number of bits) transmitted or stored data.

40
New cards

Lossless Data Compression

can usually reduce the number of bits stored or transmitted while guaranteeing the complete reconstruction of the original data.

41
New cards

Lossy Data Compression

algorithms can significantly reduce the number of bits stored or transmitted but only allow reconstruction of an approximation of the original data.

42
New cards

Metadata

data about data, such as the date of creation or the file size of an image.

43
New cards

Cleaning Data

process that makes the data uniform without changing their meaning.

44
New cards

Computing system

A group of computing devices and programs working together for a common purpose.

45
New cards

Computer network

A group of interconnected computing devices capable of sending and receiving data.

46
New cards

Path

A sequence of directly connected computing devices from a sender to a receiver.

47
New cards

Routing

The process of finding a path from sender to receiver.

48
New cards

Bandwidth

The maximum amount of data that can be sent in a given amount of time, usually measured in bits per second or bps.

49
New cards

Protocol

An agreed set of rules that specify the behavior of a system.

50
New cards

Scalability

The capacity of a system to change in size and scale to meet demands.

51
New cards

Packets

Small amounts of data sent over the Internet that contain data and metadata including the sources and destinations as well as data needed for reassembly.

52
New cards

World Wide Web (WWW)

A system of linked pages, programs, and files that uses the Internet.

53
New cards

HTTP

A protocol used by the World Wide Web.

54
New cards

Sequential Computing

A computational model in which operations are performed in order one at a time.

55
New cards

Parallel Computing

A computational model where the program is broken into multiple smaller sequential computing operations some of which are performed simultaneously.

56
New cards

Distributed computing

A computational model in which multiple devices are used to run a program.

57
New cards

Computing innovation

Includes a program as an integral part of its function and can be a physical, non-physical computing software, or a non-physical computing concept.

58
New cards

Program

A collection of program statements that performs a specific task when run by a computer.

59
New cards

Code segment

A collection of program statements that is part of a program.

60
New cards

Program documentation

Written description of the function of a code segment, event, procedure, or program and how it was developed.

61
New cards

Comments

A form of program documentation written into the program to be read by people and do not affect how a program runs.

62
New cards

Logic error

A mistake in the algorithm or program that causes it to behave incorrectly or unexpectedly.

63
New cards

Syntax error

A mistake in the program where the rules of the programming language are not followed.

64
New cards

Runtime error

A mistake in the program that occurs during the execution of a program.

65
New cards

Overflow error

An error that occurs when a computer attempts to handle a number that is outside of the defined range of values.

66
New cards

Redundancy

The inclusion of extra components that can be used to mitigate failure of a system if other components fail.

67
New cards

Fault tolerant system

A system that can support failures and still continue to function.

68
New cards

Digital divide

Differing access to computing devices and the Internet, based on socioeconomic, geographic, or demographic characteristics.

69
New cards

Citizen science

Scientific research conducted in whole or part by distributed individuals who contribute relevant data to research using their own computing devices.

70
New cards

Crowdsourcing

The practice of obtaining input or information from a large number of people via the Internet.

71
New cards

Phishing

A technique that attempts to trick a user into providing personal information that can then be used to access sensitive online resources.

72
New cards

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.

73
New cards

Linear search

An algorithm that checks each element of a list, in order, until the desired value is found or all elements have been checked.

74
New cards

Binary search

An algorithm that starts at the middle of a sorted data set and eliminates half of the data until the desired value is found or all elements have been eliminated.

Explore top flashcards

Blackjack Bets
Updated 348d ago
flashcards Flashcards (54)
U11
Updated 538d ago
flashcards Flashcards (20)
maternity midterm
Updated 371d ago
flashcards Flashcards (264)
APUSH Vocab 2024 (3)
Updated 585d ago
flashcards Flashcards (33)
V - UIL S&V
Updated 754d ago
flashcards Flashcards (41)
Verbos reflexivos
Updated 29d ago
flashcards Flashcards (44)
Blackjack Bets
Updated 348d ago
flashcards Flashcards (54)
U11
Updated 538d ago
flashcards Flashcards (20)
maternity midterm
Updated 371d ago
flashcards Flashcards (264)
APUSH Vocab 2024 (3)
Updated 585d ago
flashcards Flashcards (33)
V - UIL S&V
Updated 754d ago
flashcards Flashcards (41)
Verbos reflexivos
Updated 29d ago
flashcards Flashcards (44)