stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
AP CS Principles 1.1 Flashcards | StudBud
Explore
/
AP CS Principles 1.1
AP CS Principles 1.1
16 terms
·
StudBud Administration
·
344 plays
#PLTW 1.1 review
Flashcards
16 cards
F
Practice quiz
P
Host live
L
Questions
16
Answers
1
Data is transferred from one machine to another by following
programs
algorithms
protocols
executable code
2
1. Which of the following is an example of an IDE?
Lightbot command/procedure area
All of the Above
Cloud9 console
Scratch Stage, Costume and Sprite area
3
1. A collection of procedures that gives directions to the computer is called a(n)
executable file
algorithm
program
input
4
1. An IDE stands for
a. Internet Development Experience
c. Integrated Development Environment
b. iDevelExpress
c. Iterative Design Environment
5
Protocols evolve over time, although a particular version of a protocol does not change.
False
True
6
This picture is
web map
a state diagram
pseudo code
a doodle
7
This state diagram indicates the robot is
at position (7, 7)
at position (0, 0)
at position ( 7, 8)
at position 270.
8
Abstraction
reduces information and detail to simplify complex tasks
has no down side
introduces unacceptable errors at all levels
only applies to 1s and 0s
9
Hiding some details so the programmer can focus on an appropriate amount of complexity is
an abstration
accessibility
debugging
an algorithm
10
A Boolean expression
is used in the conditional of an if-statement
evaluates to either true or false
is named after George Boole
All are true
11
What provides a developer with the ability to create, run and debug a program all in one app?
program
operating system
IDE
computer
12
1. A variable that keeps track of the high score is a(n)
aggregator
flag
accumulator
best-so-far
13
This program structure performs the instructions multiple times as long as a condition is met.
Boolean condition
program
iteration
loop
14
Data that is used by a program is called
code
memory
variable
input
15
Figuring out why code doesn't work as expected and fixing errors so it does is called
programming
debugging
frustrating
hacking
16
1. A variable that tracks whether a specific condition or action occurred is called a(n)
aggregator
flag
best-so-far
accumulator