Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

AP CSP > Units 1-5 > Flashcards

Units 1-5 Flashcards

1
Q

Iterative development process

A

develop working prototypes of a program and then go back and re-develop it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

incremental development process

A

break apart a problem into small parts and reassemble the solution when all the parts are fixed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

program documentation

A

shows how your a part of your program works

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

comments

A

program documentation written directly into the program

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

logic error

A

error in program’s output.

Code executes but output is not what the programmer intended

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

syntax error

A

code doesn’t work because it was written incorrectly

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

runtime error

A

error while code is running

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

overflow error

A

error in code because numbers are too big for computer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

hand-tracing (methods of fixing)

A

manually tracking variables outputs as the program goes along

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

print statements (methods of fixing)

A

print out values to make sure they are correct

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Data is stored in bits

A

bits (binary digits - composed of 0s and 1s)
single digit

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Binary numbers

A

8 bits = 1 byte
if n = number of bits,
2^n = can store 2^n numbers
2^n -1 = shows the largest number it can store

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Data representation:
ASCII code
Analog data
Digital data

A

ASCII code- converts text to binary code
Analog data- infinite details that are continuous and change smoothly over time
Digital data- measured digitally and leaves out extra data by simplifying data collected (form of abstraction)

sampling: when you break up analog data in intervals with the goal of putting it back together at a desired quality. Smaller samples = more accurate, fewer bits = less accurate

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Abstraction

A

reducing complexity by only focusing on most important parts and hiding irrelevant parts from user

focus on content without worrying about how application works

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Lossy data compression

A

Can reduce file size and decrease resolution but lost data CANNOT be recovered. Easier to store and transmit

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

lossless data compression

A

no data is lost and files can be reproduced. big file sizes so difficulty storing and sending

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

metadata

A
  • data that describes your data.
  • ex: data - picture of waterfall, metadata- time and location where pic was taken.
  • changing metadata will not change primary data
  • metadata provides additional info for better usage
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

data mining

A

examining large sets of data for information

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

transforming data

A

converting, cleaning, structuring data to format it in a way that helps analyze data for organizations

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

cleaning data

A

correcting, editing data so its prepared to be analyzed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Strings (data types)
- substrings
- string concatenation

