Which of the following is the appropriate description of the “selection sort” algorithm?

In a min-heap:

What is the tightest Big-O running time to calculate the Flesch readability score the first time in the EfficientDocument class, where n is the length of the document, assuming you include the time it takes to initialize the numSyllables, numWords, and numSentences variables?

Note that this is not necessarily the running time that you saw when you plotted the graph of your EfficientDocument running time when you did your benchmarking. That time included the time to initialize the numSyllables, numWords and numSentences variables.

A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values into an empty hash table, the table is

as shown below.

Which one of the following choices gives a possible order in which the key values could have been inserted in the table? (Assume that Linear probing was used to resolved collision)

An array contains the elements shown below:

Select true / false statement in regarding to graph representation:

a. There are n possible adjacency matrices for the same graph.

b. Multigraphs can be represented in the following adjacency matrix:

aij = number of edges between v_i and v_j

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

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.