Practice Iterative And Recursive Examples (8.1.2) - 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.
Describe how to find the maximum number in an array using iteration.
Show hintHide hint
Think about starting with the first element as a reference.
Question 2.
What is the time complexity of checking whether an array has distinct values?
Show hintHide hint
Consider how many times the loops will run in total.
3Question 3.
What is the time complexity for finding the maximum value in an array using iteration?
- O(n)
- O(n^2)
- O(log n)
Show hintHide hint
Think about how many comparisons you need.
4Question 4.
Is the use of recursion in the Towers of Hanoi problem an optimal solution?
- True
- False
Show hintHide hint
Keep in mind how many moves are generated in total.
Question 5.
Create an iterative algorithm to check if a string is a palindrome.
Show hintHide hint
Think about using two pointers, one from each end.
Question 6.
Design a recursive function to compute the Fibonacci sequence and analyze its time complexity.
Show hintHide hint
Establish how the trees of computation grow with each level.

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