Practice Lower Bounds (7.7) - Design and Analysis of Algorithms - Design & Analysis of Algorithms

Practise this section

11 questions

Flashcard drill
3 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
5 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Define Upper Bound.
Show hintHide hint
Think about maximum performance expectations.
Question 2.
What does Omega Notation signify?
Show hintHide hint
Consider minimum resource requirements.
3Question 3.
What does Big O notation represent?
- Lower bound of an algorithm
- Upper bound of an algorithm
- Exact growth rate
Show hintHide hint
Remember 'Big O' relates to upper limits.
4Question 4.
True or False: Omega notation is used for establishing upper bounds.
- True
- False
Show hintHide hint
Think about what each notation signifies.
Question 5.
Demonstrate the growth rates of n^2 and n^3. Provide a formal analysis to determine if n^3 is Alpha of n^2.
Show hintHide hint
Calculate values for increasing n to demonstrate the inequality.
Question 6.
Consider the bubble sort algorithm. Establish its upper and lower bounds with proper reasoning.
Show hintHide hint
Think about the comparisons made between array elements.

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