WGU C949 – DATA STRUCTURES AND ALGORITHMS TEST
QUESTIONS AND 100% VERIFIED ANSWERS
According to the "First-In-First-Out" (FIFO) concept, which data structure is it?
a. Stack b. Line
c. Tree Queue d. Linked List
In the worst-case scenario, which sorting algorithm has an O(n^2) time
complexity?
Bubble sort, merge sort, quick sort, and insertion sort are the first three
methods.
Bubble Sorting
What is the left child's attribute in relation to the parent node in a binary search
tree (BST)?
It surpasses the parent node in size.
b. The parent node is greater than it.
c. The parent node is equal to it.
d. No particular relationship exists.
Compared to the parent node, it is smaller.
Which data structure allows insertion, deletion, and retrieval operations in
constant-time average-case?
A linked list, an array, a hash table, and a stack hash table
Which algorithm determines a graph's shortest path between nodes? a. BFS, or
breadth-first search; b. DFS, or depth-first search
d. The Algorithm of Dijkstra
d. The Bellman-Ford Method
Dijkstra's Method
, Which of the following data structures applies the "Last-In-First-Out" (LIFO)
principle?
a. Heap b. Stack c. Hash Table Stack d. Queue
Which sorting algorithm's average-case time complexity is the best?
Sorting via Bubble Sort, Selection Sort, Insertion Sort, and Quick Sort
Which data structure is predicated on an element-to-element hierarchy?
A stack, a queue, a linked list, and a tree
Which algorithm is used to navigate an in-order binary tree?
First-Depth Search (DFS) and First-Breadth Search (BFS)
c. Traversal in Preorder
d. Traversal of Inorder
Traversal of Inorder
When implementing a priority queue, which data structure is utilized?
Heap, Stack, Queue, and Linked List Heap
What sorting algorithm has the best O(n log n) worst-case time complexity?
Sorting via Bubble Sort, Merge Sort, Selection Sort, and Insertion Sort
What is the right child's property in relation to the parent node in a binary
search tree (BST)?
It surpasses the parent node in size.
b. The parent node is greater than it.
c. The parent node is equal to it.
d. No particular relationship exists.
It surpasses the parent node in size.
When implementing a stack, which data structure is appropriate?
Heap Linked List, Hash Table, Linked List, and Array
Which algorithm determines a weighted graph's smallest spanning tree?
a. BFS, or breadth-first search; b. DFS, or depth-first search
QUESTIONS AND 100% VERIFIED ANSWERS
According to the "First-In-First-Out" (FIFO) concept, which data structure is it?
a. Stack b. Line
c. Tree Queue d. Linked List
In the worst-case scenario, which sorting algorithm has an O(n^2) time
complexity?
Bubble sort, merge sort, quick sort, and insertion sort are the first three
methods.
Bubble Sorting
What is the left child's attribute in relation to the parent node in a binary search
tree (BST)?
It surpasses the parent node in size.
b. The parent node is greater than it.
c. The parent node is equal to it.
d. No particular relationship exists.
Compared to the parent node, it is smaller.
Which data structure allows insertion, deletion, and retrieval operations in
constant-time average-case?
A linked list, an array, a hash table, and a stack hash table
Which algorithm determines a graph's shortest path between nodes? a. BFS, or
breadth-first search; b. DFS, or depth-first search
d. The Algorithm of Dijkstra
d. The Bellman-Ford Method
Dijkstra's Method
, Which of the following data structures applies the "Last-In-First-Out" (LIFO)
principle?
a. Heap b. Stack c. Hash Table Stack d. Queue
Which sorting algorithm's average-case time complexity is the best?
Sorting via Bubble Sort, Selection Sort, Insertion Sort, and Quick Sort
Which data structure is predicated on an element-to-element hierarchy?
A stack, a queue, a linked list, and a tree
Which algorithm is used to navigate an in-order binary tree?
First-Depth Search (DFS) and First-Breadth Search (BFS)
c. Traversal in Preorder
d. Traversal of Inorder
Traversal of Inorder
When implementing a priority queue, which data structure is utilized?
Heap, Stack, Queue, and Linked List Heap
What sorting algorithm has the best O(n log n) worst-case time complexity?
Sorting via Bubble Sort, Merge Sort, Selection Sort, and Insertion Sort
What is the right child's property in relation to the parent node in a binary
search tree (BST)?
It surpasses the parent node in size.
b. The parent node is greater than it.
c. The parent node is equal to it.
d. No particular relationship exists.
It surpasses the parent node in size.
When implementing a stack, which data structure is appropriate?
Heap Linked List, Hash Table, Linked List, and Array
Which algorithm determines a weighted graph's smallest spanning tree?
a. BFS, or breadth-first search; b. DFS, or depth-first search
