WGU C949 (C949) (C949)

WGU C949 Objective Assessment (Latest 2023/ 2024) Data Structures and Algorithms I |Version 2| Questions and Verified Answers| 100% Correct| Grade A Q: Which data structure is used to implement a priority queue? a. Queue b. Stack c. Heap d. Linked List Answer: Heap Q: Which sorting algorithm has the best worst-case time complexity of O(n log n)? a. Bubble Sort b. Merge Sort c. Selection Sort d. Insertion Sort Answer: Merge Sort Q: In a binary search tree (BST), what i...

WGU C949 Objective Assessment (Latest 2023/ 2024) Data Structures and Algorithms I |Version 1| Questions and Verified Answers| 100% Correct| Grade A Q: Which data type is appropriate for this array to store the given data? a = ["AF", "71", "BC", "157", "BA", "253"] Answer: String Q: Which data type is appropriate for the given data set? a = [1, 717, 23, 12, 314, 6] Answer: Int Q: Which data type should be used for this object? days = { "Sunday", "Monday", "Tu...

WGU C949 Data Structures and Algorithms I Exam (New 2023/ 2024 Update) Questions and Verified Answers| 100% Correct| Grade A Q:UESTION A tree that maintains the simple property that a node's key is greater than or equal to the node's childrens' keys. Answer: max heap Q:UESTION A tree that maintains the simple property that a node's key is less than or equal to the node's childrens' keys. Answer: min heap Q:UESTION A data structure for representing ...

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 re...

WGU C949 Objective Assessment V1 (New 2023/ 2024) Data Structures and Algorithms I | Questions and Verified Answers| 100% Correct| Grade A Q:UESTION Which sequence of letters represents preorder traversal of the nodes of this tree? A / B C / / D E / F G H / I Answer: A B C D F E G I H Q:UESTION An array soc of size 1009 is used where the index is an integer in [0,1008] and the hash-function key%1009. Where will the data assoc...

WGU C949 Objective Assessment V2 (New 2023/ 2024) Data Structures and Algorithms I | Questions and Verified Answers| 100% Correct| Grade A Q:UESTION Which technique involves reducing a problem to smaller subproblems and solving them recursively? a. Greedy technique b. Divide and conquer c. Backtracking d. Dynamic programming Answer: Divide and conquer Q:UESTION What is the purpose of an algorithm's pseudocode? a. To serve as an executable program b. To provide a f...

WGU C949 Pre-Assessment (New 2023/ 2024) Data Structures and Algorithms I| Questions and Verified Answers| 100% Correct| Grade A Q:UESTION Which data structure is used to store unordered items by mapping each item to a location in an array? Answer: Hash table Q:UESTION What is the advantage that a linked list has over an array? Answer: Grows and shrinks as needed Q:UESTION What would be the best data structure for a hash table with simple chain- ing? An...

What is the Big O Time Complexity of Selection Sort O(n^2) What is the Big O Time Complexity of Insertion Sort O(n^2) What is the Big O Time Complexity of Bubble Sort O(n^2) What is the Big O Time Complexity of Merge Sort O(n log n) What is the Big O Time Complexity of Quick Sort O(n log n) What is the Big O Time Complexity of Heap Sort O(n log n) What is the Big O Time Complexity of Radix Sort O(nk), where k is the number of digits in the largest number in the array

Which statement describes a queue data structure? It is a sequence of elements in which insertions can take place only at the back end and deletions can take place only at the front end. What are the official indexes for the list list01 given this declaration? int[ ] list01 = {0, 2, 4, 6, 8, 10}; 0, 1, 2, 3, 4, 5 Which abstract data type (ADT) has elements of the same type so that the elements can be retrieved based on the index or position? List Which category of data does ("FB", 75.00,...

D Which statement describes a queue data structure? A.) It is a sequence of elements in which insertion and deletion takes place at one end. B.) It is a sequence of elements in which insertion and deletion takes place at both ends. C.) It is a sequence of elements in which insertion can take place anywhere in the sequence and deletion takes place only at the front. D.) It is a sequence of elements in which insertions can take place only at the back end and deletions can take place only at...

A functions whose cost scales linearly with the size of the input O(n) Iterating over a collection of data once often indicates an ______ algorithm. (alphabet for-loop example) O(n) A functions whose cost scales logarithmically with the input size O(log n) Which type of function works by breaking down large problem into smaller and smaller chunks? O(log n) As the size of the input grows the cost of the algorithm does not increase at the same rate. The overall cost of performing an opera...