WGU C949 Data Structure and Algorithm Training Exam Questions and Approved Performance Metrics 2024/2025
2 views 0 purchase
Course
WGU C949 Data Structure and Algorithm
Institution
WGU C949 Data Structure And Algorithm
WGU C949 Data Structure and Algorithm Training Exam Questions and Approved Performance Metrics 2024/2025
What is the worst-case space complexity of getevent if n is the list's size and k is a constant?
S(n) = k - correct answer getevent(list, listsize) {
i = 0
evenslist = create new, empt...
WGU C949 Data Structure and Algorithm
Training Exam Questions and Approved
Performance Metrics 2024/2025
What is the worst-case space complexity of getevent if n is the
list's size and k is a constant?
S(n) = k - correct answer getevent(list, listsize) {
i=0
evenslist = create new, empty list
while (i < listsize) {
if (list[i] % 2 == 0)
add list[i] to evenslist
i=i+1
}
return evenslist
}
What is the best case auxiliary space complexity of getevent if n
3n - correct answer suppose an algorithm's best case runtime
complexity is t(n) = 3n + 6, and the algorithm's worst case
runtime is t(n) = 5n^2 + 7n
Which function is a lower bound for the algorithm?
,12n^2 - correct answer suppose an algorithm's best case
runtime complexity is t(n) = 3n + 6, and the algorithm's worst
case runtime is t(n) = 5n^2 + 7n
Which function is an upper bound for the algorithm?
True - correct answer suppose an algorithm's best case
runtime complexity is t(n) = 3n + 6, and the algorithm's worst
case runtime is t(n) = 5n^2 + 7n
5n^2 is an upper bound for the algorithm
True - correct answer 3n + 6 is a lower bound for the
algorithm
True - correct answer suppose t(n) = 2n^2 + n + 9
T(n) = o(n^2)
True - correct answer the statement below that assigns x with
y is a constant time operation
Y = 10
X=y
False - correct answer a loop is never a constant time
operation.
, - correct answer the three constant time operations in the
code below can collectively be considered 1 constant time
operation
, O(n) - correct answer which of the following big o notations is
equivalent to o(n + 9999)?
O(n) - correct answer which of the following big o notations is
equivalent to o(734 * n)?
O(n^3) - correct answer which of the following big o
notations is equivalent to o(12 * n + 6 * n^3 + 1000)?
O(n^2) - correct answer 10 * o(n^2)
O(n^2) - correct answer 10 + o(n^2)
O(n^3) - correct answer 3 * n * o(n^2)
O(n^3) - correct answer 2 * n^3 + o(n^2)
O(log(n)) - correct answer log_2(n)
Constant - correct answer o(5) has a ______ runtime
complexity.
Log linear - correct answer o(n log(n)) has a ________ runtime
complexity.
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 $12.49. You're not tied to anything after your purchase.
