Homework Assignment #13


To review asymptotic analysis and recurrence relations


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

Question 1

Exercise 3.8 in the textbook, parts (a) and (b)

Part c): (The print textbook does not have a part ( c), so add the following for part ( c):) Find the answer by constructing the graph and applying the algorithm.

Questions 2-5

Exercise 0.1 parts (l) (that's a lowercase “L”), (n), (o), (q)

Question 6

Solve $T(n)-5\cdot T(\frac{n}{6})=n\cdot log_6 n$ with initial condition $T(1)=2$ using the method of recurrence relations.

cs-312/hw13.txt · Last modified: 2015/02/09 19:13 by cs312ta
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