Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
If an algorithm with input integer n can return the result in f(n) = 3.3 x 10 10 xn' seconds. How long can this algorithm finish when n =

If an algorithm with input integer n can return the result in f(n) = 3.3 x 10 10 xn' seconds. How long can this algorithm finish when 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

please answer these three questions, thanks!

If an algorithm with input integer n can return the result in f(n) = 3.3 x 10 10 x n seconds. How long can this algorithm finish when n = 230? Seleccione una: a. About 100 years b. About 1 year c. About 30 seconds d. About 10 years If an algorithm with input integer n can return the result in f(n) = 3.3 x 108 x n seconds. How long can this algorithm finish when n = 2"? Seleccione una: a. About 1 year b. About 100 years c. About 10 years d. About 30 seconds If an algorithm with input integer a can return the result in f(n) = 3.3 x 10 10 x 2" seconds. How long can this algorithm finish when n = 63? Seleccione una: About 100 years a. b. About 10 years c. About 30 seconds d. About 1 year
Transcribed Image Text:If an algorithm with input integer n can return the result in f(n) = 3.3 x 10 10 x n seconds. How long can this algorithm finish when n = 230? Seleccione una: a. About 100 years b. About 1 year c. About 30 seconds d. About 10 years If an algorithm with input integer n can return the result in f(n) = 3.3 x 108 x n seconds. How long can this algorithm finish when n = 2"? Seleccione una: a. About 1 year b. About 100 years c. About 10 years d. About 30 seconds If an algorithm with input integer a can return the result in f(n) = 3.3 x 10 10 x 2" seconds. How long can this algorithm finish when n = 63? Seleccione una: About 100 years a. b. About 10 years c. About 30 seconds d. About 1 year
Expert Solution
steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
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
SEE MORE TEXTBOOKS