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.

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.

What is the worst case time

complexity of linear search algorithm?

Apply Floyd algorithm to the following graph:

Which of the following statements is false?

Which of the following is a reason why hash tables are a good choice for storing and retrieving data?

Which of the following is true of searching for an element in a Hash Table that is implemented using linear probing (you may assume a Hash Table that is ~70% full)?

What is the tightest Big-O running time to calculate the Flesch readability score in the EfficientDocument class, where n is the length of the document, assuming you DO NOT include the time it takes to initialize the numSyllables, numWords, and numSentences variables (i.e. do not include the time taken by processText)?

Consider a hash table of size seven, with starting index zero, and a hash function h(x)= (3x + 4) mod 7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using linear probing? Note that ‘_’ denotes an empty location in the table.