A
  • strings are an ordered list of characters (“hello”)
  • substrings are part of a string (“ello”
  • string concatenation is when you combine two or more strings with ‘+’
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Lists (data types)

A
  • ordered sequence of elements starting with index 1
  • if index is less than 1 or greater than the number of elements in the list, it will cause error
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

Boolean operators (data types)

A
  • only true/false with 3 data operators (NOT, AND, OR)
  • NOT: if condition is false, NOT false evaluates to true (opposite)
  • AND: evaluates to true only if both condition 1 and condition 2 are true, otherwise false
  • OR: evaluates to true if at least 1 condition is true, if both are false, it is false
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

algorithm

A
  • sequence of instructions that accomplish a certain task; uses sequencing, selection, iteration
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

sequencing

A

all code is executed in the order it is written in

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

selection

A
  • if statements: specify what happens if the condition is met
  • else statement: specify what happens if the condition is not met
  • nested conditional statements: conditional statement inside another conditional statement
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

parameters vs arguments

A
  • parameters: input variables that act as placeholders
  • arguments: actual defined values when function is called
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
Q

Iteration

A
  • function that repeats a block of code until a specific result occurs; “repeat n times”, “repeat until”
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
29
Q

linear search

A

Algorithm for finding an element in a list. Starts from beginning of list and goes sequentially checking each element in list until item is found.

Can be used for sorted/unsorted

30
Q

binary search

A

Halved the elements that need to be searched
List MUST be sorted (ordered from least to greatest)
- compares middle value of list to target value
- if the middle value is greater than the target value, then eliminate the greater half of the list

It repeatedly dividing in half the portion of the list which could contain the item until you have narrowed it down to one

31
Q

Computing devices

A
  • physical object that can run a program. input > processing > output
32
Q

computer networks

A

group of interconnected computing devices capable of sending and receiving data; communicating with each other

33
Q

Data Packets:
Metadata:

A

data on the internet is split up into data packets with metadata attached to each packet to tell the routers information

34
Q

routing

A

process of finding best path to deliver information between sender and reciever

35
Q

bandwidth

A

rate of data transfer from one device to another in megabits per second.

36
Q

protocol

A

set of rules governing format of data sent. internet protocols have allowed the data to be easily changed in size and meet new demands

37
Q

Internet Protocol

A

IP addresses and routes your online requests so it can arrive at the correct destination. Every device connected to internet has IP addresses.

4th version: IPv4 has 32 bits; 2^32 addresses

6th version: IPv6 has 128 bits; 2^128 addresses

38
Q

Transmission Control Protocol

A
  • Ensures accurate data delivery once that IP address has been found.
  • Connection-oriented protocol
  • Data traveling is broken into smaller chunks of data called packets. If packets get lost, TCP resends
39
Q

User datagram protocol

A
  • Connectionless protocol
  • protocol that allows computer applicants to send messages without checking for missing packets.
  • Works faster but not as reliable as TCP. UDP has speedier communication because it doesn’t spend time forming a connection so packets get lost easily
40
Q

Fault Tolerant examples:

A
  • when system can support failures and continue to function
    - packets are taken out of order so path is guided by routers
    - if packet not received, TCP will resend it
    - when all packets received, packets will be put together to form original message
41
Q

end-to-end architecture

A

breaking down and assembling of packets at each end (from computer 1 to computer 2).
- what happens in middle is hidden

42
Q

Sequential Computing

A

Operating executed one at a time. It takes as long as the sum of all its steps

43
Q

Parallel Computing

A
  • breaks up a task into smaller, sequential pieces
  • those pieces are executed at same time by using multiple processing units
  • takes as long as the longest task done in parallel
  • needed in real world scenarios
44
Q

Distributed Computing

A
  • multiple devices communicate to run a program
  • larger problems cannot be solved on a single computer because of processing time or storage needs
45
Q

speedup of a parallel situation

A

sequential run time/parallel run time

46
Q

World Wide Web

A

a system of web-pages, programs, and files;

runs on the Internet but is not the internet

47
Q

scalability

A

the capacity to change in size and scale to
meet new demands.

48
Q

Digital Divide

A
  • Gaps between those who have access to internet and those who do not
    • infrastructure: some people don’t have access to internet bc of where they live
    • education: some may have access to it but not have education to use it
    • indifference: may have access but choose not to use it
    • cost: internet may be unaffordable
49
Q

Computing Bias

A

computing innovations can reflect gender/race biases since computers run on historical data.

recruiting algorithms may prefer one gender over the other

50
Q

Intellectual Property

A

work that people consider “theirs”

51
Q

Crowdsourcing

A

Process of obtaining information or feedback for a task from people on the internet. Ex: Uber connects with people who need rides.

52
Q

Citizen science

A

Uses general population with individuals who contribute their own data to conduct scientific research

53
Q

Copyright

A

Person who created something determines who gets to use their creation

54
Q

Creative Commons License

A

Public copyright license that allows for free distribution of copyrighted materials. Sometimes people can only copy original work without modification but if you credit the author, you can modify it.

55
Q

Open-Sourcing

A

Work is freely shared, distributed, modified

56
Q

Open-access

A

Research available to public without restrictions

57
Q

Computing Innovations with legal/ethical issues

A
  1. biased algorithms
  2. software that can download digital media and streams
  3. devices that collect & analyze data by constant monitoring sites
58
Q

Personally Identifiable Information (PII)

A
  • Information about a person that identifies or describes them (SSN, age, race, medical info)
  • Cyber criminals steal PII data through search history, website views
59
Q

Multi-factor authentication

A

User is granted access after successfully presenting multiple methods of verification

60
Q

Encryption

A

Encoding data to prevent others from accessing it

61
Q

Decryption

A

Process of decoding data

62
Q

Key

A

Secret piece of information used to encrypt data

63
Q

symmetric key encryption

A

Same key used to write/encrypt and to unlock/decrypt

64
Q

Public key/asymmetric key encryption

A

Uses 2 keys. Anyone with public key can encrypt data. Private key is needed to decrypt data

65
Q

Malware

A

Malicious software intended to damage or take control of its computing systems.

Can be spread through emails, social media, files.
Malware looks for outdates software with flaws in security to infect. By regularly doing software updates, it can fix errors.

66
Q

Computer viruses

A

Programs that copy themselves and gain access to a computer in an unauthorized way.

Viruses attach to a legit program and start running independently. Each time the infected program is run, the virus runs and attaches itself to other programs.

67
Q

Virus vs Worm

A

Viruses are attached to infected files and must
be activated by the user; worms can operate independently.

68
Q

Phishing

A

Directs users to unrelated sites and tricks the user into giving personal data (PII, bank and credit card details). Disguised as a trusted website but its not!!!

69
Q

Keylogging

A

Program that records every keystroke made by computer to gain access to passwords.

Security software cannot detect hardware keyloggers.

70
Q

Rogue Access Point

A

wireless access point that can be intercepted and give unauthorized access to secure network

AP CSP (1 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions