Practice Summary (8.7) - Design and Analysis of Algorithms - Design & Analysis of Algorithms

Practise this section

9 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
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 of finding a maximum in an array with n elements?
Show hintHide hint
Think about how many comparisons you need to make.
Question 2.
What does O(2^n) represent in terms of algorithm complexity?
Show hintHide hint
Consider how the size of the input affects the time taken.
3Question 3.
What is the complexity class of finding the maximum in an array?
- O(n)
- O(n^2)
- O(log n)
Show hintHide hint
Think about the number of iterations needed.
4Question 4.
Which of the following is NOT a characteristic of a recursive function?
- True
- False
Show hintHide hint
What must a recursive function always have?
Question 5.
If you increase the number of disks in the Towers of Hanoi from 3 to n, express how the number of moves would increase.
Show hintHide hint
Consider how each disk contributes to the total moves.
Question 6.
Create a recursive algorithm to calculate the factorial of a number and analyze its time complexity.
Show hintHide hint
What does each function call reduce to?

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