APCSP GRAND REVIEW

4.5(2)
studied byStudied by 12 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/74

flashcard set

Earn XP

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

75 Terms

1
New cards

syntax error

A mistake in typed code that violates the rules of the programming language. Typically, code with syntax errors will not run.

2
New cards

logic error

A mistake in an algorithm or program that causes it to behave unexpectedly or return the incorrect value.

3
New cards

run-time error

A mistake in a program that happens only when the program is actually run, such as a program attempting to access memory that does not exist.

4
New cards

overflow error

Error that results when the number of bits is not enough to represent the number (like a car's odometer 'rolling over').

5
New cards

bit

A binary digit, either 0 or 1.

6
New cards

byte

A sequence of 8 bits.

7
New cards

roundoff

Error that results when the number of bits is not enough to represent the number with full precision (like using 3 digits to represent [\pi] as 3.14).

8
New cards

analog data

Values that change smoothly, rather than in discrete intervals, over time. For example, the pitch and volume of a live concert.

9
New cards

lossless

Compressing data in a way that preserves all data away and allows full recovery of the original.

10
New cards

lossy

Compressing data in a way that discards some data and makes it impossible to recover the original.

11
New cards

metadata

Data about data, like descriptive information about a file or a row in a database.

12
New cards

sequencing

The sequential execution of steps in an algorithm or code in a program (like steps in a recipe).

13
New cards

selection

A Boolean condition to determine which of two paths are taken in an algorithm or program.

14
New cards

iteration

The repetition of steps in an algorithm or program for a certain amount of times or until a certain condition is met.

15
New cards

linear search

An algorithm that iterates through each item in a list until it finds the target value.

16
New cards

binary search

An algorithm that searches a sorted list for a value by repeatedly splitting the list in half.

17
New cards

reasonable time

A run time for an algorithm that doesn't increase faster than a polynomial function of the input size (like 10n, n^2, etc). An unreasonable run time would increase superpolynomial (like 2^n or n!).

18
New cards

heuristic

A technique that helps an algorithm find a good enough solution in a hard problem (like the traveling salesman that has to visit 13 cities and needs the best route).

19
New cards

undecidable

A problem that is so logically difficult, we can't ever create an algorithm that would be able to answer 'yes' or 'no' for all inputs (like the halting problem).

20
New cards

library

A collection of procedures that are useful in creating programs.

21
New cards

API

Application Programming Interface, a library of procedures and a description of how to call each procedure.

22
New cards

modularity

The separation of a program into independent modules that are each responsible for one aspect of the program's functionality.

23
New cards

traversal

The iteration over the items in a list. A full traversal iterates over every item, while a partial traversal iterates over a subset of the items.

24
New cards

computing device

A physical device that can run a program, such as a computer, smart phone, or smart sensor.

25
New cards

computer network

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

26
New cards

bandwidth

The maximum amount of data that can be sent in a fixed period of time over a network connection, typically measured in bits per second.

27
New cards

protocol

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

28
New cards

scalability

The ability of a system to adjust in scale to meet new demands.

29
New cards

IP (Internet Protocol)

The protocol that determines how to address nodes on the network (with IP addresses) and how to route data from one node to a destination node (using routers).

30
New cards

TCP (Transmission Control Protocol)

A data transport protocol that includes mechanisms for reliably transmitting packets to a destination.

31
New cards

UDP (User Datagram Protocol)

A lightweight data transport protocol with minimal error checking.

32
New cards

World Wide Web

A system of linked pages, media, and files, browsable over HTTP.

33
New cards

HTTP (Hypertext Transfer Protocol)

The protocol that powers the Web, used to request web pages from servers and submit form data to servers.

34
New cards

parallel computing

A computational model which splits a program into multiple tasks, some of which can be executed simultaneously.

35
New cards

speedup

The improvement in the amount of time a parallelized program takes to solve a problem, computed as the amount of time to complete the task sequentially divided by the amount of time to complete the task when run in parallel.

36
New cards

distributed computing

A computational model which uses multiple devices to run different parts of a program.

37
New cards

digital divide

The idea that some communities or populations have less access to computing than others, typically due to limitations of Internet speed or computer hardware access.

38
New cards

crowdsourcing

A model in which many online users combine efforts to help fund projects, generate ideas, or create goods or services (like Wikipedia).

39
New cards

citizen science

Crowdsourcing for science! The participation of volunteers from the public in a scientific research project (like collecting rain samples or counting butterflies).

40
New cards

Creative Commons

An alternative to copyright that allows people to declare how they want their artistic creations to be shared, remixed, used in noncommercial contexts, and how the policy should propagate with remixed versions.

41
New cards

open access

A policy that allows people to have access to documents (like research papers) for reading or data (like government datasets) for analysis.

42
New cards

PII (Personally identifiable information)

Information about an individual that can be used to uniquely identify them (directly or indirectly).

43
New cards

multi factor authentication (MFA)

A method of user authentication which requires the user to present multiple pieces of evidence in multiple categories (such as knowledge and possession).

44
New cards

encryption

The process of scrambling data to prevent unauthorized access.

45
New cards

symmetric encryption

A technique for encrypting data where the same key is used to both encrypt and decrypt data.

46
New cards

public key encryption

An asymmetric encryption technique that uses different keys for encrypting versus decrypting data.

47
New cards

cookie

A small amount of text that tracks information about a user visiting a website.

48
New cards

virus

A type of computer malware that can make copies of itself.

49
New cards

phishing

An attack where a user is tricked into revealing private information, often via a deceptive email.

50
New cards

rogue access point

A wireless access point that provides an attacker with unauthorized access to the traffic going over the network.

51
New cards

Argument

is what is passed into the parameter (Ex. the Argument would be 1 or 2 that is passed into the program when we ask what level our user wants to play.)

52
New cards

Procedure

can also be known as a Method or a Function. They use these words to mean the same thing, although they are slightly different.

53
New cards

Conditional statement/Boolean Expression

a statement that has a condition (if score = 5, then you win the game, else you lose) It allows a program to make decisions and execute different blocks of code based on whether a condition is true or false.

54
New cards

Functionality

how the program runs(works) or functions.

55
New cards

User

the person using the program.

56
New cards

Program

A block of code.

57
New cards

Abstraction

simplifying complex systems or concepts by hiding unnecessary details and focusing on essential functionalities. This simplification makes code easier to understand, maintain, and reuse. (Ex. Walk - there are lots of parts of walk but it is simplified into one word.)

58
New cards

Indices

another word for index (Remember index always starts at 1).

59
New cards

Brackets [ ]

Bracket mean index.

60
New cards

Privacy Policies

A legal document that explains how an organization collects, uses, shares, and protects personal data. It also outlines the rights users have regarding their data.

61
New cards

Redundancy

Refers to the practice of incorporating backup components or systems to ensure continued operation in the event of a failure.

62
New cards

Configuration

Refers to the specific arrangement and settings of hardware and software components within a system.

63
New cards

Internet vs. World Wide Web

The Internet is the global network of interconnected computer networks, while the World Wide Web (WWW) is a specific service that uses the Internet to share information.

64
New cards

Arbitrary Number

A number that can be chosen from a set of possibilities without any specific criteria, such as a random number or a value within a defined range.

65
New cards

Append

To add to. If we appended 3 zeros to the end of a binary number it could change from this 111 to 111000.

66
New cards

Malware

Short for malicious software, refers to any software designed to perform actions a user does not intend or request, often without their knowledge.

67
New cards

Phishing

A type of cyberattack that uses deception to trick individuals into sharing sensitive information like login credentials or financial details.

68
New cards

Keylogging

Also known as keystroke logging, is the practice of recording the keys pressed on a keyboard, typically in a covert manner, to track user activity.

69
New cards

Abstraction

The process of hiding complex implementation details and presenting only the necessary information to the user.

70
New cards

Public Key vs. Private Key

Private Keys are used for both encryption and decryption of data and are shared between sender and receiver. Public Keys are used only for encrypting data.

71
New cards

len = length

When you see 'len' in a question it usually means length and it usually always refers to the length of a list/array.

72
New cards

DDoS - Distributed Denial of Service

A type of cyberattack that involves flooding a target system with excessive traffic from multiple sources.

73
New cards

NAND Gate

NAND is an abbreviation for 'NOT AND.' A two-input NAND gate is a digital combinational logic circuit that performs the logical inverse of an AND gate.

74
New cards

Binary vs. Linear Searches

Linear search checks each element one by one until it finds the target, while binary search efficiently narrows down the search range by dividing the list in half.

75
New cards

Parameter

the space left open for the user to respond. (For our program level our parameter would be "difficulty level")