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.

Question 1

Exercise 3.1 in the textbook

Question 2

Exercise 3.10 in the textbook

Question 3

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$ .

cs-312/hw11.txt · Last modified: 2014/12/31 23:00 by ringger
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0