Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
4-1 Recurrence examples Give asymptotic upper and lower bounds for T (n) in each of the following recur- rences. Assume that T(n) is constant for n < 2. Make your bounds as tight as possible, and justify your answers. a. T(n) = 2T(n/2) + nª. b. T(n) = T(7n/10) + n. c. T(n) = 167(n/4) +n². d. T(n) = 7T(n/3) + n². e. T(n) = 7T(n/2) + n². %3D f. T(n) = 2T(n/4) + n. %3D g. T(n) = T(n – 2) + n².

4-1 Recurrence examples Give asymptotic upper and lower bounds for T (n) in each of the following recur- rences. Assume that T(n) is constant for n < 2. Make your bounds as tight as possible, and justify your answers. a. T(n) = 2T(n/2) + nª. b. T(n) = T(7n/10) + n. c. T(n) = 167(n/4) +n². d. T(n) = 7T(n/3) + n². e. T(n) = 7T(n/2) + n². %3D f. T(n) = 2T(n/4) + n. %3D g. T(n) = T(n – 2) + n².

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
4-1 Recurrence examples Give asymptotic upper and lower bounds for T (n) in each of the following recur- rences. Assume that T(n) is constant for n < 2. Make your bounds as tight as possible, and justify your answers. а. Т(п) 2T (n/2) +n*. b. T(n) = T(7n/10) +n. c. T(n) = 167T (n/4) +n2. d. T(n) = 7T(n/3) + n2. e. T(n) = 7T(n/2) +n2. f. T(n) = 2T (n/4) + n. g. T(n) = T(n – 2) + n2.
Transcribed Image Text:4-1 Recurrence examples Give asymptotic upper and lower bounds for T (n) in each of the following recur- rences. Assume that T(n) is constant for n < 2. Make your bounds as tight as possible, and justify your answers. а. Т(п) 2T (n/2) +n*. b. T(n) = T(7n/10) +n. c. T(n) = 167T (n/4) +n2. d. T(n) = 7T(n/3) + n2. e. T(n) = 7T(n/2) +n2. f. T(n) = 2T (n/4) + n. g. T(n) = T(n – 2) + n2.
108 Chapter 4 Divide-and-Conquer 4-3 More recurrence examples Give asymptotic upper and lower bounds for T(n) in each of the following recur- rences. Assume that T(n) is constant for sufficiently small n. Make your bounds as tight as possible, and justify your answers. a. T(n) = 4T(n/3) +n lg n. b. T(n) = 3T(n/3) +n/lg n. c. T(n) = 4T(n/2) + n² /n. d. T(n) = 3T(n/3 – 2) +n/2. e. T(n) = 2T(n/2) + n/lg n. f. T(n) = T(n/2) + T (n/4) + T(n/8) +n. g. T(n) = T(n- 1) + 1/n. h. T(n) = T(n – 1) + lgn. i. T(n) = T(n – 2) + 1/ lg n. j. T(n) = nT(/n) +n.
Transcribed Image Text:108 Chapter 4 Divide-and-Conquer 4-3 More recurrence examples Give asymptotic upper and lower bounds for T(n) in each of the following recur- rences. Assume that T(n) is constant for sufficiently small n. Make your bounds as tight as possible, and justify your answers. a. T(n) = 4T(n/3) +n lg n. b. T(n) = 3T(n/3) +n/lg n. c. T(n) = 4T(n/2) + n² /n. d. T(n) = 3T(n/3 – 2) +n/2. e. T(n) = 2T(n/2) + n/lg n. f. T(n) = T(n/2) + T (n/4) + T(n/8) +n. g. T(n) = T(n- 1) + 1/n. h. T(n) = T(n – 1) + lgn. i. T(n) = T(n – 2) + 1/ lg n. j. T(n) = nT(/n) +n.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS