AP Test - AP Computer Science Principles

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

1/29

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.

30 Terms

1
New cards

Overflow

(type of error)

During the execution of a program, if value arrives at a number outside of the computer's well-defined range, it [computer] will experience an overflow error.

2
New cards

Round-off

(type of error)

Round-off error occurs when a computer is used to produce real number calculations, and results from the omission of the significant figure. The error is the difference between the calculated approximation of a number and its exact mathematical value [due to rounding].

3
New cards

Lossy

(compression)

Results in lost data and quality from the original version of image and audio files.

4
New cards

Lossless

(compression)

Reduces a [image or audio] file's size with no loss of quality. This process basically rewrites the data of the original file in a more efficient war. Due to no loss of quality, the resulting files are much larger than those compressed with Lossy.

5
New cards

Metadata

Metadata is data that provides information about other data.

6
New cards

Types of Metadata

Descriptive, structural, and administrative.

7
New cards

Sequencing

The computer will run the code in order, one line at a time from the top to the bottom of the program.

8
New cards

Selection

When only certain lines of code are preferred to be run only if a condition is met [otherwise these lines would be ignored], an IF statement is used — thus, selection.

9
New cards

Iteration

If one wants the computer to execute the same lines of code several times, a loop is used, running until a certain condition is met.

10
New cards

Types of Loops

For, while, and repeat loops.

11
New cards

Reasonable Time

Polynomial in the number of steps an algorithm takes in the worst case based on the input size.

12
New cards

Not Reasonable Time

Usually exponential in the number of steps; example: doubling every time the input grows by one.

13
New cards

Heuristic

"Rule of Thumb," or a good guide to follow when making decisions, referring specifically to algorithms. When programming software, the goal is to create the most efficient algorithms to accomplish various tasks. A heuristic process may include running tests, getting results by trial and error.

14
New cards

Undecidable

A problem that is so difficult there is no possibility of creating an algorithm that would be able to answer yes or no for all inputs.

15
New cards

Linear Search

A search that goes one by one, in order.

16
New cards

Binary Search

A search that starts in the middle and proceeds to go left or right based on the outcome; like looking for a word in a dictionary. Binary searches require the list to be sorted in order.

17
New cards

APIs

Application Programming Interface:

APIs are a set of subroutine definitions, protocols, and tools for building application software.

18
New cards

Citizen Science

A lot of people to help with a scientific project; ex. asking everyone around the world to count the butterflies they see in one day.

19
New cards

Cloud Computing

Using distributed calculations and/or storage for big data or a web application

20
New cards

Crowdsourcing

21
New cards

Creative Commons

22
New cards

Open Access

23
New cards

Moore's Law

24
New cards

Peer-to-Peer Networks

25
New cards

Digital Divide

26
New cards

Protocols

27
New cards

IP Address

28
New cards

DNS

29
New cards

Internet Engineering Task Force

30
New cards

Fault Tolerance