CIS 22C CH 4 TEST BANK QUESTIONS AND
VERIFIED ANSWERS.
Time, complexity, is, typically, more, important, than, space, complexity, , ANS, -, , True
An, inverse, relationship, often, exists, between, the, time, complexity, and, space, complexity, of, an,
algorithm., , ANS, -, , True
., Reformulating, an, algorithm, to, run, faster, most, likely, has, no, effect, on, the, space, requirements., ,
ANS, -, , False
You, cannot, compute, the, actual, time, requirement, of, an, algorithm., , ANS, -, , True
You, cannot, predict, the, behavior, of, an, algorithm, without, implementing, it, and, timing, the, code, ,
ANS, -, , False
In, algorithm, analysis,, the, general, behavior, of, the, algorithm, is, more, important, than, the, exact,
count, of, operations., , ANS, -, , True
An, algorithm's, basic, operation, is, always, the, most, frequent, operation, performed, , ANS, -, , True
Ignoring, operations, that, are, not, basic, will, not, affect, the, final, conclusion, about, algorithm, speed., ,
ANS, -, , True
For, large, values, of, n,, the, grown, rate, of, n, 2, is, smaller, than, n, log, n., , ANS, -, , False
For, large, values, of, n,, the, growth, rate, of, n!, is, larger, than, 2, n, , ANS, -, , True
The, behavior, of, a, logarithmic, function, is, the, same, regardless, of, its, base., , ANS, -, , True
, You, want, the, upper, bound, on, f(n), to, be, a, large, as, possible, , ANS, -, , False
All, of, the, operations, for, the, fixed-size, array-based, bag, ADT, have, the, same, Big-O, time, complexity,
as, the, linked-based, bag, ADT., , ANS, -, , False
When, you, write, a, program, for, an, algorithm, and, it, is, taking, much, longer, than, expected, you,
should,
a., try, to, design, a, better, algorithm,
b., buy, a, faster, computer,
c., rewrite, the, algorithm, in, a, different, language, d., ignore, the, problem, , ANS, -, , try, to, design, a,
better, algorithm
A, program's, execution, time, depends, in, part, on, a., the, speed, of, the, computer, it, is, running, on,
b., the, memory, capacity,
c., the, language, the, algorithm, is, written, in,
d., all, of, the, above, , ANS, -, , all, of, the, above
An, algorithm, has,
a., time, requirements,
b., space, requirements,
c., both, a, &, b,
d., none, of, the, above, , ANS, -, , both, a, &, b
The, memory, required, to, run, an, algorithm, is, called,
a., space, complexity,
b., memory, complexity,
c., time, complexity,
d., storage, complexity, , ANS, -, , space, complexity
A, measure, of, an, algorithm's, execution, needs, is, called,
VERIFIED ANSWERS.
Time, complexity, is, typically, more, important, than, space, complexity, , ANS, -, , True
An, inverse, relationship, often, exists, between, the, time, complexity, and, space, complexity, of, an,
algorithm., , ANS, -, , True
., Reformulating, an, algorithm, to, run, faster, most, likely, has, no, effect, on, the, space, requirements., ,
ANS, -, , False
You, cannot, compute, the, actual, time, requirement, of, an, algorithm., , ANS, -, , True
You, cannot, predict, the, behavior, of, an, algorithm, without, implementing, it, and, timing, the, code, ,
ANS, -, , False
In, algorithm, analysis,, the, general, behavior, of, the, algorithm, is, more, important, than, the, exact,
count, of, operations., , ANS, -, , True
An, algorithm's, basic, operation, is, always, the, most, frequent, operation, performed, , ANS, -, , True
Ignoring, operations, that, are, not, basic, will, not, affect, the, final, conclusion, about, algorithm, speed., ,
ANS, -, , True
For, large, values, of, n,, the, grown, rate, of, n, 2, is, smaller, than, n, log, n., , ANS, -, , False
For, large, values, of, n,, the, growth, rate, of, n!, is, larger, than, 2, n, , ANS, -, , True
The, behavior, of, a, logarithmic, function, is, the, same, regardless, of, its, base., , ANS, -, , True
, You, want, the, upper, bound, on, f(n), to, be, a, large, as, possible, , ANS, -, , False
All, of, the, operations, for, the, fixed-size, array-based, bag, ADT, have, the, same, Big-O, time, complexity,
as, the, linked-based, bag, ADT., , ANS, -, , False
When, you, write, a, program, for, an, algorithm, and, it, is, taking, much, longer, than, expected, you,
should,
a., try, to, design, a, better, algorithm,
b., buy, a, faster, computer,
c., rewrite, the, algorithm, in, a, different, language, d., ignore, the, problem, , ANS, -, , try, to, design, a,
better, algorithm
A, program's, execution, time, depends, in, part, on, a., the, speed, of, the, computer, it, is, running, on,
b., the, memory, capacity,
c., the, language, the, algorithm, is, written, in,
d., all, of, the, above, , ANS, -, , all, of, the, above
An, algorithm, has,
a., time, requirements,
b., space, requirements,
c., both, a, &, b,
d., none, of, the, above, , ANS, -, , both, a, &, b
The, memory, required, to, run, an, algorithm, is, called,
a., space, complexity,
b., memory, complexity,
c., time, complexity,
d., storage, complexity, , ANS, -, , space, complexity
A, measure, of, an, algorithm's, execution, needs, is, called,
