Practice Design And Analysis Of Algorithms (8.1) - Design and Analysis of Algorithms

Practise this section

10 questions

Flashcard drill
4 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
4 questions · about 3 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 elements you have to check.
Question 2.
How do you determine if an array has distinct values?
Show hintHide hint
Think about what happens with duplicates.
3Question 3.
What is the time complexity for an iterative algorithm that runs in a single loop through n elements?
- O(n)
- O(n^2)
- O(log n)
Show hintHide hint
Think about how many comparisons you make.
4Question 4.
The Towers of Hanoi problem has a time complexity of which of the following?
- True
- False
Show hintHide hint
Recall how many moves you have to make based on disk numbers.
Question 5.
Propose a sorting algorithm and analyze its time complexity.
Show hintHide hint
Consider divide and conquer strategies.
Question 6.
Devise a recursive function to calculate the factorial of a number n and discuss its time complexity.
Show hintHide hint
Think about the base case and the recursive case.

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