stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
Unit 6 Review Flashcards | StudBud
Explore
/
Unit 6 Review
Unit 6 Review
16 terms
·
StudBud Administration
·
14 plays
Review for Unit 6 Test
Flashcards
16 cards
F
Practice quiz
P
Host live
L
Questions
16
Answers
1
The written instructions for a new dance best demonstrates which of the following concepts
Selection
Heuristic
Iteration
Sequencing
2
The "Traveling Salesman" is an example of...
An efficiency problem
A decision problem
An undecidable problem
An optimization problem
3
Using the image, determine which of the following best describes these programs
Algorithm 1 draws rectangle Algorithm 2 draws square
Both are algorithms and draw a square
Algorithm 1 draws square Algorithm 2 draws rectangle
Neither are algorithms and draw a rectangle
4
What is the maximum number of iterations/checks needed to find an item that contains 15 inputs
4
3
2
5
5
Algorithms are constructed using combinations of sequencing, selection, and iteration
True
False
6
What is the maximum number of iterations/checks needed to find an item that contains 5 inputs
2
4
3
1
7
Every problem can be solved with an algorithm
True
False
8
Algorithms may have an infinite set of instructions
True
False
9
Which of the following best describes the algorithmic efficiency for A
Polynomial
Exponential
Linear
Constant
10
Which of the following best describes a situation where an absolute answer can't be solved in a reasonable time
Unreasonable algorithms may sometimes also be undecidable
Heuristics solve problems for which no reasonable algorithm exists
Algorithms that solve the same problem must also have the same efficiency
Approximate solutions are often identical to optimal solutions
11
Which of the following is a benefit of parallel and distributed computing?
Distributed computing typically requires fewer computers
Distributed computing can be used when parallel solutions are not possible
Distributed computing improves the speed an individual computer executes
Parallel computing scales more effectively than sequential computing
12
Algorithms must be expressed using a programming language
True
False
13
Which of the following algorithms is most efficient?
C
A
B
D
14
What is the maximum number of iterations/checks needed to find an item that contains 3 inputs
1
3
4
2
15
What is the maximum number of iterations/checks needed to find an item that contains 9 inputs
4
2
3
1
16
Which of the following is best for searching through unsorted data
Only Binary
Both Binary and Linear
Only Linear
Either Binary or Linear
