Scribd Logo
Upload

Welcome to Scribd!

  • Tutorial 1: E2008: Data Structure & Algorithms

    Uploaded by

    glenlcy
    17 views1 page
    The document provides 6 algorithm problems: 1) Return the sum of the first m elements of an array. 2) Output the smallest and largest values in an array of m unique elements. 3) Return the index of the first occurrence of a key value in an array, or 0 if not present. 4) Reverse the elements of an array. 5) Insert a value into a sorted array while maintaining sort order. 6) Determine the number of times a statement is executed in the best and worst cases of an algorithm to find the maximum element of an array.

    Original Description:

    Data Structures tutorial

    Original Title

    Tutorial 1

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides 6 algorithm problems: 1) Return the sum of the first m elements of an array. 2) Output the smallest and largest values in an array of m unique elements. 3) Return the index of the first occurrence of a key value in an array, or 0 if not present. 4) Reverse the elements of an array. 5) Insert a value into a sorted array while maintaining sort order. 6) Determine the number of times a statement is executed in the best and worst cases of an algorithm to find the maximum element of an array.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    17 views1 page

    Tutorial 1: E2008: Data Structure & Algorithms

    Uploaded by

    glenlcy
    The document provides 6 algorithm problems: 1) Return the sum of the first m elements of an array. 2) Output the smallest and largest values in an array of m unique elements. 3) Return the index of the first occurrence of a key value in an array, or 0 if not present. 4) Reverse the elements of an array. 5) Insert a value into a sorted array while maintaining sort order. 6) Determine the number of times a statement is executed in the best and worst cases of an algorithm to find the maximum element of an array.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    E2008: Data Structure & Algorithms Tutorial 1 1. Write an algorithm that returns the sum of first m elements of an array S.

    ver 1.1

    2. Write an algorithm that outputs the smallest and largest values in the array S which has m unique elements. 3. Write an algorithm that returns the index of the first occurrence of the value key in the array s[1], , s[n]. If key is not in the array, the algorithm returns the value 0. 4. Write an algorithm that reverses the array s[1], , s[n]. 5. Given an array s[1], , s[n] such that n > 1 and s[i] s[i+1] for all i. Write an algorithm that insert an input value x into the array so that s[i] s[i+1] for all i. 6. The algorithm for finding the maximum element of an array is in the following Algorithm arrayMax(A, n) Input array A of n integers Output maximum element of A currentMax = A[0] for i = 1 to n 1 do if A[i] > currentMax then currentMax = A[i] return currentMax Determine the number of times that the statement currentMax = A[i] will be executed in the best case and in the worst case.

    You might also like