You are given the following definitions to help you: O(g(n)) = {f(n): there exist positive constants c and no such that 0 ≤ f(n) ≤ cg(n) for all n ≥ no}. (g(n)) = {f(n): there exist positive constants c and no such that 0 ≤ cg(n) ≤ f(n) for all n ≥ no}. Ⓒ(g(n)) = {f(n): there exist positive constants C₁, C2, and no such that 0 ≤c₁g(n) ≤ f(n) ≤ c₂g (n) for all n ≥ no} . Using above definitions, prove that: 5. T(n) = 6n + 4n+ 3 € O(n) 6. T(n) = 100n + 10000 € O(n²) 7. T(n)=5n² - 2n + 16 = O(n³) 8. T(n)=5n² - 2n + 16 is not € O(n) 9. T(n)= n³ + 20n € (n²) 10. T(n) = 2n³ - 7n + 1 € (n³)

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

8,9,10

You are given the following definitions to help you:
O(g(n)) = {f(n): there exist positive constants c and no such that
0 ≤ f(n) ≤ cg(n) for all n ≥ no} .
N(g(n)) = {f(n): there exist positive constants c and no such that
0 ≤ cg (n) ≤ f(n) for all n ≥ no} .
©(g(n)) = {f(n): there exist positive constants C₁, C2, and no such that
0 ≤ c₁g(n) ≤ f(n) ≤ c₂g (n) for all n ≥ no} .
Using above definitions, prove that:
5. T(n) = 6n + 4n+ 3 € 0 (n)
6. T(n) = 100n + 10000 ��� O(n²)
7. T(n) = 5n² - 2n + 16 € O(n³)
8. T(n)=5n² - 2n + 16 is not € O(n)
9. T(n) = n³ + 20n € №(n² )
10. T(n) = 2n³ - 7n + 1 € ☺(n³)
Transcribed Image Text:You are given the following definitions to help you: O(g(n)) = {f(n): there exist positive constants c and no such that 0 ≤ f(n) ≤ cg(n) for all n ≥ no} . N(g(n)) = {f(n): there exist positive constants c and no such that 0 ≤ cg (n) ≤ f(n) for all n ≥ no} . ©(g(n)) = {f(n): there exist positive constants C₁, C2, and no such that 0 ≤ c₁g(n) ≤ f(n) ≤ c₂g (n) for all n ≥ no} . Using above definitions, prove that: 5. T(n) = 6n + 4n+ 3 € 0 (n) 6. T(n) = 100n + 10000 ��� O(n²) 7. T(n) = 5n² - 2n + 16 € O(n³) 8. T(n)=5n² - 2n + 16 is not € O(n) 9. T(n) = n³ + 20n € №(n² ) 10. T(n) = 2n³ - 7n + 1 € ☺(n³)
Expert Solution
steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Binary 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
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