stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
2023 AP CSP Mock Exam Practice Part I Flashcards | StudBud
Explore
/
2023 AP CSP Mock Exam Practice Part I
2023 AP CSP Mock Exam Practice Part I
98 terms
·
StudBud Administration
·
29 plays
Practice Exam for AP CSP based on questions from the 2023 Exam.
Flashcards
98 cards
F
Practice quiz
P
Host live
L
Questions
98
Answers
1
A strictly black-and-white image has greater storage requirements than an image represented using a gray scale.
False
True
2
The first electronic programmable computer, ENIAC, was completed just after World War II.
True
False
3
The _________ revolution enabled us to implement algorithms that automated the drudgery of repetitive mental tasks.
technological
computer
designer
industrial
4
Generally, it is difficult to intercept transmissions and gain unauthorized access to wireless networks.
False
True
5
To create a loop that executes exactly
b
times, we create a ________.
counter
counting method
variable
control object
6
A symmetric encryption algorithm requires the use of a secret key known to both the sender and receiver.
False
True
7
_______ is the process of translating the detailed designs into computer code.
Translating
Coding
Configuring
Interpreting
8
Having an infinite loop in an algorithm is an error.
False
True
9
The way information is entered at a keyboard & displayed on a screen is known as the ________ ___________ of information
internal representation
external representation
10
At its most basic level, computer science is the study of algorithms.
False
True
11
What is wrong with the following algorithm?1. Set X to be 1 2. Increment X 3. Print X 4. If X > 0, repeat from 2
It is not well ordered.
It does not halt in a finite amount of time.
It does not produce a result.
It is ambiguous.
12
Asymmetric encryption algorithm, also called a public key encryption algorithm, the key for encryption & decryption.
True
False
13
Unlike the Pasculine, Leibniz’s Wheel could carry out addition, subtraction, multiplication, and division.
True
False
14
UNICODE is able to encode a total of _________ different characters.
65,536
512
64
256
15
Pseudo code is a set of English language constructs designed to resemble the statements in a programming language
False
True
16
In the early 1980s, TCP/IP was used only in the United States.
True
False
17
Any whole number that can be represented in base 10 can also be represented in base 2, although it may take ____ digits.
2
10
more
fewer
18
In an analog representation, objects can take on
any
values.
True
False
19
_______ ___________ involves the fixing of errors that are uncovered through repeated usage with different input values.
Data clean up
Recycling
Garbarge collection
Program maintenance
20
High-level languages must be translated into machine language before they can be executed.
True
False
21
Binary search is able to search any kind of list, as long as its not been sorted and in alphanumeric or numbered order.
False
True
22
Computer science is the study of how to write computer programs.
True
False
23
The if/then/else operation is a conditional statement.
True
False
24
The decimal-to-binary algorithm is based on successive divisions by 2.
False
True
25
An overflow error occurs when an operation in a computer produces an integer that exceeds the max space allowable.
False
True
26
All conceivable problems can be solved algorithmically.
False
True
27
One of the most powerful features of a computer is its ability to handle loops.
False
True
28
Efficiency is the algorithmic equivalence of miles per gallon or use of space in cars.
False
True
29
Pseudocode is sometimes called a programming language without any details.
True
False
30
The Pascaline and Leibnitz’s Wheel are examples of early computers.
True
False
31
A(n) sequential algorithm executes its instructions in a straight line from top to bottom and then stops.
False
True
32
The three basic sequential operations are called addition, multiplication, and exponentiation.
True
False
33
Designing programming languages and translating algorithms into these languages is known as ____ realization.
programming language
interpreter
compiler
linguistic
34
In CS, it is not simply the construction of a high-quality _________ that is important but also the methods it embodies.
storage device
program
processor
Memory module
35
A single webpage is identified by a symbolic string called a(n) URL, (Uniform Resource Locator).
False
True
36
The evolution of computer science began before the development of the first computer system.
True
False
37
In the ________ search algorithm, the worst case occurs when the value being searched for is the last value in the list.
binary
bubble
shuffle
sequential
38
Which of the following expressions represents the value stored in the variable x as a result of executing the program?
2 * 4 * 4 * 4
2 * 3 * 3 * 3 * 3
2 * 4 * 4 * 4 * 4
2 * 3 * 3 * 3
39
(n) ____ is a set of independent computer systems connected by tele links for the purpose of sharing info and resources.
computer network
internetwork
computer group
router
40
Phishing comes about because perpetrators cast out bait, in the form of email messages, to bait many potential victims.
False
True
41
Each low-level language supports if statements and while loops.
False
True
42
WiFi is great to communicate with a nearby router, but can't provide mobile Internet access far from base router station
False
True
43
The statement “If the mixture is too dry, then add 1/2 cup of water to the bowl” is an example of an iterative operation
False
True
44
A ______ is a collection of useful, prewritten algorithms.
binary
set
library
primitive
45
Binary search uses significantly more space than sequential search.
True
False
46
_________________ statements are the “question-asking” operations of an algorithm.
Primitive
Iterative
Conditional
Sequential
47
Mechanical devices for performing complex calculations existed prior to the twentieth century.
False
True
48
The individual computers on the network are referred to as
node(s)
.
True
False
49
_____ compressed data in a way that doesn't guarantee all info in the original data can be fully & completely recreated.
Lossless
Randomized
Itemized
Lossy
50
A pattern-matching algorithm may be used to implement a _____ function in a word processor.
replace
find
table
multiplication
51
Input and output enable the computing agent to communicate with the outside world.
False
True
52
Algorithms usually contain a set of instructions to be executed in a specific order.
True
False
53
With a natural language, different readers can interpret the same sentence in totally different ways.
False
True
54
Placing a list of items into alphabetical or numerical order is called _________.
simplifying
sorting
pattern matching
searching
55
Once an algorithm has been developed, it cannot be used in the construction of other algorithms.
False
True
56
Pseudocode is not a formal language with rigidly standardized syntactic rules and regulations.
False
True
57
The amplitude of a sound wave is a measure of its ________.
loudness
period
wavelength
frequency
58
According to Norman Gibbs’s & Allen Tucker’s definition of computer science, the central concept in CS is the algorithm.
False
True
59
Java and C++ are examples of pseudocode languages.
True
False
60
The study of the __________ of algorithms is called the analysis of algorithms.
implementation
complexity
design
efficiency
61
An algorithm can fall into an infinite loop when ___________________________.
the algorithm uses more than one loop
the continuation condition of the loop never becomes false
the output operations are missing
the input operations are missing
62
Connects hardware devices such as computers, printers, and storage devices that are all in close proximity.
metro area network
wide area network
local area network
proximity network
63
“Print the value of
product
” is an example of a(n) ________ operation.
input
output
conditional
sequential
64
The NSF planned and built a national network called NSFNet, which used TCP/IP technology identical to the ARPANET.
True
False
65
The software translator used to convert high-level language instructions into machine language instructions is called
editor
compiler
loader
locator
66
In the line of pseudocode, “Set the value of Area to length × width,” “Area” is a _______.
Constant
Value
Primitive
Variable
67
Information is stored in the memory of a computer using the binary numbering system.
True
False
68
In 1672, a French philosopher & mathematician designed and built one of the first mechanical calculators named ________.
Leibniz Wheel
Abacus
Pascaline
TI-85
69
A WAN connects devices that are not in close proximity but rather are across town, across the country or ocean.
True
False
70
The Boolean NOT is a unary operator.
False
True
71
_________ is an example of a natural language.
Python
C
Java
English
72
The WWWeb was completed and made available to all researchers at CERN in August 1991, marking the birth of the web.
False
True
73
There are 2
30
bytes in a _______.
terabyte
gigabyte
kilobyte
petabyte
74
Algorithms are exclusive to the field of computer science.
True
False
75
Encryption is the method in which data are protected during a transaction.
False
True
76
An unstructured, “natural language” writing style should never be used for writing algorithms.
False
True
77
A ______ is the repetition of a block of instructions.
cycle
nucleus
matrix
loop
78
A(n) _____________ is an algorithmic operation that carries out a single numeric computation and stores the result.
expression
constant
variable
computation
79
The _____ case of an algorithm requires the least work.
smallest
worst
larget
best
80
An operation that is ___________ is called a primitive operation of the computing agent carrying out the algorithm.
unambiguous
complementary
primary
basic
81
With sequential search, the smaller the list of items, the less work must be done to search it. ________________________
True
False
82
The three types of operations used to construct algorithms are sequential, conditional, and iterative.
True
False
83
Analog signals must first be digitized to be stored in the computer.
True
False
84
The use of high-level instructions during the design process is an example of abstraction.
False
True
85
Ultra-large-scale integrated circuits are fifth-generation innovation in computing.
False
True
86
An algorithm may be too _____________ to be of any use.
offensive
difficult to create
difficult to read
inefficient
87
First and foremost, we expect
correctness
from our algorithms.
True
False
88
A purely ____________ algorithm is sometimes termed a straight-line algorithm.
conditional
control
sequential
iterative
89
The discovery by Gödel places a limit on the capabilities of computers and computer scientists.
False
True
90
Authentication is the process of verifying the identity of the receiver of the data.
False
True
91
The acronym ____ is frequently used to refer to the memory unit of a computer.
RAM
DVD
ROM
CD
92
Sometimes the word hacker is used to denote a person who breaks into someone else’s computer.
True
False
93
The voice-oriented dial-up telephone network was originally a(n) ____ medium.
digital
electrical
mechanical
analog
94
ASCII is able to encode a total of _____ different symbols.
512
65,536
256
64
95
An integrated circuit, also known as a chip, is mounted on a circuit board.
True
False
96
The __________ _____ are the devices that allow a computer system to communicate and interact with the outside world.
input/output units
registers
arithmetic/logic units
control units
97
A(n) ____ is a distinct point located on an image’s surface.
amplitude
pixel
pitch
bit
98
The
Mark I, Harvard Mark
was the first computing device to use the base-2 binary numbering system.
False
True