Practice Analysis Of Complexity (8.4.2) - Design and Analysis of Algorithms

Practise this section

8 questions

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

6 sample questions

Question 1.
What is the time complexity for finding the maximum value in an array?
Show hintHide hint
Think about how many times you go through the array.
Question 2.
Describe what a recursive algorithm is in your own words?
Show hintHide hint
Consider how a function could keep calling itself.
3Question 3.
What is the time complexity of finding the maximum value in an array?
- O(n)
- O(n²)
- O(log n)
Show hintHide hint
Consider how many items are in the array.
4Question 4.
Does the Towers of Hanoi problem have a polynomial time complexity?
- True
- False
Show hintHide hint
Recall the growth pattern in recursive algorithms.
Question 5.
Develop a new algorithm for efficiently finding duplicates in an array with a better complexity than O(n²).
Show hintHide hint
Consider storing elements in a way that allows for quick lookups.
Question 6.
Prove that the time complexity of the Towers of Hanoi can be derived from its recursive formulation.
Show hintHide hint
Try to write out the first few terms to see the pattern.

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