Homework Assignment #11

To work out depth-first search on undirected graphs and gain insights into the DFS algorithm. Also a review on non-homogeneous recurrence relations.

Show all work. i.e., justify your answers.

Exercise 3.1 in the textbook

Exercise 3.10 in the textbook

Use our method for solving linear, non-homogeneous recurrence relations with geometric forcing functions to solve the following recurrence: $T(n) = 3 T(n/8) + n^2$ .