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?

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

After two passes of a sort algorithm, the following array:

47 3 21 32 56 92

has been rearranged as shown below:

3 21 47 32 56 92

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?

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.

Using the coalesced hashing to put the following values in a table with 10 elements:

A5, A2, A3, B5, A9, B2, B9, C2

Using the extraction method to extract the number as the key.

The “prime number division remainder” method is a well-known hashing algorithm.   In this method, a key value is divided by a number N, and the remainder which is also called a hash value is used directly as an index into the hash table.   N is the largest prime number less than or equal to the size of the table.   When the table size is 20, which of the following is the correct hash value calculated from the key value 136?   Here, a prime number is one that cannot be divided evenly by any other number except one (1).   2, 3, 5, 7, 11, and 13 are the first few prime numbers.

Select true / false statement in regarding to graph representation:

a. If our task is to process vertices adjacent to a vertex v, then the adjacency list requires only deg(v) steps, whereas the adjacency matrix requires |V| steps.

b. Inserting or deleting a edge requires linked list maintenance for an adjacency list (if such an implementation is used); for a matrix, it requires only changing 0 to 1 for insertion, or 1 to 0 for deletion, in one cell of the matrix.