Suppose that an algorithm has runtime 20 n3 for n <= 100. For n>100, the slowest cases for each n take time 2 n2 log n. The fastest cases for each n take time 10 n2. That is, for n>100, runtime is between 10 n2 and 2 n2 log n. Which of the following are known to be true of the worst-case runtime for the algorithm? (Check all that apply, which may be more than one in a row.) O( n2 ) O( n2 log n ) O( n3 ) None of these Ω( n2 ) Ω( n2 log n ) Ω( n3 ) None of these Θ( n2 ) Θ( n2 log n ) Θ( n3 ) None of these Which of the following are known to be true of the average-case runtime? O( n2 ) O( n2 log n ) O( n3 ) None of these Ω( n2 ) Ω( n2 log n ) Ω( n3 ) None of these Θ( n2 ) Θ( n2 log n ) Θ( n3 ) None of these [Each row must have at least one answer checked.]
Suppose that an algorithm has runtime 20 n3 for n <= 100. For n>100, the slowest cases for each n take time 2 n2 log n. The fastest cases for each n take time 10 n2. That is, for n>100, runtime is between 10 n2 and 2 n2 log n. Which of the following are known to be true of the worst-case runtime for the algorithm? (Check all that apply, which may be more than one in a row.) O( n2 ) O( n2 log n ) O( n3 ) None of these Ω( n2 ) Ω( n2 log n ) Ω( n3 ) None of these Θ( n2 ) Θ( n2 log n ) Θ( n3 ) None of these Which of the following are known to be true of the average-case runtime? O( n2 ) O( n2 log n ) O( n3 ) None of these Ω( n2 ) Ω( n2 log n ) Ω( n3 ) None of these Θ( n2 ) Θ( n2 log n ) Θ( n3 ) None of these [Each row must have at least one answer checked.]
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
Related questions
Question
-
Suppose that an
algorithm has runtime 20 n3 for n <= 100. For n>100, the slowest cases for each n take time 2 n2 log n. The fastest cases for each n take time 10 n2. That is, for n>100, runtime is between 10 n2 and 2 n2 log n.Which of the following are known to be true of the worst-case runtime for the algorithm? (Check all that apply, which may be more than one in a row.)
O( n2 ) O( n2 log n ) O( n3 ) None of these Ω( n2 ) Ω( n2 log n ) Ω( n3 ) None of these Θ( n2 ) Θ( n2 log n ) Θ( n3 ) None of these Which of the following are known to be true of the average-case runtime?
O( n2 ) O( n2 log n ) O( n3 ) None of these Ω( n2 ) Ω( n2 log n ) Ω( n3 ) None of these Θ( n2 ) Θ( n2 log n ) Θ( n3 ) None of these [Each row must have at least one answer checked.]
Compose
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education