📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

  • google app store apple app store
  • ✖

      Question

      Which of the following problems cannot be solved using

      greedy algorithms for optimal result?
      A Fractional Knapsack Correct Answer Incorrect Answer
      B Job Sequencing with Deadlines Correct Answer Incorrect Answer
      C Huffman Encoding Correct Answer Incorrect Answer
      D 0/1 Knapsack Correct Answer Incorrect Answer
      E Minimum Spanning Tree Correct Answer Incorrect Answer

      Solution

      Fractional Knapsack is greedy-solvable, but 0/1 requires DP since local choices don’t guarantee global optimum.

      Practice Next
      ask-question