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

Sorry, you do not have permission to ask a question, You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here
Sign InSign Up

SIKSHAPATH

SIKSHAPATH Navigation

  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Home/Questions/Q 22648
Next
In Process
practice503
  • 0
practice503
Asked: October 23, 20222022-10-23T20:21:49+05:30 2022-10-23T20:21:49+05:30In: Data Structure

Analyse the algorithm (in terms of both time and space) …

  • 0

Analyse the algorithm (in terms of both time and space) of subset sum problem using dynamic programming technique. Also write down the part of mentioned algorithm that contributes most towards the time and space complexity.

assignmentdaa
  • 1 1 Answer
  • 32 Views
  • 0 Followers
  • 0
Answer
Share
  • Facebook

    1 Answer

    • Voted
    • Oldest
    • Recent
    1. 58n25709
      2023-01-30T10:11:55+05:30Added an answer on January 30, 2023 at 10:11 am

      The time complexity of the subset sum problem using dynamic programming technique is O(nW), where n is the number of items and W is the target sum. The space complexity is O(nW).

      The most time-consuming part of the algorithm is the bottom-up dynamic programming loop, where each cell in the n x W matrix is filled in. This loop takes O(nW) time in total.

      The most space-consuming part of the algorithm is the n x W matrix itself, which requires O(nW) space to store the results of the dynamic programming.

      Overall, both the time and space complexity are directly proportional to the size of the n x W matrix, making the dynamic programming solution to the subset sum problem an exponential-time algorithm.

      • 0
      • Reply
      • Share
        Share
        • Share on WhatsApp
        • Share onFacebook
        • 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

    store ads

    Stats

    • Questions 1k
    • Answers 1k
    • Posts 141
    • Best Answers 64
    • AI 101: Create Presentation Slide Using AI | Gamma App
    • What is the Difference Between Section, Article and Aside in HTML5?
    • How to enable or disable ChatGPT on the Windows 11 taskbar
    • NPTEL Data Mining Assignment Answers 2023 -Week 8
    • NPTEL Data Mining Assignment Answers 2023 -Week 7

    Explore

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

    Footer

    Sikshapath Logo

    Helpful Links

    • Contact
    • Disclaimer
    • Privacy Policy Notice
    • TERMS OF USE
    • FAQs
    • Refund/Cancellation Policy
    • Delivery Policy for Sikshapath

    Follow Us

    © 2021-23 Sikshapath. All Rights Reserved

    Ads Blocker Image Powered by Code Help Pro

    Ads Blocker Detected!!!

    We have detected that you are using extensions to block ads. Please support us by disabling these ads blocker.

    Refresh
    Powered By
    100% Free SEO Tools - Tool Kits PRO

    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.