WGU D278 Chapter 7 UPDATED ACTUAL
Exam Questions and CORRECT Answers
algorithm - CORRECT ANSWER - a sequence of steps that solves a problem, generating
correct output for any valid input values.
algorithm time efficiency - CORRECT ANSWER - The number of calculations required to
solve a problem.
algorithm - CORRECT ANSWER - describes a sequence of steps to solve a computational
problem or perform a calculation.
computational problem - CORRECT ANSWER - specifies an input, a question about the
input that can be answered using a computer, and the desired output.
NP-complete problems - CORRECT ANSWER - a set of problems for which no known
efficient algorithm exists.
Algorithm efficiency - CORRECT ANSWER - typically measured by the algorithm's
computational complexity.
Computational complexity - CORRECT ANSWER - the amount of resources used by the
algorithm.
runtime complexity - CORRECT ANSWER - a function, T(N), that represents the number
of constant time operations performed by the algorithm on an input of size N.
best case - CORRECT ANSWER - the scenario where the algorithm does the minimum
possible number of operations.
Exam Questions and CORRECT Answers
algorithm - CORRECT ANSWER - a sequence of steps that solves a problem, generating
correct output for any valid input values.
algorithm time efficiency - CORRECT ANSWER - The number of calculations required to
solve a problem.
algorithm - CORRECT ANSWER - describes a sequence of steps to solve a computational
problem or perform a calculation.
computational problem - CORRECT ANSWER - specifies an input, a question about the
input that can be answered using a computer, and the desired output.
NP-complete problems - CORRECT ANSWER - a set of problems for which no known
efficient algorithm exists.
Algorithm efficiency - CORRECT ANSWER - typically measured by the algorithm's
computational complexity.
Computational complexity - CORRECT ANSWER - the amount of resources used by the
algorithm.
runtime complexity - CORRECT ANSWER - a function, T(N), that represents the number
of constant time operations performed by the algorithm on an input of size N.
best case - CORRECT ANSWER - the scenario where the algorithm does the minimum
possible number of operations.
