WGU C949 Data structures and algorithms Frequently Tested Exam Questions With
Verified Multiple Choice and Conceptual Actual 100% Correct Detailed Answers
Guaranteed Pass!!Current Update!!
High-level languages encourage you to think more about
the problem domain and less about the execution plat-
form. There is less ceremony, so you can spend more time
on stutt that actually brings you value. Money. Cheaper
Why do we need a high level language? developers, faster development speeds, and less bugs
equal more money.
A high level language is easier to code in and therefore
less error prone.
A set of instructions for the computer to perform a task.
Program It can be stored in memory or downloaded from the inter-
net.
Though both Java float and Double can represent float-
ing-point numbers, we can consider a couple of things to
choose between Java float and double.
Though both Java float vs Double is approximate types, use
double if you need more precise and accurate results. Use
when do you use float instead of double?
float if you have memory constraint because it takes almost
half as much space as double. If your numbers cannot fit
in the range ottered by float, then use double. Though be
careful with floating-point calculation and representation,
don't use double or float for monetary calculation, instead
use Big Decimal.
What is selection? Making the program behave ditterently each time it runs.
In computer programming languages, a switch statement
is a type of selection control mechanism used to allow the
the switch statement
value of a variable or expression to change the control flow
of program execution via search and map.
, WGU C949 Data structures and algorithms Frequently Tested Exam Questions With
Verified Multiple Choice and Conceptual Actual 100% Correct Detailed Answers
Guaranteed Pass!!Current Update!!
A strategy to solve a problem in terms of
Designing algorithms 1. the actions to be executed
2. the order in which the actions are to be executed
generally used when the number of repetitions or itera-
tions is known in advance.
when do we use a for loop?
For example, you know there are 10 students in a class and
you want to calculate the average mark for them all.
What to do when the number of loops is not fixed? Use a while loop
A while loop causes the code inside it to be repeated until
What is the ditterence between a while loop and a for
some condition is satisfied.
loop?
A for loop is repeated for a fixed number of iterations.
Asymptotic notations are the mathematical notations used
to describe the running time of an algorithm when the
input tends towards a particular value or a limiting value.
For example: In bubble sort, when the input array is al-
ready sorted, the time taken by the algorithm is linear i.e.
the best case.
But, when the input array is in reverse condition, the al-
gorithm takes the maximum time (quadratic) to sort the
Asymptotic Notation elements i.e. the worst case.
When the input array is neither sorted nor in reverse order,
then it takes average time. These durations are denoted
using asymptotic notations.
There are mainly three asymptotic notations:
Big-O notation
Omega notation
Theta notation
What types of trees do you know?
,WGU C949 Data structures and algorithms Frequently Tested Exam Questions With
Verified Multiple Choice and Conceptual Actual 100% Correct Detailed Answers
Guaranteed Pass!!Current Update!!
Free trees
Binary
Positional trees
Rooted trees
Ordered trees
In a free tree there's no designated root vertex.
Define a free tree You can make a free tree into a rooted one by choosing
any of its vertices to be the root.
In graph theory, the basic definition of a tree is that it
is a connected graph without cycles. This definition does
not use any specific node as a root for the tree. A rooted
tree introduces a parent — child relationship between
the nodes and the notion of depth in the tree.
Define rooted tree Roughly and visually, adding a root to a tree just corre-
sponds to grabbing one of the nodes of the tree and
hanging the tree with this node. Once the tree is hanged,
each node has a depth related to its height, a parent to
which it is suspended and several children which hang
from this node.
a binary tree is a tree data structure in which each node
has at most two children, which are referred to as the left
child and the right child.
A tree is either empty or consists of a node containing
what is a binary and positional tree
a label value and an indexed sequence of zero or more
children, each a positional tree. If every node has two
positions, we have a binary tree and the children are its
left and right subtrees. Again, nodes are the parents of
their non-empty children.
, WGU C949 Data structures and algorithms Frequently Tested Exam Questions With
Verified Multiple Choice and Conceptual Actual 100% Correct Detailed Answers
Guaranteed Pass!!Current Update!!
How can you distinguish between binary trees and or- An ordered tree is an oriented tree in which the children
dered trees of a node are somehow "ordered."
Quicksort
Heapsort
What sorting algorithms do you know?
merge sort
insertion sort
Each item is take in turn, compared to the items in a sorted
list and placed in the correct position.
A simple sorting algorithm that builds the final sorted
array (or list) one item at time. It is much less eflcient
on large lists than more advanced algorithms such as
Insertion Sort quicksort, heapsort, or merge sort.
Insertion sort sorts in place and therefore uses less mem-
ory space. Though its asymptotic running time is O(n^2),
its code is very tight so the constant factor in the running
time is very small. Insertion sort is, therefore, an eflcient
algorithm for a small input size.
Sorts an array by cutting the array in half, recursively sort-
Merge Sort Algorithm
ing each half, and then merging the sorted halves
Insertion Sort Algorithm
Insertion Sort Worst Case O(n^2)
a sorting algorithm that inserts the values to be sorted into
Heapsort algorithm
a heap
Heapsort Worst Case n log n
Quick Sort Worst Case O(n^2)
Unstable, O(n log n) for a good pivot,O(n^2) for a bad piv-
ot Ω(n log n) : Uses partitioning O(n), Pick a median of 1st,
Verified Multiple Choice and Conceptual Actual 100% Correct Detailed Answers
Guaranteed Pass!!Current Update!!
High-level languages encourage you to think more about
the problem domain and less about the execution plat-
form. There is less ceremony, so you can spend more time
on stutt that actually brings you value. Money. Cheaper
Why do we need a high level language? developers, faster development speeds, and less bugs
equal more money.
A high level language is easier to code in and therefore
less error prone.
A set of instructions for the computer to perform a task.
Program It can be stored in memory or downloaded from the inter-
net.
Though both Java float and Double can represent float-
ing-point numbers, we can consider a couple of things to
choose between Java float and double.
Though both Java float vs Double is approximate types, use
double if you need more precise and accurate results. Use
when do you use float instead of double?
float if you have memory constraint because it takes almost
half as much space as double. If your numbers cannot fit
in the range ottered by float, then use double. Though be
careful with floating-point calculation and representation,
don't use double or float for monetary calculation, instead
use Big Decimal.
What is selection? Making the program behave ditterently each time it runs.
In computer programming languages, a switch statement
is a type of selection control mechanism used to allow the
the switch statement
value of a variable or expression to change the control flow
of program execution via search and map.
, WGU C949 Data structures and algorithms Frequently Tested Exam Questions With
Verified Multiple Choice and Conceptual Actual 100% Correct Detailed Answers
Guaranteed Pass!!Current Update!!
A strategy to solve a problem in terms of
Designing algorithms 1. the actions to be executed
2. the order in which the actions are to be executed
generally used when the number of repetitions or itera-
tions is known in advance.
when do we use a for loop?
For example, you know there are 10 students in a class and
you want to calculate the average mark for them all.
What to do when the number of loops is not fixed? Use a while loop
A while loop causes the code inside it to be repeated until
What is the ditterence between a while loop and a for
some condition is satisfied.
loop?
A for loop is repeated for a fixed number of iterations.
Asymptotic notations are the mathematical notations used
to describe the running time of an algorithm when the
input tends towards a particular value or a limiting value.
For example: In bubble sort, when the input array is al-
ready sorted, the time taken by the algorithm is linear i.e.
the best case.
But, when the input array is in reverse condition, the al-
gorithm takes the maximum time (quadratic) to sort the
Asymptotic Notation elements i.e. the worst case.
When the input array is neither sorted nor in reverse order,
then it takes average time. These durations are denoted
using asymptotic notations.
There are mainly three asymptotic notations:
Big-O notation
Omega notation
Theta notation
What types of trees do you know?
,WGU C949 Data structures and algorithms Frequently Tested Exam Questions With
Verified Multiple Choice and Conceptual Actual 100% Correct Detailed Answers
Guaranteed Pass!!Current Update!!
Free trees
Binary
Positional trees
Rooted trees
Ordered trees
In a free tree there's no designated root vertex.
Define a free tree You can make a free tree into a rooted one by choosing
any of its vertices to be the root.
In graph theory, the basic definition of a tree is that it
is a connected graph without cycles. This definition does
not use any specific node as a root for the tree. A rooted
tree introduces a parent — child relationship between
the nodes and the notion of depth in the tree.
Define rooted tree Roughly and visually, adding a root to a tree just corre-
sponds to grabbing one of the nodes of the tree and
hanging the tree with this node. Once the tree is hanged,
each node has a depth related to its height, a parent to
which it is suspended and several children which hang
from this node.
a binary tree is a tree data structure in which each node
has at most two children, which are referred to as the left
child and the right child.
A tree is either empty or consists of a node containing
what is a binary and positional tree
a label value and an indexed sequence of zero or more
children, each a positional tree. If every node has two
positions, we have a binary tree and the children are its
left and right subtrees. Again, nodes are the parents of
their non-empty children.
, WGU C949 Data structures and algorithms Frequently Tested Exam Questions With
Verified Multiple Choice and Conceptual Actual 100% Correct Detailed Answers
Guaranteed Pass!!Current Update!!
How can you distinguish between binary trees and or- An ordered tree is an oriented tree in which the children
dered trees of a node are somehow "ordered."
Quicksort
Heapsort
What sorting algorithms do you know?
merge sort
insertion sort
Each item is take in turn, compared to the items in a sorted
list and placed in the correct position.
A simple sorting algorithm that builds the final sorted
array (or list) one item at time. It is much less eflcient
on large lists than more advanced algorithms such as
Insertion Sort quicksort, heapsort, or merge sort.
Insertion sort sorts in place and therefore uses less mem-
ory space. Though its asymptotic running time is O(n^2),
its code is very tight so the constant factor in the running
time is very small. Insertion sort is, therefore, an eflcient
algorithm for a small input size.
Sorts an array by cutting the array in half, recursively sort-
Merge Sort Algorithm
ing each half, and then merging the sorted halves
Insertion Sort Algorithm
Insertion Sort Worst Case O(n^2)
a sorting algorithm that inserts the values to be sorted into
Heapsort algorithm
a heap
Heapsort Worst Case n log n
Quick Sort Worst Case O(n^2)
Unstable, O(n log n) for a good pivot,O(n^2) for a bad piv-
ot Ω(n log n) : Uses partitioning O(n), Pick a median of 1st,
