23.6. Weight Associated with Requests

Try these first

1. 1.

   What is the base case of the factorial function?

   Hint

   Think about what happens to 0 in factorial calculations.

2. 2.

   In insertion sort, what do we do with the first element?

   Hint

   Consider how the sorting process works step-by-step.

3. 3.

   What is the result of factorial of 5?

   Hint

   Break it down starting from 5.

4. 4.

   Is dynamic programming a greedy technique?

   • True
   • False

   Hint

   Think about how each algorithm approaches problems.

5. 5.

   You are tasked with utilizing dynamic programming to solve a series of overlapping requests, where each request has a profit associated with it. Formulate this problem and derive a solution that maximizes profits.

   Hint

   Visualize drawing a profit chart based on the requests.

6. 6.

   Analyze a case where the greedy method fails for interval scheduling. Create an example with weights and demonstrate where the greedy choice leads to suboptimal results.

   Hint

   Check how combinations affect total weights.