Scribd Logo
Upload

Welcome to Scribd!

  • 11 views

    Sam Ap 3.2

    Uploaded by

    Samarth Maheshwari
    1. The document describes Experiment 3.2 conducted by student Samarth Maheshwari to check for palindrome and solve Fibonacci sequence problems. 2. The aims were to write programs to check for palindromes and solve the Fibonacci sequence, where each term is the sum of the previous two terms. 3. The student implemented two programs, one to determine the minimum operations to convert a number to a binary palindrome, and another to calculate the nth term of the Fibonacci sequence recursively.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Sam Ap 3.2

    Uploaded by

    Samarth Maheshwari
    11 views4 pages
    1. The document describes Experiment 3.2 conducted by student Samarth Maheshwari to check for palindrome and solve Fibonacci sequence problems. 2. The aims were to write programs to check for palindromes and solve the Fibonacci sequence, where each term is the sum of the previous two terms. 3. The student implemented two programs, one to determine the minimum operations to convert a number to a binary palindrome, and another to calculate the nth term of the Fibonacci sequence recursively.

    Original Description:

    Its Advance Programming Worksheets 3.2

    Original Title

    sam ap 3.2

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. The document describes Experiment 3.2 conducted by student Samarth Maheshwari to check for palindrome and solve Fibonacci sequence problems. 2. The aims were to write programs to check for palindromes and solve the Fibonacci sequence, where each term is the sum of the previous two terms. 3. The student implemented two programs, one to determine the minimum operations to convert a number to a binary palindrome, and another to calculate the nth term of the Fibonacci sequence recursively.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    11 views4 pages

    Sam Ap 3.2

    Uploaded by

    Samarth Maheshwari
    1. The document describes Experiment 3.2 conducted by student Samarth Maheshwari to check for palindrome and solve Fibonacci sequence problems. 2. The aims were to write programs to check for palindromes and solve the Fibonacci sequence, where each term is the sum of the previous two terms. 3. The student implemented two programs, one to determine the minimum operations to convert a number to a binary palindrome, and another to calculate the nth term of the Fibonacci sequence recursively.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 4

    DEPARTMENT OF

    COMPUTER SCIENCE & ENGINEERING

    Experiment 3.2
    Student Name: Samarth Maheshwari UID: 21BCS10260
    Branch: BE-CSE Section/Group: IoT-613A
    Semester:5 Date: 30-10-2023
    Subject Name: Advance Programming Lab Subject Code: 21CSP-314

    Aim:
    1.WAP to check palindrome
    2.WAP to solve Fibonacci sequence
    Objective:
    1. You are given a number . In one operation, you can either increase the value of by 1 or decrease
    the value of by 1. Determine the minimum number of operations required (possibly zero) to
    convert number to a number such that binary representation of is a palindrome. Note: A binary
    representation is said to be a palindrome if it reads the same from left-right and right-left.
    2. The Fibonacci sequence appears in nature all around us, in the arrangement of seeds in a
    sunflower and the spiral of a nautilus for example. The Fibonacci sequence begins with and
    as its first and second terms. After these first two elements, each subsequent element is equal
    to the sum of the previous two elements. Programmatically:

    Script and Code:

    Program 1:-
    #include<bits/stdc++.h> using
    namespace std; typedef
    long long int ll;
    #define mp make_pair
    #define pb push_back
    #define pob pop_back()
    #define mod 1000000007
    #define max INT_MAX
    #define min INT_MIN
    #define fi first
    #define se second

    Name: Samarth Maheshwari UID:21BCS10260


    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING

    #define fast_cin() ios_base::sync_with_stdio(false);


    cin.tie(NULL); cout.tie(NULL) set < int > v; void
    binarypalindrome(int s, int e, int x) { if (s > e) {
    v.insert(x); return;
    } binarypalindrome(s + 1, e - 1, x); if
    (s == e)
    binarypalindrome(s + 1, e - 1, x + pow(2, s));
    else
    binarypalindrome(s + 1, e - 1, x + pow(2, s) + pow(2, e));
    return; } int main() { fast_cin(); int n, t;
    v.insert(0);
    v.insert(1);
    v.insert(3); for (int i = 3; i <
    32; i++) { int c = pow(2, i -
    1) + 1; binarypalindrome(1,
    i - 2, c);
    } cin >> t; while (t--) { cin >> n;
    auto ptr = v.lower_bound(n);
    auto ptr2 = ptr--; if (abs(n - * ptr)
    < abs(n - * ptr2)) cout << abs(n -
    * ptr) << endl; else
    cout << abs(n - * ptr2) << endl;
    } return
    0;
    }

    Program 2:-
    #include <iostream>
    using namespace std;
    int fibonacci(int n) {
    if (n ==0)
    return 0; else if

    Name: Samarth Maheshwari UID:21BCS10260


    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING

    (n== 1) return
    1;
    else return fibonacci(n-1)
    +fibonacci (n-2);
    } int main() { int
    n; cin >> n;
    cout <<
    fibonacci(n);
    return 0;
    }

    Output:

    Program 1

    Program 2

    Name: Samarth Maheshwari UID:21BCS10260


    DEPARTMENT OF
    COMPUTER SCIENCE & ENGINEERING

    Learning Outcomes:
    • Understand the problem of converting a number into a binary palindrome and the
    significance of palindrome representations.
    • Learn about the recursive nature of the Fibonacci sequence, where each term depends on the
    previous two terms.
    • Learn how to approach and solve a problem that involves making decisions to modify a
    numerical value efficiently.

    Name: Samarth Maheshwari UID:21BCS10260

    You might also like