You are the head of a division of a big Silicon Valley company and have assigned one of your engineers, Maria, the job of devising an algorithm to sort through an English text of n words and convert it into an Esperanto document. Maria comes up with an algorithm which takes 2n² + 2" bit operations to handle an input text with n words. Suppose the computers in your handle one bit operation every nanosecond (1 nanosecond = 109 seconds). (a) How many nanoseconds would it take Maria's algorithm to convert a text with 11 words on these computers? business can (b) How many HOURS would it take Maria's algorithm to convert a text with 67 words on these computers? Round your answer to the nearest whole number. (c) For an input text of 100 words, the statement that best describes the performance of Maria's algorithm is: ○ A. Her algorithm would take between 4 and 40 years to run. B. Her algorithm would take between 40 trillion and 400 trillion years to run. OC. Her algorithm would take more than 400 trillion years to run. ○ D. Her algorithm would take between 40 million and 400 million years to run. ○ E. Her algorithm would take between 40 and 400 years to run. OF. Her algorithm would take between 40 billion and 400 billion years to run. OG. Her algorithm would take between 40,000 and 400,000 years to run.
You are the head of a division of a big Silicon Valley company and have assigned one of your engineers, Maria, the job of devising an algorithm to sort through an English text of n words and convert it into an Esperanto document. Maria comes up with an algorithm which takes 2n² + 2" bit operations to handle an input text with n words. Suppose the computers in your handle one bit operation every nanosecond (1 nanosecond = 109 seconds). (a) How many nanoseconds would it take Maria's algorithm to convert a text with 11 words on these computers? business can (b) How many HOURS would it take Maria's algorithm to convert a text with 67 words on these computers? Round your answer to the nearest whole number. (c) For an input text of 100 words, the statement that best describes the performance of Maria's algorithm is: ○ A. Her algorithm would take between 4 and 40 years to run. B. Her algorithm would take between 40 trillion and 400 trillion years to run. OC. Her algorithm would take more than 400 trillion years to run. ○ D. Her algorithm would take between 40 million and 400 million years to run. ○ E. Her algorithm would take between 40 and 400 years to run. OF. Her algorithm would take between 40 billion and 400 billion years to run. OG. Her algorithm would take between 40,000 and 400,000 years to run.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
Transcribed Image Text:You are the head of a division of a big Silicon Valley company and have assigned one of your engineers, Maria, the job of devising
an algorithm to sort through an English text of n words and convert it into an Esperanto document. Maria comes up
with an
algorithm which takes 2n² + 2" bit operations to handle an input text with n words. Suppose the computers
in your
handle one bit operation every nanosecond (1 nanosecond = 109 seconds).
(a) How many nanoseconds would it take Maria's algorithm to convert a text with 11 words on these computers?
business can
(b) How many HOURS would it take Maria's algorithm to convert a text with 67 words on these computers? Round your answer to
the nearest whole number.
(c) For an input text of 100 words, the statement that best describes the performance of Maria's algorithm is:
○ A. Her algorithm would take between 4 and 40 years to run.
B. Her algorithm would take between 40 trillion and 400 trillion years to run.
OC. Her algorithm would take more than 400 trillion years to run.
○ D. Her algorithm would take between 40 million and 400 million years to run.
○ E. Her algorithm would take between 40 and 400 years to run.
OF. Her algorithm would take between 40 billion and 400 billion years to run.
OG. Her algorithm would take between 40,000 and 400,000 years to run.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
