Practice Worst Case And Average Case Analysis (6.2) - Input Size and Running Time

Practice: Worst Case and Average Case Analysis

Lesson 6.2Input Size and Running Time

Practise this section

8 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Define input size in relation to algorithms.
Show hintHide hint
Think about how you measure data for sorting or searching.
Question 2.
What is the worst case for a linear search in an unsorted array?
Show hintHide hint
Consider how many items need to be checked.
3Question 3.
What does worst case analysis measure?
- The average performance of an algorithm
- The scenario that takes the most time
- Performance under best conditions
Show hintHide hint
Think about the definition of worst case.
4Question 4.
True or False? Average case analysis is easier to compute than worst case analysis.
- True
- False
Show hintHide hint
Which analysis is usually more straightforward?
Question 5.
Consider two sorting algorithms: one with an average case of O(n log n) and another with a worst case of O(n^2). Describe a scenario where the better average case algorithm might perform worse in execution.
Show hintHide hint
Think about how the size of the dataset affects performance.
Question 6.
Given an unsorted list of numbers, develop an algorithm to find the maximum number. Analyze its worst case and average case performance.
Show hintHide hint
What happens if the maximum number is always at the end?

4 more questions in this section. Enroll free to practise them all.