WGU C949 Exam Review
A set of instructions followed step by step
Algorithm
to solve a problem
1. Clear & unambiguous
2. Well-defined inputs
3. Well-defined outputs
Characteristics of an Algorithm what will be produced?
4. Finite-ness
5. Feasible
6. Language independent
1. Modularity (can be broken down)
2. Correctness
3. Maintainability (no major changes
when redefining the algorithm)
4. Functionality
Factors of an Algorithm 5. Robustness (ability to define problem
clearly)
6. User friendly
7. Simplicity
8. Extensibility (Future developers can
understand it & build upon it)
Which factor takes the ability to easily
maintainability
update an algorithm into consideration?
What is a high-level consideration in an
simplicity
algorithm's design?
things you'd consider before implement-
Prior analysis ing an algorithm, such as processing
speed
Post analysis happens after implementation
-Brute-force algorithm
-Searching algorithm
-Sorting algorithm
Types of Algorithms -Recursive algorithm
-Backtracking algorithm
-Divide & conquer algorithm
-Greedy algorithm
, WGU C949 Exam Review
-Dynamic programming algorithm
-Randomized algorithm
an algorithm that tries all possible solu-
Brute Force Algorithm
tions in order then chooses the best one
Example of searching algorithms linear search and binary search
Starts from the beginning of a list &
checks each element until the search key
Linear Search Algorithm
is found or the end of the list is reached.
Data can be sorted or unsorted
starts at the middle of a sorted data set of
numbers and eliminates half of the data;
Binary Search Algorithm this process repeats until the desired val-
ue is found or all elements have been
eliminated
Bubble Sort
Selection Sort
Insertion Sort
Sorting Algorithms
Quick Sort
Merge Sort
RADIX
Compares elements that are side by
side & determine if the left element is
greater than the right element. If so, it
Bubble Sort Algorithm swaps them and continues to compare
elements until it reaches the end of the
list. The largest # is "bubbled" to the top
of the list
finds the lowest value in an array &
moves it to the front of an array
Selection Sort Algorithm Uses a sorted & unsorted list
*nested loop
Takes 2 elements & moves them to a
sorted list, sorts them least to greatest,
Insertion Sort Algorithm
then goes back to the unsorted list &
keeps moving elements down to the sort-
A set of instructions followed step by step
Algorithm
to solve a problem
1. Clear & unambiguous
2. Well-defined inputs
3. Well-defined outputs
Characteristics of an Algorithm what will be produced?
4. Finite-ness
5. Feasible
6. Language independent
1. Modularity (can be broken down)
2. Correctness
3. Maintainability (no major changes
when redefining the algorithm)
4. Functionality
Factors of an Algorithm 5. Robustness (ability to define problem
clearly)
6. User friendly
7. Simplicity
8. Extensibility (Future developers can
understand it & build upon it)
Which factor takes the ability to easily
maintainability
update an algorithm into consideration?
What is a high-level consideration in an
simplicity
algorithm's design?
things you'd consider before implement-
Prior analysis ing an algorithm, such as processing
speed
Post analysis happens after implementation
-Brute-force algorithm
-Searching algorithm
-Sorting algorithm
Types of Algorithms -Recursive algorithm
-Backtracking algorithm
-Divide & conquer algorithm
-Greedy algorithm
, WGU C949 Exam Review
-Dynamic programming algorithm
-Randomized algorithm
an algorithm that tries all possible solu-
Brute Force Algorithm
tions in order then chooses the best one
Example of searching algorithms linear search and binary search
Starts from the beginning of a list &
checks each element until the search key
Linear Search Algorithm
is found or the end of the list is reached.
Data can be sorted or unsorted
starts at the middle of a sorted data set of
numbers and eliminates half of the data;
Binary Search Algorithm this process repeats until the desired val-
ue is found or all elements have been
eliminated
Bubble Sort
Selection Sort
Insertion Sort
Sorting Algorithms
Quick Sort
Merge Sort
RADIX
Compares elements that are side by
side & determine if the left element is
greater than the right element. If so, it
Bubble Sort Algorithm swaps them and continues to compare
elements until it reaches the end of the
list. The largest # is "bubbled" to the top
of the list
finds the lowest value in an array &
moves it to the front of an array
Selection Sort Algorithm Uses a sorted & unsorted list
*nested loop
Takes 2 elements & moves them to a
sorted list, sorts them least to greatest,
Insertion Sort Algorithm
then goes back to the unsorted list &
keeps moving elements down to the sort-
