When the bubble sort algorithm is used for sorting the dataset (23, 43, 56, 12, 87, 14, 87, 15, 90, 23, 10) in descending order, how many data exchanges occur during the first iteration of outer loop?

In the algorithm for spelling suggestions in this week's assignment, there was a hash set to mark Strings as visited. What is the BEST ANSWER for why we used the visited set?

Use Dijkstra’s algorithm to find shortest paths from vertex A to others in the following graph:

What is “current distance of F“ after iteration 3 of the algorithm?

When a hash table becomes too full, which of the following is required to resize the table?

In .................................. algorithm, each vertex v is visited and then each unvisited vertex adjacent to v is visited. If a vertex v has no adjacent vertices or all of its adjacent vertices have been visited, we backtrack to the predecessor of v. The traversal is finished if this visiting and backtracking process leads to the first vertex where the traversal started. If there are still some unvisited vertices in the graph, the traversal continues restarting for one of the unvisited vertices.

Apply Floyd algorithm to the following graph:

Which of the following statements is false?