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

Practice: Analysis of Complexity

Lesson 8.2.2Design and Analysis of Algorithms

Practise this section

8 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
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is the time complexity of finding the maximum element in an array?
Show hintHide hint
Consider how many times you need to look through the array.
Question 2.
What is the time complexity of a nested loop that iterates n times?
Show hintHide hint
Think about how the outer loop interacts with the inner loop.
3Question 3.
What is the time complexity of finding the maximum element in an array?
- O(n)
- O(n^2)
- O(log n)
Show hintHide hint
Consider how many iterations are required.
4Question 4.
True or False: A recursive algorithm always has a higher time complexity than its iterative counterpart.
- True
- False
Show hintHide hint
Think about specific examples of algorithms.
Question 5.
Devise an algorithm for finding the lower and upper bounds of a sorted array using binary search. Detail the time complexity.
Show hintHide hint
Consider the properties of binary search.
Question 6.
Given a set of n unique items, derive the recurrence relation for arranging these items, and find its complexity.
Show hintHide hint
Think of arrangements: for each item, the others are arranged around it.

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