Sign Up

Have an account? Sign In Now

Sign In

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here
Sign InSign Up

SIKSHAPATH

SIKSHAPATH Logo SIKSHAPATH Logo

SIKSHAPATH Navigation

  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Contact
  • Delivery Policy for Sikshapath
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Contact
  • Delivery Policy for Sikshapath
Home/Questions/Q 22545
Next
In Process
Minni
  • 0
Minni
Asked: October 17, 20222022-10-17T09:17:16+05:30 2022-10-17T09:17:16+05:30In: Computer Science

Why dynamic approach is preferred over greedy technique?

  • 0

Why dynamic approach is preferred over greedy technique?

  • 1 1 Answer
  • 26 Views
  • 0 Followers
  • 0
Answer
Share
  • Facebook

    1 Answer

    • Voted
    • Oldest
    • Recent
    1. I'M ADMIN
      2022-10-17T17:54:49+05:30Added an answer on October 17, 2022 at 5:54 pm

      If we talk about Optimality:

      In the Greedy method approach, there is no guarantee of getting the optimal solution, Generally, it gives the optimal local solution.

      while

      In the dynamic approach, there is a guarantee of getting an optimal solution as it considers all the cases as long to get optimal. It gives optimal global solutions.

       

      For example, let’s say that you have to get from point A to point B as fast as possible, in a given city, during rush hour. A dynamic programming algorithm will look into the entire traffic report, looking into all possible combinations of roads you might take, and will only then tell you which way is the fastest. Of course, you might have to wait for a while until the algorithm finishes, and only then can you start driving. The path you will take will be the fastest one (assuming that nothing changed in the external environment).

      On the other hand, a greedy algorithm will start you driving immediately and will pick the road that looks the fastest at every intersection. As you can imagine, this strategy might not lead to the fastest arrival time, since you might take some “easy” streets and then find yourself hopelessly stuck in a traffic jam.

       

       

       

      • 0
      • Reply
      • Share
        Share
        • Share on WhatsApp
        • Share on Facebook
        • Share on Twitter
        • Share on LinkedIn

    Leave an answer
    Cancel reply

    You must login to add an answer.

    Forgot Password?

    Need An Account, Sign Up Here

    Sidebar

    Stats

    • Questions 1k
    • Answers 1k
    • Posts 138
    • Best Answers 65
    • NPTEL Solution: Cloud Computing Assignment 2 Answers 2023
    • Solution Revealed: NPTEL Programming in Java Week 1 Assignment 2023
    • NPTEL Joy of Computing Using Python Assignment Answers Week 1 2023
    • NPTEL Cloud Computing Assignment 1 Answers 2023
    • NPTEL An Introduction to Artificial Intelligence Week 1 Assignment Answers 2023

    Popular Questions

    • I'M ADMIN

      Internshala ethical hacking final test answers: Question sequence differs but ...

      • 6 Answers
    • AK

      You have a green lottery ticket, with ints a, b, ...

      • 4 Answers
    • mj

      Solve by Gauss Elimination Method 5x+y+z+w=4 ,x+7y+z+w=12 , x+y+6z+w=-5, x+y+z+4w=-6

      • 3 Answers

    Explore

    • Recent Questions
    • Questions For You
    • Answers With Time
    • Most Visited
    • New Questions
    • Recent Questions With Time

    Footer

    Helpful Links

    • Disclaimer
    • Privacy Policy Notice
    • TERMS OF USE
    • FAQs
    • Refund/Cancellation Policy

    Follow

    © 2021-2022 Sikshapath. All Rights Reserved

    Insert/edit link

    Enter the destination URL

    Or link to existing content

      No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.