WGU C949 EXAM QUESTIONS WITH
100% CORRECT ANSWERS L LATEST
VERSION 2025/2026.
Finiteness - ANS An algorithm must always have a set number of steps before it ends.
Definiteness - ANS 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 - ANS 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 - ANS 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 - ANS Factor that refers to an algorithm's ability to define your problem clearly.
Extensibility - ANS Factor that states if another algorithm designer or programmer wants to
use your algorithm.
Searching Algorithm - ANS 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.
1 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED.
, Sorting Algorithm - ANS Aimed at arranging elements in a specific order, like numerical or
alphabetical, to enhance data organization and retrieval.
Linear Search - ANS The simplest search algorithm that iterates over a collection sequentially.
O(V+E) - ANS Time Complexity of DFS and BFS.
Depth First Search - ANS Explores all nodes along a path, then backtracks.
Breadth First Search - ANS Explores all nodes at present depth before going to next level.
Bubble Sort - ANS A sort type that repeatedly swaps adjacent elements if current > next.
O(N^2) - ANS Bubble Sort Time Complexity
Selection Sort - ANS Sort that treats input as two parts, sorted & unsorted. Compares first
value in sorted part to unsorted value. If unsorted < sorted, swap. Repeat.
O(n^2) - ANS Selection Sort Time Complexity
Insertion Sort - ANS A sort type that works by placing values from an unsorted section into
the correct location in a sorted section. Works well for small or nearly sorted lists.
O(N^2) - ANS Insertion Sort Time Complexity
Merge Sort - ANS A sort type that uses recursion to break list in half, sorts the halves, then
combines them again.
O(N Log N) - ANS Merge Sort Time Complexity
2 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED.
100% CORRECT ANSWERS L LATEST
VERSION 2025/2026.
Finiteness - ANS An algorithm must always have a set number of steps before it ends.
Definiteness - ANS 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 - ANS 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 - ANS 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 - ANS Factor that refers to an algorithm's ability to define your problem clearly.
Extensibility - ANS Factor that states if another algorithm designer or programmer wants to
use your algorithm.
Searching Algorithm - ANS 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.
1 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED.
, Sorting Algorithm - ANS Aimed at arranging elements in a specific order, like numerical or
alphabetical, to enhance data organization and retrieval.
Linear Search - ANS The simplest search algorithm that iterates over a collection sequentially.
O(V+E) - ANS Time Complexity of DFS and BFS.
Depth First Search - ANS Explores all nodes along a path, then backtracks.
Breadth First Search - ANS Explores all nodes at present depth before going to next level.
Bubble Sort - ANS A sort type that repeatedly swaps adjacent elements if current > next.
O(N^2) - ANS Bubble Sort Time Complexity
Selection Sort - ANS Sort that treats input as two parts, sorted & unsorted. Compares first
value in sorted part to unsorted value. If unsorted < sorted, swap. Repeat.
O(n^2) - ANS Selection Sort Time Complexity
Insertion Sort - ANS A sort type that works by placing values from an unsorted section into
the correct location in a sorted section. Works well for small or nearly sorted lists.
O(N^2) - ANS Insertion Sort Time Complexity
Merge Sort - ANS A sort type that uses recursion to break list in half, sorts the halves, then
combines them again.
O(N Log N) - ANS Merge Sort Time Complexity
2 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED.
