What does asymptotic analysis focus on?

Find the asymptotic running time for the recurrence relation T[n]=8T[n/4]+n^1.51 and then select every correct answer below (more than one choice could be selected).

Which of the following is NOT a characteristic of an algorithm?

Consider the following array representation of a min binary heap: [1, 3, 5, 7, 10, 6, 8].

If we perform an extract-min operation on this heap, what will be the resulting array after the heap property is restored according to our lectures?

What is the primary difference between a queue used in BFS and a stack used in DFS?

Which of the following statements about quicksort is TRUE?

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?

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

• f ( n ) = O (g ( n )) implies  f ( n ) = Ω (g ( n )) 

• f ( n ) = Θ (g ( n )) implies f ( n ) = O (g ( n )) and  f( n ) = Ω (g ( n ))

• f ( n ) = Ω (g ( n )) implies f ( n ) = O (g ( n ))

• f ( n ) = O (g ( n )) implies f ( n ) = Θ (g ( n ))

• f ( n ) = Θ (g ( n )) implies f ( n ) = O (g ( n )) but not f( n ) = Ω (g ( n ))

How many statement(s) shown above is/are correct? 

Suppose you inserted the keys 1, 3, 4, 7, 12, 14, 16, 17, 30, 39 (exactly in this order) into a hash table of size 13 using the hash function:

h(x)=(3x+5) mod  13 also insert key 27 and 43 after that

using chaining for collision resolution.