Understanding Algorithms and Problem Solving

What are algorithms,

What does the word Algorithm mean?

• A set of rules to be followed in calculations or other problem-solving operations

• A procedure for solving a mathematical problem in a finite number of steps that frequently by recursive operations

What is the Divide and Conquer Approach?

• A top-down approach that involves dividing the original problem into subproblems, solving them individually, and combining the solutions.

• A method that solves problems by making the best choice at each step.

• A technique that solves problems by breaking them down into smaller subproblems.

What is the Greedy Technique?

• A method that solves optimization problems by making the best choice at each step.

• A technique that guarantees the optimal solution.

• A method that solves problems by dividing them into smaller subproblems.

What is Dynamic Programming?

• A bottom-up approach that solves all possible small problems and combines them for bigger problems.

• A method that guarantees the optimal solution.

• A technique that solves problems by making the best choice at each step.

What is the Branch and Bound method?

• A method for global optimization in non-convex problems.

• A technique that guarantees the optimal solution.

• A method that solves problems by making the best choice at each step.

What is a Randomized Algorithm?

• An algorithm that uses random bits to influence its computation.

• A method that guarantees the optimal solution.

• A technique that solves problems by making the best choice at each step.

What is the Backtracking Algorithm?

• An algorithm that tries each possibility until it finds the right one.

• A method that guarantees the optimal solution.

• A technique that solves problems by making the best choice at each step.