Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    ws-2.2 20bcs9740

    Uploaded by

    gol gappa
    The student implemented a subset sum problem using dynamic programming. The code takes in an array of integers, the size of the array, and a target sum. It uses a 2D DP array to store whether it is possible to reach the target sum by selecting numbers from the input array. The DP array is populated such that dp[i][j] is true if the target sum j can be achieved by selecting numbers from the first i elements of the input array. The code prints "Possible" if the target sum can be reached and "Not Possible" otherwise.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    ws-2.2 20bcs9740

    Uploaded by

    gol gappa
    7 views3 pages
    The student implemented a subset sum problem using dynamic programming. The code takes in an array of integers, the size of the array, and a target sum. It uses a 2D DP array to store whether it is possible to reach the target sum by selecting numbers from the input array. The DP array is populated such that dp[i][j] is true if the target sum j can be achieved by selecting numbers from the first i elements of the input array. The code prints "Possible" if the target sum can be reached and "Not Possible" otherwise.

    Original Description:

    Original Title

    ws-2.2_20bcs9740

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The student implemented a subset sum problem using dynamic programming. The code takes in an array of integers, the size of the array, and a target sum. It uses a 2D DP array to store whether it is possible to reach the target sum by selecting numbers from the input array. The DP array is populated such that dp[i][j] is true if the target sum j can be achieved by selecting numbers from the first i elements of the input array. The code prints "Possible" if the target sum can be reached and "Not Possible" otherwise.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    7 views3 pages

    ws-2.2 20bcs9740

    Uploaded by

    gol gappa
    The student implemented a subset sum problem using dynamic programming. The code takes in an array of integers, the size of the array, and a target sum. It uses a 2D DP array to store whether it is possible to reach the target sum by selecting numbers from the input array. The DP array is populated such that dp[i][j] is true if the target sum j can be achieved by selecting numbers from the first i elements of the input array. The code prints "Possible" if the target sum can be reached and "Not Possible" otherwise.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 3

    Experiment: 2.

    Student Name: Naitik onga UID:20BCS9740


    Branch: BE-CSE Section/Group: 804 A
    Semester:5th Subject Code:20CSP-312
    Subject Name: DAA Lab Date of Performance:31-10-2022

    1. Aim/Overview of the practical:


    To implement a subset-sum problem using dynamic programming

    2. Source Code:

    #include<bits/stdc++.h>
    using namespace std;
    void solve(int a[], int n, int sum)
    {
    int i,j;

    int dp[n+1][sum+1];

    for(i=0;i<=n;i++)
    dp[i][0]=1;

    for(j=0;j<=n;j++)
    dp[0][j]=0;

    for(i=1;i<=n;i++)

    {
    for(j=1;j<=sum;j++)
    {
    if(j<a[i])
    dp[i][j]=dp[i-1][j];

    else
    dp[i][j]=dp[i-1][j] || dp[i-1][j-a[i]];
    }
    }

    if(dp[n][sum]==1)
    cout<<"Possible"<<endl;

    else
    cout<<"Not Possible"<<endl;
    }
    int main()
    {
    int n;
    cin>>n;

    int a[n];

    for(long i=0;i<n;i++)
    {
    cin>>a[i];
    }

    int sum;
    cin>>sum;

    solve(a,n,sum);
    }

    \
    3. Result/Output:

    You might also like