APCSP EXAM

0.0(0)
studied byStudied by 3 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/77

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.

78 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 data

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 run 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 superpolynomially (like \[2^n\] or \[n!\]).

18
New cards

Heuristic

A technique that helps an algorithm find a good solution in a hard problem (like always walking toward the north star when you are stuck in a forest).

19
New cards

undecidable problem

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

Scalibility

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

29
New cards

IP 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

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

The protocol that powers the Web, used to request webpages 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

Crowd Sourcing

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

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

43
New cards

Multifactor Authentication

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

digital certificate

a data file that identifies individuals or organizations online and is comparable to a digital signature

52
New cards

for (var i = 0; i < n; i++)

repeat this loop n times

53
New cards

for (var i = 0; i < list.length; i++)

for each item in list

54
New cards

Tradeoff

something negative that happens in exchange for something positive

55
New cards

What is a bit?

A binary digit, a 0 or a 1.

56
New cards

what is a byte

a group of 8 bits

57
New cards

01100011 is a...

byte

58
New cards

a bit can only represent:

one of 2 possible values

59
New cards

A sequence of three bits can represent:

8 possible values (2^3)

60
New cards

How many different values can four bits represent?

16

61
New cards

Binary digit

0 or 1

62
New cards

why do computers use Bytes

a computer prefers to process 8 bits at a time. The byte is also the smallest addressable unit of memory in most modern computers.

63
New cards

How many bits are in 4 bytes?

32

64
New cards

how do you know if a binary number is odd

if it has a 1 at the end

65
New cards

the highest number that can be represented by \[n\] bits

2^n - 1

66
New cards

how to find the least number of bits that can represent n

count the number of zeros and ones to see how many bits are used

67
New cards

there are 3 yes or no options. what is the minimum number of bits that can be used to represent the options

3

68
New cards

Why might programs sometimes encounter issues with roundoff, overflow, or precision of numeric variables

due to limited computer memory

69
New cards

Consider a computer that uses 6 bits to represent integers: 1 bit for the sign and 5 bits for the actual number. What's the largest positive integer it can represent?

31

70
New cards

Floating Point Representation

a number is multiplied by a base that's raised to an exponent:

71
New cards

Roundoff errors

a computer can not store an infinite amount of values so it must round it off eventually

72
New cards

if a computer can store x bits, what is the largest number it can store

2^x

73
New cards

ASCII encoding

74
New cards

analog data is

infinitely detailed

75
New cards

sampling

take a sample at regular time intervals. This step reduces the continuous time domain into a series of discrete intervals.

76
New cards

Quantization

reduces that continuous amplitude domain into discrete levels.

77
New cards

types of data stored in a computer using bits

numbers, text, photos, audio

78
New cards

we use lossy compression with

photos, videos, audio recordings