Understanding Algorithms and Design Techniques

What are algorithms

What does the word Algorithm mean?

What is the Divide and Conquer Approach?

• It is a top-down approach.

• It is a bottom-up approach.

• It involves solving all possible small problems.

• It is a method for global optimization.

What is the Greedy Technique used for?

• To solve optimization problems.

• To divide problems into subproblems.

• To combine solutions of subproblems.

• To perform depth-first search.

What is Dynamic Programming?

• A top-down approach.

• A bottom-up approach.

• A method for global optimization.

• A technique for random number generation.

What does the Branch and Bound algorithm do?

• Divides a subproblem into at least two new restricted subproblems.

• Combines solutions of subproblems.

• Uses random bits to influence computation.

• Tries each possibility until the right one is found.

What is a Randomized Algorithm?

• An algorithm that uses random bits.

• An algorithm that guarantees optimal solutions.

• An algorithm that solves problems recursively.

• An algorithm that divides problems into subproblems.

What does the Backtracking Algorithm do?

• Tries each possibility until the right one is found.

• Uses random numbers to make decisions.

• Divides problems into subproblems.

• Combines solutions of subproblems.

What is an example of a Randomized Algorithm?

• Using a random number to choose a pivot in Quick Sort.

• Dividing a problem into subproblems.

• Combining solutions of subproblems.

• Using a greedy method to solve optimization problems.