C949 - Data Structure and Algorithms Practice Test

C949 - Data Structure and Algorithms Practice Test Leave the first rating Students also studied Terms in this set (37) Western Governors UniversityC 949 Save WGU C949 Data Structures and Alg...102 terms bodiewoodPreview C949 WGU Terminology 72 terms VeraButlerPreview C949 Data Structures and Algorithm...173 terms AidenOSprague Preview

C949 D

70 terms Sha Which data structure follows the "First-In-First-Out" (FIFO) principle?

• Stack
• Queue
• Linked List
• Tree

Queue Which sorting algorithm has a worst-case time complexity of O(n^2)?

• Bubble Sort
• Merge Sort
• Quick Sort
• Insertion Sort

Bubble Sort In a binary search tree (BST), what is the property of the left child compared to the parent node?

• It is greater than the parent node.
• It is less than the parent node.
• It is equal to the parent node.
• There is no specific relationship.

It is less than the parent node.Which data structure provides constant-time average- case insertion, deletion, and retrieval operations?

• Array
• Linked List
• Hash Table
• Stack

Hash Table

Which algorithm is used to find the shortest path between nodes in a graph? a. Breadth-First Search (BFS)

• Depth-First Search (DFS)
• Dijkstra's Algorithm
• Bellman-Ford Algorithm

Dijkstra's Algorithm Which data structure uses the "Last-In-First-Out" (LIFO) principle?

• Queue
• Heap
• Stack
• Hash Table

Stack Which sorting algorithm has the best average-case time complexity?

• Bubble Sort
• Selection Sort
• Insertion Sort
• Quick Sort

Quick Sort Which data structure is based on a hierarchical relationship between elements?

• Stack
• Queue
• Linked List
• Tree

Tree Which algorithm is used to traverse a binary tree in an in- order manner?

• Depth-First Search (DFS)
• Breadth-First Search (BFS)
• Preorder Traversal
• Inorder Traversal

Inorder Traversal Which data structure is used to implement a priority queue?

• Queue
• Stack
• Heap
• Linked List

Heap Which sorting algorithm has the best worst-case time complexity of O(n log n)?

• Bubble Sort
• Merge Sort
• Selection Sort
• Insertion Sort

Merge Sort

In a binary search tree (BST), what is the property of the right child compared to the parent node?

• It is greater than the parent node.
• It is less than the parent node.
• It is equal to the parent node.
• There is no specific relationship.

It is greater than the parent node.Which data structure is suitable for implementing a stack?

• Array
• Linked List
• Hash Table
• Heap

Linked List Which algorithm is used to find the minimum spanning tree in a weighted graph?

• Breadth-First Search (BFS)
• Depth-First Search (DFS)
• Dijkstra's Algorithm
• Prim's Algorithm

Prim's Algorithm Which data structure allows efficient insertion, deletion, and retrieval operations with a time complexity of O(1)?

• Array
• Linked List
• Hash Table
• Stack

Hash Table Which sorting algorithm works by repeatedly finding the maximum element and moving it to the end?

• Bubble Sort
• Quick Sort
• Insertion Sort
• Merge Sort

Bubble Sort Which data structure is used to represent a hierarchical relationship between elements with a single parent and multiple children?

• Stack
• Queue
• Linked List
• Tree

Tree Which algorithm is used to traverse a binary tree in a post-order manner?

• Depth-First Search (DFS)
• Breadth-First Search (BFS)
• Preorder Traversal
• Postorder Traversal

Postorder Traversal

What is the purpose of analyzing algorithms?

• To understand their implementation details
• To determine their runtime complexity
• To optimize their memory usage
• To improve their user interface

To determine their runtime complexity Which of the following is NOT a characteristic of an algorithm?

• Finiteness
• Determinism
• Adaptability
• Input and Output

Adaptability What is the worst-case time complexity of a linear search algorithm?

• O(1)
• O(log n)
• O(n)
• O(n^2)

O(n) Which algorithmic paradigm divides a problem into smaller subproblems and solves them independently?

• Greedy algorithm
• Divide and conquer
• Dynamic programming
• Backtracking

Divide and conquer Which sorting algorithm has an average-case time complexity of O(n log n)? a. Bubble sort

• Selection sort
• Insertion sort
• Merge sort

Merge sort What is the purpose of Big O notation in algorithm analysis?

• To represent the best-case time complexity of an

algorithm

• To compare the performance of different algorithms
• To estimate the actual runtime of an algorithm
• To count the number of operations in an algorithm

To compare the performance of different algorithms What is the primary data structure used in a depth-first search (DFS) algorithm?

• Stack
• Queue
• Linked list
• Heap

Stack