{"id":129384,"date":"2023-12-01T15:18:07","date_gmt":"2023-12-01T15:18:07","guid":{"rendered":"https:\/\/learnexams.com\/blog\/?p=129384"},"modified":"2023-12-01T15:18:08","modified_gmt":"2023-12-01T15:18:08","slug":"wgu-c949-data-structures-and-algorithms-i-exam-guide-new-2023-2024-update-questions-and-verified-answers-100-correct","status":"publish","type":"post","link":"https:\/\/www.learnexams.com\/blog\/2023\/12\/01\/wgu-c949-data-structures-and-algorithms-i-exam-guide-new-2023-2024-update-questions-and-verified-answers-100-correct\/","title":{"rendered":"WGU C949 Data Structures and Algorithms I Exam Guide (New 2023\/ 2024 Update) Questions and Verified Answers| 100% Correct"},"content":{"rendered":"\n

WGU C949 Data Structures and Algorithms I Exam Guide (New 2023\/ 2024 Update) Questions and Verified Answers| 100% Correct<\/p>\n\n\n\n

WGU C949 Data Structures and Algorithms
I Exam Guide (New 2023\/ 2024 Update)
Questions and Verified Answers| 100%
Correct
Q:UESTION
A is a “doubled-ended queue”
Answer:
deque
Q:UESTION
List
Answer:
ADT that has elements of the same type so that the elements can be retrieved based on index or
position
Q:UESTION
(high + low)\/2
Answer:
mid-values calculation for binary search. toCeil()
Q:UESTION
What is the effect on the object regarding garbage collection?
Computing obj = new Computing(); obj = null
Answer:
It is automatically available for garbage collection<\/p>\n\n\n\n

Q:UESTION
mutable
Answer:
open to or capable of change, fickle
Q:UESTION
immutable
Answer:
(adj.) not subject to change, constant
Q:UESTION
unique and immutable
Answer:
Characteristics of keys in associative dictionary data type
Q:UESTION
DictName[key].remove(value)
Answer:
method used to take a value out of a dictionary
Q:UESTION
Java.io.FileInputStream
Answer:
Java method used to read bytes from standard file
Q:UESTION<\/p>\n\n\n\n

Add(int index, Object x)
Answer:
Command that inserts object x at position index in a list.
Q:UESTION
Quick sort
Answer:
Values are “pivoted” in to the correct order. Sort function:<\/p>\n\n\n\n

\n

Avg: O(N log(N))
Worst: O(N\u00b2)
Q:UESTION
Bubble sort
Answer:
Values are swapped to make the largest value float to the top. Sort function:
Avg: O(N\u00b2)
Worst: O(N\u00b2)
Q:UESTION
Bucket sort
Answer:
Values are distributed into sets. Sort function:
Best: O(N+K)
Avg: O(N+K)
Worst: O(N\u00b2)
Space: O(NK)
Q:UESTION
what type of sort is this?
for i from 0 to N -1 if a[i] > a[i+1] swap(a[i], a[i +1] end for
Powered by https:\/\/learnexams.com\/search\/study?query=<\/a><\/p>\n\n\n\n