Practice Types Of Algorithms (13.3) - Implementation of Algorithms to Solve Problems

Practise this section

10 questions

Flashcard drill
5 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 a brute force algorithm?
Show hintHide hint
Think of trying every key to unlock a door.
Question 2.
Define greedy algorithms.
Show hintHide hint
Consider choosing the largest coins first.
3Question 3.
What does a Brute Force algorithm do?
- Looks for the optimal solution
- Tries every possible solution
- Uses sub-problems
Show hintHide hint
Think about searching through every option.
4Question 4.
True or False: Dynamic programming only works for problems with independent sub-problems.
- True
- False
Show hintHide hint
Consider the Fibonacci sequence.
Question 5.
You are tasked with finding a path through a maze. Describe how a backtracking algorithm would help solve this problem.
Show hintHide hint
Consider how you’d retrace your steps in a real maze.
Question 6.
Create an example of a problem that could be best solved using dynamic programming and explain why other approaches might fail.
Show hintHide hint
Think about packing for a trip by weight and value.

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