Scribd Logo
Upload

Welcome to Scribd!

  • 621 views

    Exercises 1

    Uploaded by

    Mamata Sreenivas
    The document contains algorithms and exercises related to sorting arrays and finding common elements between arrays, computing square roots, and string matching. Specifically: 1. An algorithm is given to find the floor of the square root of a positive integer using only basic arithmetic operations. 2. An algorithm is described to find all common elements between two sorted lists by iterating through both lists and checking for matches, with a time complexity of m*n comparisons where m and n are the list lengths. 3. Exercises include improving an algorithm to find the minimum distance between elements in an array, and designing a simple string matching algorithm.

    Copyright:

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

    Exercises 1

    Uploaded by

    Mamata Sreenivas
    621 views3 pages
    The document contains algorithms and exercises related to sorting arrays and finding common elements between arrays, computing square roots, and string matching. Specifically: 1. An algorithm is given to find the floor of the square root of a positive integer using only basic arithmetic operations. 2. An algorithm is described to find all common elements between two sorted lists by iterating through both lists and checking for matches, with a time complexity of m*n comparisons where m and n are the list lengths. 3. Exercises include improving an algorithm to find the minimum distance between elements in an array, and designing a simple string matching algorithm.

    Original Title

    Exercises 1.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains algorithms and exercises related to sorting arrays and finding common elements between arrays, computing square roots, and string matching. Specifically: 1. An algorithm is given to find the floor of the square root of a positive integer using only basic arithmetic operations. 2. An algorithm is described to find all common elements between two sorted lists by iterating through both lists and checking for matches, with a time complexity of m*n comparisons where m and n are the list lengths. 3. Exercises include improving an algorithm to find the minimum distance between elements in an array, and designing a simple string matching algorithm.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    621 views3 pages

    Exercises 1

    Uploaded by

    Mamata Sreenivas
    The document contains algorithms and exercises related to sorting arrays and finding common elements between arrays, computing square roots, and string matching. Specifically: 1. An algorithm is given to find the floor of the square root of a positive integer using only basic arithmetic operations. 2. An algorithm is described to find all common elements between two sorted lists by iterating through both lists and checking for matches, with a time complexity of m*n comparisons where m and n are the list lengths. 3. Exercises include improving an algorithm to find the minimum distance between elements in an array, and designing a simple string matching algorithm.

    Copyright:

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

    Exercises 1.

    1
    4. Design an algorithm for computing ⌊ √ n ⌋ for any positive integer n. Besides
    assignment and comparison, your algorithm may only use the four basic
    arithmetical operations.
    int sqroot(int n)
    { int i, m, p;
    p = 1;
    for(i=2; i < 100; i++)
    { m = i*i;
    if( m > n) break;
    p = m;
    }
    return p/i+1;
    }
    5. Design an algorithm to find all the common elements in two sorted lists of numbers.
    For example, for the lists 2, 5, 5, 5 and 2, 2, 3, 5, 5, 7, the output should be 2, 5, 5.
    What is the maximum number of comparisons your algorithm makes if the lengths
    of the two given lists are m and n, respectively?
    #include <stdio.h>
    void commonEle(int a[], int m, int b[], int n)
    { int i, j;
    for(i=0; i < m; i++)
    for(j=0; j < n; j++)
    if(a[i] == b[j])
    { printf(" %d ", a[i]);
    i++; j++;
    }
    }
    int main()
    { int a[4] = {2, 5, 5, 5};
    int b[6] = {2, 2, 3, 5, 5, 7};
    commonEle(a, 4, b, 6);
    return 0;
    }
    The maximum number of comparisons your algorithm makes if the lengths of
    the two given lists are m and n, respectively?
    Ans: m*n

    1
    7. Prove the equality gcd(m, n) = gcd(n, m mod n) for every pair of positive
    integers m and n.
    For any pair of positive integers m and n, if d divides both m and n, it also
    divides both n and r = m mod n = m−qn. Similarly, if d divides both n and
    r = m mod n = m − qn, it also divides both m = r + qn and n. Thus, the two pairs
    (m, n) and (n, r) have the same finite nonempty set of common divisors,
    including the largest element in the set, i.e., gcd(m, n) = gcd(n, r).

    Exercises 1.2
    1. Describe the standard algorithm for finding the binary representation of a positive
    decimal integer.
    void binary(int n)
    { if( n > 1 )
    binary(n/2);
    printf("%d ", n%2);
    }
    .
    9. Consider the following algorithm for finding the distance between the two closest
    elements in an array of numbers.

    ALGORITHM MinDistance(A[0..n − 1])


    // Input: Array A[0..n − 1] of numbers
    // Output: Minimum distance between two of its elements
    Dmin = infinity
    for i = 0 to n − 1 do
    for j = 0 to n − 1 do
    if i ≠ j and abs(A[i]− A[j ]) < dmin
    dmin = abs(A[i]− A[j ])
    return dmin

    Make as many improvements as you can in this algorithmic solution to the


    problem. If you need to, you may change the algorithm altogether; if not,
    improve the implementation given.
    Algorithm MinDistance2 (A[0..n − 1])
    dmin ←∞
    for i ← 0 to n − 2 do
    for j ← i +1 to n − 1 do
    temp ← |A[i] − A[j]|
    if temp < dmin
    dmin ← temp
    return dmin

    2
    Exercises 1.3
    1. Consider the algorithm for the sorting problem that sorts an array by counting, for
    each of its elements, the number of smaller elements and then uses this
    information to put the element in its appropriate position in the sorted array:

    Algorithm ComparisonCountingSort(A[0..n − 1], S[0..n − 1])


    // Sorts an array by comparison counting
    // Input: Array A[0..n − 1] of orderable values
    // Output: Array S[0..n − 1] of A’s elements sorted in non-decreasing order
    for i ← 0 to n − 1 do
    Count[i] ← 0
    for i ← 0 to n − 2 do
    for j ← i + 1 to n − 1 do
    if A[i] < A[j]
    Count[j] ← Count[j] + 1
    else Count[i] ← Count[i] + 1
    for i ← 0 to n − 1 do
    S[Count[i]] ← A[i]

    a. Apply this algorithm to sorting the list 60, 35, 81, 98, 14, 47.
    b. Is this algorithm stable?
    c. Is it in-place?

    3. Design a simple algorithm for the string-matching problem.

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy