Computer Science > QUESTIONS & ANSWERS > Old Dominion University CS 381 Quiz 9_c - 2018 10_FALL_CS381 (All)

Old Dominion University CS 381 Quiz 9_c - 2018 10_FALL_CS381

Document Content and Description Below

Review Test Submission: Quiz 9_c User JAKE R AUSTIN Course INTRO TO DISCRETE STRUCTURES Test Quiz 9_c Started 11/4/18 2:42 PM Submitted 11/4/18 4:03 PM Due Date 11/6/18 7:00 PM Status Completed... Attempt Score 23 out of 25 points Time Elapsed 1 hour, 20 minutes out of 2 hours Results Displayed All Answers, Submitted Answers, Correct Answers, Feedback, Incorrectly Answered Questions Question 1 Selected Answer: False Answers: True False Response Feedback: When using Big-O notation, the hardware and software used to implement an algorithm are significant factors. Neither hardware nor software are factors when estimating with Big-O notation. Big-O is used to estimate the number of operations an algorithm uses, and it is assumed that different operations take the same amount of time. Question 2 Selected Answer: True Answers: True False Response Feedback: f(x) = x3 + x2 + x4 + 5x + 9 is Θ(x4). Both the best and worst case scenarios of the upper and lower bounds are x4. Question 3 Selected Answer: True Answers: True False Response Feedback: f(x) = 5x2 + xlogx is Ω(x2). Because 0 ≤ xlogx ≤ x2, 5x2 + xlogx ≤ 6x2 for x > 1. Consequently, 5x2 + xlogx is O(x2). x2 is O(5x2 + xlogx). My Blackboard & Courses My Professional Learning Content Collection Student Resources Help JAKE AUSTIN 1 out of 1 points 2 out of 2 points 2 out of 2 points (x) is Ω(x2) and happens to also be Θ(x2). Question 4 Selected Answer: Answers: Response Feedback: What is the Big-O estimate for x2 + logx + 5x? O(x2) O(logx) O(x) O(x2) O(5x) Only the term with the higher bound is considered in Big-O estimation, which in this case is x2. Question 5 Selected Answer: Answers: Response Feedback: R [Show More]

Last updated: 2 years ago

Preview 1 out of 4 pages

Buy Now

Instant download

We Accept: