WGU C949 Objective Assessment (Latest 2023\/ 2024) Data Structures and Algorithms I |Version 2| Questions and Verified Answers| 100% Correct| Grade A<\/p>\n\n\n\n
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 is the property of the right child compared to the parent
node?
a. It is greater than the parent node. b. It is less than the parent node.
c. It is equal to the parent node.
d. There is no specific relationship.
Answer:
It is greater than the parent node.
Q: Which data structure is suitable for implementing a stack?
a. Array
b. Linked List c. Hash Table
d. Heap<\/p>\n\n\n\n
Answer:
Linked List
Q: Which algorithm is used to find the minimum spanning tree in a weighted graph?
a. Breadth-First Search (BFS)
b. Depth-First Search (DFS)
c. Dijkstra’s Algorithm
d. Prim’s Algorithm
Answer:
Prim’s Algorithm
Q: Which data structure allows efficient insertion, deletion, and retrieval op- erations with a
time complexity of O(1)?
a. Array
b. Linked List c. Hash Table
d. Stack
Answer:
Hash Table
Q: Which sorting algorithm works by repeatedly finding the maximum ele- ment and moving it
to the end?
a. Bubble Sort b. Quick Sort
c. Insertion Sort
d. Merge Sort
Answer:
Bubble Sort
Q: Which data structure is used to represent a hierarchical relationship be- tween elements with
a single parent and multiple children?
a. Stack b. Queue<\/p>\n\n\n\n
c. Linked List d. Tree
Answer:
Tree
Q: Which algorithm is used to traverse a binary tree in a post-order manner?
a. Depth-First Search (DFS)
b. Breadth-First Search (BFS)
c. Preorder Traversal
d. Postorder Traversal
Answer:
Postorder Traversal
Q: What is the purpose of analyzing algorithms?
a. To understand their implementation details b. To determine their runtime complexity
c. To optimize their memory usage
d. To improve their user interface
Answer:
To determine their runtime complexity
Q: Which of the following is NOT a characteristic of an algorithm?
a. Finiteness
b. Determinism c. Adaptability
d. Input and Output
Answer:
Adaptability
Q: What is the worst-case time complexity of a linear search algorithm?
a. O(1)
b. O(log n)
c. O(n)
d. O(n^2)
Powered by https:\/\/learnexams.com\/search\/study?query=<\/a><\/p>\n\n\n\n