INVITATION TO COMPUTER SCIENCE 6TH EDITION BY SCHNEIDER – TEST BANK
To Purchase
this Complete Test Bank with Answers Click the link Below
https://tbzuiqe.com/product/invitation-to-computer-science-6th-edition-by-schneider-test-bank/
If face any problem or
Further information contact us At tbzuiqe@gmail.com
Sample
Test
Chapter 3: The Efficiency of Algorithms
TRUE/FALSE
1. The
properties that make better algorithms are very similar to the properties we
look for when purchasing a car.
2. The
time an algorithm takes on a particular machine is the best way for comparing
two algorithms that do the same task.
3. If we
were to run the sequential search algorithm many times, with random input
values occurring at various places in the list, we would find the average
number of comparisons done to be approximately n/2.
4. Sequential
search is an order-n algorithm
in the average case.
5. The
sequential search and selection sort algorithms are different methods to get
the same thing done.
6. The
selection sort algorithm can recognize whether or not the list is already
sorted at the beginning.
7. If an
Q(n2) algorithm and an Q(n) algorithm exist for the same task, then
for large enough n, the Q(n2) algorithm does more
work and takes longer to execute, regardless of the constant factors for
peripheral work.
8. Given
a sorted list, the sequential search algorithm is more efficient than the
binary search.
9. Binary
search uses significantly more space than sequential search.
10. No
one has yet found a solution algorithm that works in polynomial time, but
neither has anyone proved that such an algorithm does not exist.
MODIFIED TRUE/FALSE
1. First
and foremost, we expect elegance from our algorithms.
_________________________
2. In
the sequential search algorithm, the worst case occurs when
the value being searched for is the first value in the list.
_________________________
3. With
sequential search, the bigger the list of items, the more work
that must be done to search it. _________________________
4. The
shuffle-left algorithm is not space-efficient.
_________________________
5. A
collection of nodes and connecting edges is called a(n) vector.
_________________________
MULTIPLE CHOICE
1. ____
is the algorithmic equivalence of style.
|
a. |
Efficiency |
c. |
Aesthetics |
|
b. |
Elegance |
d. |
Complexity |
2. ____
involves the fixing of errors that are uncovered through repeated usage with
different input values.
|
a. |
Program maintenance |
c. |
Data cleanup |
|
b. |
Recycling |
d. |
Garbage collection |
3. ____
are useful for rating one machine against another and for rating how sensitive
a particular algorithm is with respect to variations in input on one particular
machine.
|
a. |
Time trials |
c. |
Comparison times |
|
b. |
Benchmarks |
d. |
Intensive tests |
4. The
study of the efficiency of algorithms is called the ____ of algorithms.
|
a. |
design |
c. |
implementation |
|
b. |
analysis |
d. |
testing |
5. In
the sequential search algorithm, the minimum amount of work is done if the value
being searched for is the ____ value in the list.
|
a. |
first |
c. |
middle |
|
b. |
second |
d. |
last |
6. The
____ case of an algorithm requires the least work.
|
a. |
best |
c. |
smallest |
|
b. |
worst |
d. |
largest |
7. In
the sequential search algorithm, the worst case occurs when the value being
searched for is the ____ value in the list.
|
a. |
first |
c. |
middle |
|
b. |
second |
d. |
last |
8. Placing
a list of items into alphabetical or numerical order is called ____.
|
a. |
simplifying |
c. |
sorting |
|
b. |
searching |
d. |
pattern matching |
9. The
____ sort algorithm performs the task of sorting a list by growing a sorted
subsection of the list from the back to the front.
|
a. |
selection |
c. |
shuffle-left |
|
b. |
sequential |
d. |
binary |
10. Selection
sort is a(n) ____ algorithm in all cases.
|
a. |
Q(1) |
c. |
Q(2n) |
|
b. |
Q(n) |
d. |
Q(n2) |
11. Sequential
search is a(n) ____ algorithm in the worst case.
|
a. |
Q(1) |
c. |
Q(2n) |
|
b. |
Q(n) |
d. |
Q(n2) |
12. Part
of the job of program ____ is to make clear any assumptions or restrictions
about the input size the program was designed to handle.
|
a. |
design |
c. |
documentation |
|
b. |
implementation |
d. |
maintenance |
13. The
shuffle-left algorithm is a(n) ____ algorithm in the worst case.
|
a. |
Q(1) |
c. |
Q(2n) |
|
b. |
Q(n) |
d. |
Q(n2) |
14. The
copy-over algorithm is ____ in time efficiency in the worst case.
|
a. |
Q(1) |
c. |
Q(2n) |
|
b. |
Q(n) |
d. |
Q(n2) |
15. The
worst case in binary search occurs ____.
|
a. |
when the object to be
searched is in the middle of the list |
|
b. |
when the object to be
searched is at the end of the list |
|
c. |
when the object to be
searched is at the beginning of the list |
|
d. |
when the object to be
searched is not in the list |
16. Binary
search does ____ comparisons in the worst case.
|
a. |
Q(1) |
c. |
Q(n) |
|
b. |
Q(lg n) |
d. |
Q(n2) |
17. Q(lg n), Q(n) and Q(n2) are
____ in the amount of work they do as n increases.
|
a. |
restricted |
c. |
polynomially bounded |
|
b. |
useful |
d. |
exponential |
18. An
____ algorithm is called an exponential algorithm.
|
a. |
Q(lg n) |
c. |
Q(n2) |
|
b. |
Q(n) |
d. |
Q(2n) |
19. Problems
for which no known polynomial solution algorithm exists are sometimes
approached via ____ algorithms.
|
a. |
alternative |
c. |
polynomial |
|
b. |
intractable |
d. |
approximation |
20. A
surprising number of problems fall into the “____” category.
|
a. |
suspected intractable |
c. |
bin-packing |
|
b. |
approximation algorithm |
d. |
declared intractable |
COMPLETION
1. ____________________
is the term to describe an algorithm’s careful use of resources.
2. The
number of comparisons done by the selection sort algorithm does not grow at the
same rate as the problem size n,
instead it grows at approximately the ____________________ of that rate.
3. The
converging-pointers algorithm is Q(n)
in the ____________________ case.
4. A(n)
____________________ is a path through a graph that begins and ends at the same
node and goes through all other nodes exactly once.
5. ____________________
problems are solvable, but the solution algorithms all require so much work as
to be virtually useless.
SHORT ANSWER
1. What
is the definition of order of magnitude n?
2. Explain
the sentence: The selection sort algorithm not only does comparisons; it also
does exchanges.
3. If an
algorithm is more time efficient and less space efficient, what is this called?
4. What
is the logarithm of n to the base 2?
5. How
do you approach problems for which no known polynomial solution algorithm
exists?
ESSAY
1. Discuss
at length the “people aspect” of the practical considerations for the
development of algorithms. Include the concepts of program maintenance and ease
of understanding in your response.
2. Discuss
at length the measurement of the time and space consumed by an algorithm in
order to determine its efficiency.
3. Given
the data cleanup problem described in the text, write the pseudocode for the
converging-pointers algorithm for data cleanup.
4. Discuss
at length how binary search operates.
5. Discuss
at length both the best and worst case of the pattern-matching algorithm.
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic,
and Gates
TRUE/FALSE
1. Information
is stored in the memory of a computer using the decimal numbering system.
2. Two’s
complement representation is a signed integer representation that does not
suffer from the problem of two zeros.
3. ASCII
mapping is the process of assigning a printable letter in our alphabet a unique
number.
4. A
strictly black/white image has greater storage requirements than an image
represented using a gray scale.
5. There
is no theoretical reason why one could not build a “decimal” computer, but
computers use binary representation for reasons of reliability.
6. The
emitter and collector are the two input lines of a transistor.
7. To
construct an AND gate, two transistors are connected in parallel.
8. Every
Boolean expression can be represented pictorially as a circuit diagram, and
every output value in a circuit diagram can be written as a Boolean expression.
9. The
sum-of-products algorithm always produces an optimal circuit.
10. A
multiplexor is a circuit that has 2N output
lines.
MODIFIED TRUE/FALSE
1. The binary-to-decimal algorithm
is based on successive divisions by 2. _________________________
2. After
we normalize a number, its first significant digit is immediately to the left of
the binary point. _________________________
3. In
a(n) analog representation, objects can take on any value.
_________________________
4. An
integrated circuit, also known as a(n) chip, is mounted on a
circuit board. _________________________
5. The
Boolean AND is a(n) unary operator. _________________________
COMPLETION
1. A(n)
____________________ is an error condition that occurs when an operation in a
computer produces an integer that exceeds the maximum allowable value.
2. ____________________
is the highness or lowness of a sound.
3. ____________________
signals must first be digitized to be stored in the computer.
4. To
construct an OR gate, two transistors are connected in ____________________.
5. Sequential
circuits contain ____________________ loops.
MULTIPLE CHOICE
1. The
way information is represented by humans and the way it is entered at the
keyboard is known as the ____ of information.
|
a. |
external representation |
c. |
user input |
|
b. |
internal representation |
d. |
user output |
2. Any
whole number that can be represented in base 10 can also be represented in base
2, although it may take ____ digits.
|
a. |
2 |
c. |
more |
|
b. |
10 |
d. |
fewer |
3. Using
the leftmost bit of a number to represent the sign, with 0 meaning positive and
1 meaning negative is termed ____ notation.
|
a. |
one’s complement |
c. |
sign/magnitude |
|
b. |
two’s complement |
d. |
unsigned |
4. ASCII
is able to encode a total of ____ different characters.
|
a. |
64 |
c. |
512 |
|
b. |
256 |
d. |
65,536 |
5. UNICODE
is able to encode a total of ____ different characters.
|
a. |
64 |
c. |
512 |
|
b. |
256 |
d. |
65,536 |
Comments
Post a Comment