WGU C949 DATA STRUCTURES AND ALGORITHMS I OBJECTIVE
ASSESSMENT EXAM 200 QUESTIONS AND CORRECT DETAILED
ANSWERS WITH RATIONALES (VERIFIED ANSWERS) |AGRADE
Question 1
Which of the following BEST describes an algorithm?
A) A way of organizing and storing data.
B) A sequence of steps to solve a computational problem.
C) A problem for which no known efficient solution exists.
D) The amount of resources used by a computational process.
Correct Answer: B) A sequence of steps to solve a computational problem.
Rationale: The text defines an algorithm as "a sequence of steps to solve a computational
problem or perform a calculation."
Question 2
An efficient algorithm is one whose runtime increases no more than ________ with respect
to the input size.
A) Linearly
B) Logarithmically
C) Exponentially
D) Polynomially
Correct Answer: D) Polynomially
Rationale: The text defines a polynomial time algorithm and states, "An efficient algorithm
is one whose runtime increases no more than polynomially with respect to the input size."
Question 3
Which search algorithm requires the list's elements to be sorted and directly accessible?
A) Linear Search
B) Breadth-First Search
C) Binary Search
D) Depth-First Search
Correct Answer: C) Binary Search
Rationale: The definition of Binary Search specifies that "The list's elements must be
sorted and directly accessible (such as an array)."
, Question 4
A set of computational problems for which no known efficient algorithm exists is referred
to as:
A) Polynomial time
B) NP-Complete
C) Linear
D) Logarithmic
Correct Answer: B) NP-Complete
Rationale: The text defines NP-Complete as "A set of problems for which no known
efficient algorithm exists."
Question 5
What is the primary purpose of Dijkstra's algorithm?
A) To sort a list of numbers efficiently.
B) To find the shortest path from a start vertex to all other vertices in a graph.
C) To search for an element in a sorted array.
D) To find the longest common substring between two strings.
Correct Answer: B) To find the shortest path from a start vertex to all other vertices in a
graph.
Rationale: The definition provided is that Dijkstra's Shortest Path "determines the shortest
path from a start vertex to each vertex in a graph."
Question 6
The amount of resources, such as runtime and memory, used by an algorithm is known as
its:
A) Efficiency
B) Computational complexity
C) Asymptotic notation
D) Lower bound
Correct Answer: B) Computational complexity
Rationale: Computational complexity is defined as "The amount of resources used by the
algorithm. The most common resources considered are the runtime and memory usage."
ASSESSMENT EXAM 200 QUESTIONS AND CORRECT DETAILED
ANSWERS WITH RATIONALES (VERIFIED ANSWERS) |AGRADE
Question 1
Which of the following BEST describes an algorithm?
A) A way of organizing and storing data.
B) A sequence of steps to solve a computational problem.
C) A problem for which no known efficient solution exists.
D) The amount of resources used by a computational process.
Correct Answer: B) A sequence of steps to solve a computational problem.
Rationale: The text defines an algorithm as "a sequence of steps to solve a computational
problem or perform a calculation."
Question 2
An efficient algorithm is one whose runtime increases no more than ________ with respect
to the input size.
A) Linearly
B) Logarithmically
C) Exponentially
D) Polynomially
Correct Answer: D) Polynomially
Rationale: The text defines a polynomial time algorithm and states, "An efficient algorithm
is one whose runtime increases no more than polynomially with respect to the input size."
Question 3
Which search algorithm requires the list's elements to be sorted and directly accessible?
A) Linear Search
B) Breadth-First Search
C) Binary Search
D) Depth-First Search
Correct Answer: C) Binary Search
Rationale: The definition of Binary Search specifies that "The list's elements must be
sorted and directly accessible (such as an array)."
, Question 4
A set of computational problems for which no known efficient algorithm exists is referred
to as:
A) Polynomial time
B) NP-Complete
C) Linear
D) Logarithmic
Correct Answer: B) NP-Complete
Rationale: The text defines NP-Complete as "A set of problems for which no known
efficient algorithm exists."
Question 5
What is the primary purpose of Dijkstra's algorithm?
A) To sort a list of numbers efficiently.
B) To find the shortest path from a start vertex to all other vertices in a graph.
C) To search for an element in a sorted array.
D) To find the longest common substring between two strings.
Correct Answer: B) To find the shortest path from a start vertex to all other vertices in a
graph.
Rationale: The definition provided is that Dijkstra's Shortest Path "determines the shortest
path from a start vertex to each vertex in a graph."
Question 6
The amount of resources, such as runtime and memory, used by an algorithm is known as
its:
A) Efficiency
B) Computational complexity
C) Asymptotic notation
D) Lower bound
Correct Answer: B) Computational complexity
Rationale: Computational complexity is defined as "The amount of resources used by the
algorithm. The most common resources considered are the runtime and memory usage."
