AP COMP SCIENCE - FALL FINAL 2025

0.0(0)
studied byStudied by 0 people
0.0(0)
full-widthCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/84

flashcard set

Earn XP

Description and Tags

TEST : Dec 12, 2025

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

85 Terms

1
New cards

Analog to digital conversion

Can be turned into digital data by sampling, measuring values at regular intervals to store them in bits.

2
New cards

Digital data

Computers store all data digitally using bits.

3
New cards

Bit

A binary digit: 0 or 1.

4
New cards

Byte

A group of 8 bits.

5
New cards

Abstraction

Reduces complexity by focusing on main ideas and hiding unnecessary detail.

6
New cards

Bit grouping

These can be grouped to represent abstractions like numbers, characters, or colors.

7
New cards

Context-dependent bits

The same bits can represent different types of data depending on context.

8
New cards

Analog data

Data that changes smoothly over time (e.g., sound, color, motion).

9
New cards

Digital approximation

Digitally approximating analog data is an example of abstraction.

10
New cards

Integer limits

Integers use a fixed number of bits, limiting range and causing overflow errors.

11
New cards

Real number limits

Real numbers use fixed bits, causing approximation and round-off errors.

12
New cards

Binary/decimal conversion

Convert between binary and decimal; compare binary numbers.

13
New cards

Binary place value

A bit’s value depends on its position.

14
New cards

Base 2 place value

Binary place value equals 2 raised to the position number.

15
New cards

Data compression

Reduces the number of bits needed to store or transmit data.

16
New cards

Lossless compression

Reduces size while allowing perfect reconstruction.

17
New cards

Lossy compression

Reduces size more but only reconstructs an approximation.

18
New cards

Lossy vs lossless

Lossy usually shrinks data more than lossless.

19
New cards

Lossless use case

Chosen when quality and accuracy matter most.

20
New cards

Lossy use case

Chosen when minimizing size or transmission time matters most.

21
New cards

Intellectual property

Digital creations belong to the creator.

22
New cards

Plagiarism

Using others’ work without permission and claiming it as your own.

23
New cards

Legal content use

Creative Commons, open source, and open access allow lawful use.

24
New cards

Citation

Always cite material created by others.

25
New cards

Path (networking)

A sequence of directly connected devices between sender and receiver.

26
New cards

Internet

A network of networks using open, standard protocols.

27
New cards

Internet access

Requires connecting a device to part of the Internet.

28
New cards

Protocol

An agreed-upon set of rules for communication.

29
New cards

Open protocols

Allow easy connection of new devices.

30
New cards

Dynamic routing

Paths on the Internet change as needed.

31
New cards

Scalability

A system’s ability to grow or handle more demand.

32
New cards

Internet scalability

The Internet was designed to be scalable.

33
New cards

Common protocols

IP, TCP, and UDP.

34
New cards

Datastream

Data traveling across the Internet in chunks.

35
New cards

Packets

Chunks of data with routing metadata.

36
New cards

Packet arrival

May arrive in order, out of order, or not at all.

37
New cards

World Wide Web

A system of linked pages, programs, and files.

38
New cards

HTTP

The protocol used by the Web.

39
New cards

Web vs Internet

The Web uses the Internet.

40
New cards

Fault tolerance

The Internet keeps working even when parts fail.

41
New cards

Redundancy

Extra components that protect against failure.

42
New cards

Multiple paths

Networks often have more than one route between devices.

43
New cards

Automatic rerouting

Data is rerouted if a path fails.

44
New cards

Fault tolerant system

Works even when elements fail.

45
New cards

Redundancy tradeoff

Requires more resources but increases reliability.

46
New cards

Routing redundancy

Increases reliability and supports scaling.

47
New cards

Internet access inequality

Varies by socioeconomic, geographic, and demographic factors.

48
New cards

Digital divide

Unequal access to devices and the Internet.

49
New cards

Digital divide impact

Affects individuals and groups.

50
New cards

Digital divide issues

Raises equity, access, and influence concerns.

51
New cards

Digital divide influences

Shaped by individuals, organizations, and governments.

52
New cards

Event driven programming

Runs code when events occur.

53
New cards

Program requirements

Describe what a program must do, including interactions.

54
New cards

Program specification

Defines program requirements.

55
New cards

Comments

Notes for humans that do not affect execution.

56
New cards

Debugging

Identify and fix errors in a program.

57
New cards

Assignment operator

Stores or changes a variable’s value.

58
New cards

Variable behavior

A variable holds its most recently assigned value.

59
New cards

String

An ordered sequence of characters.

60
New cards

Expression

A value, variable, operator, or procedure call.

61
New cards

Expression evaluation

Produces a single value.

62
New cards

Order of operations

Rules that determine evaluation order.

63
New cards

Arithmetic operators

Addition, subtraction, multiplication, division, modulus.

64
New cards

Boolean logic

Uses logical operators to compare conditions.

65
New cards

Logical operators

NOT, AND, OR.

66
New cards

AND operator

True only if both conditions are true.

67
New cards

OR operator

True if at least one condition is true.

68
New cards

Conditional statements

Run different code depending on a Boolean expression.

69
New cards

Nested conditionals

Conditionals inside other conditionals.

70
New cards

Else if

A type of nested conditional.

71
New cards

Procedure call

Runs a named set of instructions.

72
New cards

Procedure

A named group of instructions with optional parameters/returns.

73
New cards

Procedural abstraction

Reuses code and reduces complexity.

74
New cards

Logic error

A mistake causing incorrect program behavior.

75
New cards

Testing correctness

Identify inputs and expected outputs.

76
New cards

Relational operators

Compare values (=, ≠, >, <, ≥, ≤).

77
New cards

Data insights

Data can show patterns, trends, or information.

78
New cards

Metadata

Data about data.

79
New cards

Data challenges

Issues like size, complexity, and quality.

80
New cards

Data bias

Bias can come from how or where data is collected; more data doesn’t fix it.

81
New cards

Data extraction

Programs can pull information from data.

82
New cards

Data cleaning

Programs can filter and clean data for insights.

83
New cards

Data transformation

Turning or translating data can produce knowledge.

84
New cards

Innovation bias

Computing innovations can contain bias.

85
New cards

Collaborative problem solving

People work together at scale to solve problems.

Explore top flashcards

APUSH Period 3 Terms
Updated 68d ago
flashcards Flashcards (42)
Patosz definiciók
Updated 760d ago
flashcards Flashcards (117)
hamlet critic quotes
Updated 977d ago
flashcards Flashcards (65)
Voc 29+30
Updated 290d ago
flashcards Flashcards (151)
Unit 5 MWH
Updated 1075d ago
flashcards Flashcards (24)
chapter 5 quizlet
Updated 1011d ago
flashcards Flashcards (20)
APUSH Period 3 Terms
Updated 68d ago
flashcards Flashcards (42)
Patosz definiciók
Updated 760d ago
flashcards Flashcards (117)
hamlet critic quotes
Updated 977d ago
flashcards Flashcards (65)
Voc 29+30
Updated 290d ago
flashcards Flashcards (151)
Unit 5 MWH
Updated 1075d ago
flashcards Flashcards (24)
chapter 5 quizlet
Updated 1011d ago
flashcards Flashcards (20)