To find the strongly connected components (SCCs) in a directed graph G(V,E) eficiently, where V

Following the discussion from our lectures, for the text of size n and the pattern of size m, if the number of valid occurrences of the pattern in the text is constant and the hash function is good, then the Rabin-Karp algorithm is expected to run in time _____________ (fill in the blank). 

Consider the following statement: 

"In order to solve the recurrence T[n]=3T[n/4]+n·log₂n by the Master method, you will need to check the regularity condition."

Select every correct answer below (More than one choice could be selected. You may lose points for wrong selections).

Which of the following is an example of a function in Ω ( n² )? 

Solve the following recurrence and find the correct asymptotic bound in terms of k:

T(5^k) = 25⋅T(5^k−3)+k³⋅5^k

What is the primary difference between BFS and DFS when traversing a graph?

Which of the following statements is true about weakly connected graphs?

Consider the following undirected graph:

If we perform Breadth-First Search (BFS) traversal starting from node 3, how many of the following traversal(s) is/are possible? 

3 → 2 → 4 → 6 → 7 → 1 → 8 → 5

Consider the following partially sorted array after a few steps of insertion sort: [2, 5, 9, 4, 15, 3].

How many comparisons will insertion sort perform when inserting the element 4 into its correct position in the array during the next step of the algorithm?

Which of the following statements about quicksort is TRUE?