What is the tightest big-O of 1/1+ 1/2+1/3+...+1/n2? Recall that for any base b, we have log, n = k log, n (this fact.may or may not be useful to get the answer). %3D A) O(1) B) O(n) C) O(log n) D) O(log n) A O C D.

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
icon
Related questions
Question
What is the tightest big-O of 1/1+1/2+1/3+...+1/n2? Recall that for any base b, we have
log, nk
k log, n (this fact.may or may not be useful to get the answer).
A) O(1)
B) O(n)
C) O(log* n)
D) O(log n)
O A
B.
D
6.
30
F3
000
000
F4
F5
F6
F7
F8
%
&
5
6
7
8
R
Y
14
Transcribed Image Text:What is the tightest big-O of 1/1+1/2+1/3+...+1/n2? Recall that for any base b, we have log, nk k log, n (this fact.may or may not be useful to get the answer). A) O(1) B) O(n) C) O(log* n) D) O(log n) O A B. D 6. 30 F3 000 000 F4 F5 F6 F7 F8 % & 5 6 7 8 R Y 14
Consider the recurrence T(n) = T(n/3) +T(n/100) +0(n). What is the correct tight
asymptotic bound for T(n)?
%3D
A) e(n²)
B) O(n)
C)e(n logn)
D) O(2")
O A
O B
C
OD
000
000 F4
F3
F5
F6
F7
F8
$
%
&
4
5
6
7
8
Transcribed Image Text:Consider the recurrence T(n) = T(n/3) +T(n/100) +0(n). What is the correct tight asymptotic bound for T(n)? %3D A) e(n²) B) O(n) C)e(n logn) D) O(2") O A O B C OD 000 000 F4 F3 F5 F6 F7 F8 $ % & 4 5 6 7 8
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Problems on numbers
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.
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