WGU C949 Guías de estudio, Notas de estudios & Resúmenes

WGU C949 - Data Structures And Algorithms exam with 100% correct answers 2024 Algorithm efficiency - answertypically measured by the algorithm's computational complexity Computational complexity - answerthe amount of resources used by the algorithm. The most common resources considered are the runtime and memory usage. runtime complexity - answera function, T(N), that represents the number of constant time operations performed by the algorithm on an input of size N Space-complexity (of...

WGU C949 - Data Structures And Algorithms exam with 100% correct answers 2024 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), wh...

WGU C949 - Data Structures And Algorithms exam with 100% correct answers 2024 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 alg...

WGU C949 Terminology Exam With 100% Correct Answers 2024 record - answerdata structure that stores subitems, with a name associated with each subitem array - answera data structure that stores an ordered list of items, with each item is directly accessible by a positional index homogeneous data elements linked list - answerdata structure that stores *ordered* list of items in nodes, where each node stores data and has a pointer to the next node; can have multiple subitems binary tree - a...

WGU C949 Terminology Exam With 100% Correct Answers 2024 record - answerdata structure that stores subitems, with a name associated with each subitem array - answera data structure that stores an ordered list of items, with each item is directly accessible by a positional index homogeneous data elements linked list - answerdata structure that stores *ordered* list of items in nodes, where each node stores data and has a pointer to the next node; can have multiple subitems binary tree - a...

WGU C949 - Data Structures And Algorithms exam with 100% correct answers 2024 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 alg...

WGU C949 - Data Structures And Algorithms exam with 100% correct answers 2024 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), wh...

WGU C949 - Data Structures And Algorithms exam with 100% correct answers 2024 Algorithm efficiency - answertypically measured by the algorithm's computational complexity Computational complexity - answerthe amount of resources used by the algorithm. The most common resources considered are the runtime and memory usage. runtime complexity - answera function, T(N), that represents the number of constant time operations performed by the algorithm on an input of size N Space-complexity (of...

WGU C949 - Data Structures And Algorithms exam with 100% correct answers 2024 Which statement describes a queue data structure? - answerIt 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. Which data structure allows inserting and deleting data elements at both the front and the rear? - answerDeques Which data structure allows elements to be inserted and deleted from one end and provides no direct access...