Practice Week 1: Motivation And Asymptotic Complexity (1.6.1)

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.
Define asymptotic complexity.
Show hintHide hint
Think about how we measure algorithm performance as input scales.
Question 2.
What does a greedy algorithm do?
Show hintHide hint
Recall the approach involves local optimal choices.
3Question 3.
What is Big O notation used for?
- To measure algorithm correctness
- To measure algorithm efficiency
- To structure code
Show hintHide hint
It's about evaluating how algorithms behave with larger inputs.
4Question 4.
True or False: A greedy algorithm guarantees the best solution.
- True
- False
Show hintHide hint
Think about local versus global optimality.
Question 5.
Devise a way to compare the efficiency of two sorting algorithms using Big O analysis. What factors would you consider?
Show hintHide hint
Focus on how input sizes influence performance differences.
Question 6.
Design an original algorithm to solve a real-life problem using either greedy approach or dynamic programming. Justify your method.
Show hintHide hint
Choose problems with overlapping subproblems for dynamic programming.

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