Review Test Submission: Module 1 - Complexity Quiz- COMPLETED

8/17/2019 Review Test Submission: Module 1 - Complexity Quiz – EN...

MOHAMMED MOMIN Logout
My Institution Courses Community Content Collection Support


EN.605.202.81.SU19 Data Structures Course Modules Module 1: Complexity and ADTs Review Test
Submission: Module 1 - Complexity Quiz




Review Test Submission: Module 1 - Complexity Quiz



User MOHAMMED REZA MOMIN
Course EN.605.202.81.SU19 Data Structures
Test Module 1 - Complexity Quiz
Started 6/4/19 6:36 PM
Submitted 6/4/19 7:03 PM
Due Date 6/4/19 11:59 PM
Status Completed
Attempt Score 5.2 out of 7.59999 points
Time Elapsed 27 minutes out of 30 minutes
Results All Answers, Submitted Answers, Correct Answers, Feedback, Incorrectly Answered
Displayed Questions


Question 1 0.4 out of 2.4 points

An algorithm S of complexity O (n) is used to solve a problem. You execute the algorithm many
times and collect timing information (see table). You are puzzled by the times you observe. State
what you observe and give a reasonable explanation.
Data Size | 50 100 250 500 750 1000 1500 10000 20000 50000
________|___________________________________________________
Time | 2 8 51 205 456 811 1203 8100 16200 40500


The performance is [a] in the second half of the time chart but [b] in the rst half. Beta is about
[c]. [d] that point, [e] performance would not be expected to be a reliable indicator or estimate
of performance. In this case it [f] a reliable indicator.


Selected An algorithm S of complexity O (n) is used to solve a problem. You execute the
Answer: algorithm many times and collect timing information (see table). You are
puzzled by the times you observe. State what you observe and give a reasonable
explanation.
Data Size | 50 100 250 500 750 1000 1500 10000 20000 50000
________|___________________________________________________
Time | 2 8 51 205 456 811 1203 8100 16200 40500


The performance is O(nlgn) in the second half of the time chart but
O(n^2) in the rst half. Beta is about 250. At that point, big
This study source was downloaded by 100000858936669 from CourseHero.com on 01-28-2023 19:39:58 GMT -06:00

https://blackboard.jhu.edu/webapps/assessment/review/review.jsp?attempt_id=_13585087_1&course_id=_184576_1&content_id=_6636065_1&outcome_id=_13520… 1/6
https://www.coursehero.com/file/67599062/Module-1-Complexity-Quizpdf/

, 8/17/2019 Review Test Submission: Module 1 - Complexity Quiz – EN...

performance would not be expected to be a reliable indicator or estimate of
performance. In this case it is a reliable indicator.


Answers: An algorithm S of complexity O (n) is used to solve a problem. You execute the
algorithm many times and collect timing information (see table). You are
puzzled by the times you observe. State what you observe and give a reasonable
explanation.
Data Size | 50 100 250 500 750 1000 1500 10000 20000 50000
________|___________________________________________________
Time | 2 8 51 205 456 811 1203 8100 16200 40500


The performance is O(n) in the second half of the time chart but O(n^2)
in the rst half. Beta is about 1000. Before that point, O(n)
performance would not be expected to be a reliable indicator or estimate of
performance. In this case it is not a reliable indicator.

All Answer Choices


big
small
minimal
excessive
100
250
500
750
1000
1500
10000
20000
O(1)
O(lg n)
O(n)
O(nlgn)
O(n^2)
O(n^3)
Before
After
At
is
is not
maybe
sometimes
consistently
inconsistently




Question 2 1.6 out of 1.6 points



This study source was downloaded by 100000858936669 from CourseHero.com on 01-28-2023 19:39:58 GMT -06:00

https://blackboard.jhu.edu/webapps/assessment/review/review.jsp?attempt_id=_13585087_1&course_id=_184576_1&content_id=_6636065_1&outcome_id=_13520… 2/6
https://www.coursehero.com/file/67599062/Module-1-Complexity-Quizpdf/