Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Suppose we have the following recurrence: S(0) = 1 S(1) = 1

Suppose we have the following recurrence: S(0) = 1 S(1) = 1

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

plz help i will rate u immediately 

discrete structure

Suppose we have the following recurrence: S(0) = 1 S(1) = 1 S(n) = 2S(n/2) +1 Which of the following statements is true? O a) T(n) = 0(n) O b) T(n) = 2(n) O c) T(n) = O(n) d) T(n)=6n-5 for n > 1 O e) T(n)=2n-1 n > 1 f) T(n)=3n-2 n > 1
Transcribed Image Text:Suppose we have the following recurrence: S(0) = 1 S(1) = 1 S(n) = 2S(n/2) +1 Which of the following statements is true? O a) T(n) = 0(n) O b) T(n) = 2(n) O c) T(n) = O(n) d) T(n)=6n-5 for n > 1 O e) T(n)=2n-1 n > 1 f) T(n)=3n-2 n > 1
Which of the following recurrence relations are O(n)? You may assume n is a power of 2. О a) Т(п) — 2T(n/2) + п, T(1) %3D 1 O b) T(n) = 2T(n/2) + 1, T(1) = 1 О) T(п) — 2T (n/2) + 1, Т(1) —D п 2T(n/2) + 1, T(1) = n O d) T(n) = T(n – 1) + 1, T(1) = 1 %3D O e) T(n) = T(n – 1) + n, T(1) = 1
Transcribed Image Text:Which of the following recurrence relations are O(n)? You may assume n is a power of 2. О a) Т(п) — 2T(n/2) + п, T(1) %3D 1 O b) T(n) = 2T(n/2) + 1, T(1) = 1 О) T(п) — 2T (n/2) + 1, Т(1) —D п 2T(n/2) + 1, T(1) = n O d) T(n) = T(n – 1) + 1, T(1) = 1 %3D O e) T(n) = T(n – 1) + n, T(1) = 1
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Types of Expressions
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
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