WGU C949 (C949) (C949)
Western Governors University
All 15 results
Sort by
-
WGU C949 Data Structures and Algorithms I Exam (New 2023/ 2024 Update) Questions and Verified Answers| 100% Correct| Grade A
- Exam (elaborations) • 21 pages • 2023
- Available in package deal
-
- $10.49
- + learn more
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
- Exam (elaborations) • 28 pages • 2023
- Available in package deal
-
- $10.99
- + learn more
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
- Exam (elaborations) • 26 pages • 2023
- Available in package deal
-
- $10.99
- + learn more
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
- Exam (elaborations) • 21 pages • 2023
- Available in package deal
-
- $10.49
- + learn more
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
- Exam (elaborations) • 15 pages • 2023
- Available in package deal
-
- $10.49
- + learn more
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...
Too much month left at the end of the money?
-
WGU C949 Bundled Exams with Complete Solution | Verified | Everything you Need!!
- Package deal • 5 items • 2023
-
- $40.49
- + learn more
WGU C949 Bundled Exams with Complete Solution | Verified | Everything you Need!!
-
WGU C949 - Data Structure and Algorithm, Questions and answers, VERIFIED | 40 Pages
- Exam (elaborations) • 40 pages • 2023
- Available in package deal
-
- $20.49
- + learn more
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
-
WGU C949- Data Structures and Algorithms I, Questions and answers, (ACCURATE). VERIFIED | 45 Pages
- Exam (elaborations) • 45 pages • 2023
- Available in package deal
-
- $22.49
- + learn more
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,...
-
WGU C949 Data Structures and Algorithms Pre-Assessment - Multiple Choice, Questions and answers, ACCURATE | 35 Pages
- Exam (elaborations) • 35 pages • 2023
- Available in package deal
-
- $20.49
- + learn more
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...
-
WGU C949 Data Structures and Algorithms, Questions and answers, Rated A+
- Exam (elaborations) • 15 pages • 2023
- Available in package deal
-
- $15.49
- + learn more
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...
$6.50 for your textbook summary multiplied by 100 fellow students... Do the math: that's a lot of money! Don't be a thief of your own wallet and start uploading yours now. Discover all about earning on Stuvia