Scribd Logo
Upload

Welcome to Scribd!

  • Problems Easy PDF

    Uploaded by

    Antonia Mihaela
    27 views2 pages
    The document contains 11 programming problems of varying complexity: 1) Read and display the greatest of two numbers 2) Read and perform calculations on 3 numbers 3) Return the sum of two numbers unless it's between 10-19 then return 20 4) Return true if a number is 6 or if sum/difference is 6 5) Return the closest number to 21 without going over from two numbers 6) Return true if two numbers can sum to a third 7) Read a number and display number of digits 8) Read numbers until even and print array 9) Return largest span of repeated values in an array 10) Return true if all numbers in inner array are in outer sorted array

    Original Description:

    Original Title

    Problems_easy.pdf

    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 document contains 11 programming problems of varying complexity: 1) Read and display the greatest of two numbers 2) Read and perform calculations on 3 numbers 3) Return the sum of two numbers unless it's between 10-19 then return 20 4) Return true if a number is 6 or if sum/difference is 6 5) Return the closest number to 21 without going over from two numbers 6) Return true if two numbers can sum to a third 7) Read a number and display number of digits 8) Read numbers until even and print array 9) Return largest span of repeated values in an array 10) Return true if all numbers in inner array are in outer sorted array

    Copyright:

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

    Problems Easy PDF

    Uploaded by

    Antonia Mihaela
    The document contains 11 programming problems of varying complexity: 1) Read and display the greatest of two numbers 2) Read and perform calculations on 3 numbers 3) Return the sum of two numbers unless it's between 10-19 then return 20 4) Return true if a number is 6 or if sum/difference is 6 5) Return the closest number to 21 without going over from two numbers 6) Return true if two numbers can sum to a third 7) Read a number and display number of digits 8) Read numbers until even and print array 9) Return largest span of repeated values in an array 10) Return true if all numbers in inner array are in outer sorted array

    Copyright:

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

    1.

    Write a small program that reads 2 numbers from keyboard and display on the console
    the greatest number

    2. Write a small program that reads 3 numbers from keyboard and displays on the console
    the following results:

    a+b+c

    2*a + 3*b+4*c

    (a+b)/c as a double (the exact value)

    3. Given 2 ints, a and b, return their sum. However, sums in the range 10..19 inclusive, are
    forbidden, so in that case just return 20.

    sortaSum(3, 4) → 7
    sortaSum(9, 4) → 20sssss
    sortaSum(10, 11) → 21

    4. The number 6 is a truly great number. Given two int values, a and b, return true if either
    one is 6 or if their sum or difference is 6

    love6(6, 4) → true
    love6(4, 5) → false
    love6(1, 5) → true

    5. Given 2 int values greater than 0, return whichever value is nearest to 21 without going
    over. Return 0 if they both go over.

    blackjack(19, 21) → 21
    blackjack(21, 19) → 21
    blackjack(19, 22) → 19

    6. Given three ints, a b c, return true if it is possible to add two of the ints to get the
    third.sss

    twoAsOne(1, 2, 3) → true
    twoAsOne(3, 1, 2) → true
    twoAsOne(3, 2, 2) → false

    7. Read a number from keyboard and store it in a variable named a. Find the numbers of
    digits of a and display the value on console
    8. Read numbers from keyboard and store them in an array until the user inputs an even
    number. Print the resulting array

    9. Consider the leftmost and righmost appearances of some value in an array. We'll say
    that the "span" is the number of elements between the two inclusive. A single value has
    a span of 1. Returns the largest span found in the given array. (Efficiency is not a
    priority.)

    maxSpan([1, 2, 1, 1, 3]) → 4
    maxSpan([1, 4, 2, 1, 4, 1, 4]) → 6
    maxSpan([1, 4, 2, 1, 4, 4, 4]) → 6

    10. Given two arrays of ints sorted in increasing order, outer and inner, return true if all of
    the numbers in inner appear in outer. The best solution makes only a single "linear" pass
    of both arrays, taking advantage of the fact that both arrays are already in sorted order.

    linearIn([1, 2, 4, 6], [2, 4]) → true


    linearIn([1, 2, 4, 6], [2, 3, 4]) → false
    linearIn([1, 2, 4, 4, 6], [2, 4]) → true

    11. Write a program that finds the maximum element from an array

    You might also like