WGU C949 OBJECTIVE ASSESSMENT EXAM 2
COMPLETE QUESTIONS AND
◉ Definiteness. Answer: An algorithm needs to have exact
definitions for each step. Clear and straightforward directions
ensure that every step is understood and can be taken easily.
◉ Modularity. Answer: This feature was perfectly designed for the
algorithm if you are given a problem and break it down into small-
small modules or small-small steps, which is a basic definition of an
algorithm.
◉ Maintainability. Answer: Factor that states that the algorithm
should be designed in a straightforward, structured way so that
when you redefine the algorithm, no significant changes are made to
the algorithm.
◉ Robustness. Answer: Factor that refers to an algorithm's ability to
define your problem clearly.
◉ Extensibility. Answer: Factor that states if another algorithm
designer or programmer wants to use your algorithm.
, ◉ Searching Algorithm. Answer: A type of algorithm that is designed
to find a specific target within a dataset, enabling efficient retrieval
of information from sorted or unsorted collections.
◉ Sorting Algorithm. Answer: Aimed at arranging elements in a
specific order, like numerical or alphabetical, to enhance data
organization and retrieval.
◉ Linear Search. Answer: The simplest search algorithm that
iterates over a collection sequentially.
◉ O(V+E). Answer: Time Complexity of DFS and BFS.
◉ Depth First Search. Answer: Explores all nodes along a path, then
backtracks.
◉ Breadth First Search. Answer: Explores all nodes at present depth
before going to next level.
◉ Bubble Sort. Answer: A sort type that repeatedly swaps adjacent
elements if current > next.
◉ O(N^2). Answer: Bubble Sort Time Complexity
COMPLETE QUESTIONS AND
◉ Definiteness. Answer: An algorithm needs to have exact
definitions for each step. Clear and straightforward directions
ensure that every step is understood and can be taken easily.
◉ Modularity. Answer: This feature was perfectly designed for the
algorithm if you are given a problem and break it down into small-
small modules or small-small steps, which is a basic definition of an
algorithm.
◉ Maintainability. Answer: Factor that states that the algorithm
should be designed in a straightforward, structured way so that
when you redefine the algorithm, no significant changes are made to
the algorithm.
◉ Robustness. Answer: Factor that refers to an algorithm's ability to
define your problem clearly.
◉ Extensibility. Answer: Factor that states if another algorithm
designer or programmer wants to use your algorithm.
, ◉ Searching Algorithm. Answer: A type of algorithm that is designed
to find a specific target within a dataset, enabling efficient retrieval
of information from sorted or unsorted collections.
◉ Sorting Algorithm. Answer: Aimed at arranging elements in a
specific order, like numerical or alphabetical, to enhance data
organization and retrieval.
◉ Linear Search. Answer: The simplest search algorithm that
iterates over a collection sequentially.
◉ O(V+E). Answer: Time Complexity of DFS and BFS.
◉ Depth First Search. Answer: Explores all nodes along a path, then
backtracks.
◉ Breadth First Search. Answer: Explores all nodes at present depth
before going to next level.
◉ Bubble Sort. Answer: A sort type that repeatedly swaps adjacent
elements if current > next.
◉ O(N^2). Answer: Bubble Sort Time Complexity
