WGU C949 Data Structures and Algorithms I Exam test preparation Questions and Must have marking scheme Updated version 2024/2025
1 view 0 purchase
Course
WGU C949 Data Structure and Algorithm
Institution
WGU C949 Data Structure And Algorithm
WGU C949 Data Structures and Algorithms I Exam test preparation Questions and Must have marking scheme Updated version 2024/2025
Binary search equation - correct answer log2(Size of elements) + 1
Selection sort - correct answer is a sorting algorithm that treats the input as two parts, a sort...
Selection sort - correct answer is a sorting algorithm that
treats the input as two parts, a sorted part and an unsorted part,
and repeatedly selects the proper next value to move from the
unsorted part to the end of the sorted part.
Selection sort, comparing sort times - correct answer A list
with twice as many elements requires 4 times as many
comparisons.
Insertion sort - correct answer is a sorting algorithm that
treats the input as two parts, a sorted part and an unsorted part,
and repeatedly inserts the next value from the unsorted part into
the correct location in the sorted part.
Insertion sort's typical runtime is - correct answer O(N^2)
A nearly sorted list - correct answer only contains a few
elements not in sorted order. Ex: (4, 5, 17, 25, 89, 14) is nearly
sorted having only one element not in sorted position.
,Shell sort - correct answer is a sorting algorithm that treats
the input as a collection of interleaved lists, and sorts each list
individually with a variant of the insertion sort algorithm.
Shell sort: Gap Value - correct answer The gap value equals
the number of interleaved lists.
Shellsort will properly sort an array using any collection of gap
values, provided the collection contains - correct answer True
Quicksort - correct answer is a sorting algorithm that
repeatedly partitions the input into low and high parts (each part
unsorted), and then recursively sorts each of those parts.
The quicksort algorithm's runtime - correct answer is
typically O(N log N)
Quicksort: Sorted partitions - correct answer The elements
within each part can be in any order once the algorithm
completes. The only requirement is that all elements in the left
partition are less than or equal to all elements in the right
partition.
Merge sort - correct answer is a sorting algorithm that
divides a list into two halves, recursively sorts each half, and
then merges the sorted halves to produce a sorted list. The
, recursive partitioning continues until a list of 1 element is
reached, as list of 1 element is already sorted.
Merge sort: Right Partition - correct answer Elements at
indices from j + 1 to k are in right partition.
Merge sort: Left Partition - correct answer Elements at
indices from i to j, inclusive, are in the left partition.
Merge sort: j = midpoint - correct answer j is the midpoint in
the list that divides the list into two halves.
The merge sort algorithm's runtime is - correct answer O(N
log N)
Bucket sort - correct answer is a numerical sorting algorithm
that distributes numbers into buckets, sorts each bucket with an
additional sorting algorithm, and then concatenates buckets
together to build the sorted result.
Bucket sort equation - correct answer 14 * 10 / (99 +1)
10 is the number of buckets you have, so it changes with how
many buckets you have.
Radix sort - correct answer is a sorting algorithm specifically
for an array of integers: The algorithm processes one digit at a
time starting with the least significant digit and ending with the
most significant. Two steps are needed for each digit. First, all
array elements are placed into buckets based on the current
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller KieranKent55. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $11.49. You're not tied to anything after your purchase.
