1.2 Algorithm Design Priciples/Approches

Question 1

What are some algorithm design principles/approaches?

Answer 1

1. Brute Force
2. Divide and Conquer
3. Greedy
4. Branch and Bound Algorithms
5. Randomized algorithm

Question 2

What is a brute force algorithm?

Answer 2

It is an approach to algorithms where every possible solution for a problem is explored, and the best one is chosen to solve the problem.

Question 3

What is a Divide and conquer algorithm?

Answer 3

It is an approach to algorithms where a problem is divided into smaller problems each smaller problem is solved and their solutions are combined together with the aim of solving the initial problem

Question 4

What is a greedy algorithm?

Answer 4

This is an approach to algorithms where the optimal choice is made at each step to come out with the best possible solution

Question 5

What is a branch and bound algorithm?

Answer 5

This approach to algorithms divides all possible solutions to a problem into subsets and each subset is analyzed to find the best possible solution to the problem.

Question 6

What is a randomized algorithm?

Answer 6

This is an approach to algorithms where random bits are added to the input to produce randomized out comes.