This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: up characteristic equation: T(N) = T(N1) + T(N2) [ Note that this is the Fibonacci number and not the complexity of calculating it.] The roots of the quadratic equation ax 2 + bx + c = 0 are (b + sqareroot(b 2 – 4ac))/2a and (b  sqareroot(b 2 – 4ac))/2a. [5] GRAD QUSETION 2b. Set up the characteristic equation for: T(N) = T(N1) + T(N2) +1 [5] UNDERGRAD QUESTION: 3. Solve the following recurrence equation for general solution by setting up its characteristic equation, and then mention the order (theta) function for that solution. T(N) = 2T(N1)  T(N2) [5] GRAD QUESTION 3. Solve the following recurrence equation for general solution by setting up its characteristic equation, and then mention the order (theta) function for that solution. T(N) = 2T(N1)  T(N2) +1 [5] .4. GRAD QUESTION: Analyze average case complexity of QuickSelect algorithm by setting up its recurrence equation and then solving it by telescopic method. [5]...
View
Full Document
 Spring '12
 Dmitra
 Algorithms, Big O notation, Analysis of algorithms, Computational complexity theory, Recurrence relation, recurrence equation

Click to edit the document details