Scribd Logo
Upload

Welcome to Scribd!

  • 17 views

    ps1 1

    Uploaded by

    Shehraiz Khan

    Copyright:

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

    ps1 1

    Uploaded by

    Shehraiz Khan
    17 views2 pages

    Original Title

    ps1_1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    ps1 1

    Uploaded by

    Shehraiz Khan

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    1

    FORMAN CHRISTIAN COLLEGE


    Department of Computer Science
    COMP 451 – Compiler Construction
    PROBLEM SET
    Problem Set 1

    Reading:

    • Text (SICP 2nd Edition by Abelson & Sussman): section 1.1

    The purpose of the exercises below is to familiarize you with the basics of Scheme language and
    interpreter. Spending a little time on simple mechanics now will save you a great deal of time over
    the rest of the semester.

    1. Write a Scheme procedure (interval-contains? interval number) where interval is an


    interval and number is an integer. The procedure returns a Boolean value that indicates
    whether number is in the closed interval.
    interval-contains? : Interval × Integer → Boolean
    Examples: (interval-contains? ’(5 8) 6) => t
    (interval-contains? ’(5 8) 5) => t
    (interval-contains? ’(5 8) 4) => f
    (interval-contains? ’(5 5) 14) => f
    2. Write a Scheme procedure (interval-intersects? i1 i2) where i1 and i2 are intervals.
    It returns a Boolean value that indicates whether the intervals have a nonempty intersection.
    Edge case: If the intersection contains a single number, this procedure should return #t.
    interval-intersects? : Interval × Interval → Boolean
    Examples: (interval-intersects? ’(1 4) ’(2 5)) => t
    (interval-intersects? ’(2 5) ’(1 14)) => t
    (interval-intersects? ’(2 5) ’(1 2)) => t
    (interval-intersects? ’(1 1) ’(1 1)) => t
    (interval-intersects? ’(1 3) ’(12 17)) => f
    3. The union of two intervals is a list containing

    • both intervals, if the intervals dont intersect, or


    • a single, possibly larger, interval if the intervals do intersect.

    Write a Scheme procedure (interval-union i1 i2) that returns the union of the intervals
    i1 and i2.
    interval-union: Interval × Interval → Listof(Interval)
    Examples: (interval-union ’(1 5) ’(2 6)) => ((1 6))
    (interval-union ’(1 5) ’(2 4)) => ((1 5))
    (interval-union ’(1 5) ’(5 5)) => ((1 5))
    (interval-union ’(1 5) ’(15 25)) => ((1 5) (15 25))
    (interval-union ’(5 5) ’(25 25)) => ((5 5) (25 25))
    Comp 451, PROBLEM SET—Problem Set 1 2

    Caution: Look carefully at the form of the return values. In the past, sometimes students
    procedures have produced (1 6) instead of ((1 6)).

    4. Write the procedures first, second, and third that pick out those corresponding parts of a
    proper list. You do not have to handle the case where the list is too short to have the
    requested part.
    Examples: (first (a b c d e)) => a
    (second (a b c d e)) => b
    (third (a b c d e)) => c

    5. Write the procedures nth(n lst) that pick out the nth element from the list. In case the
    index given is out of range the procedure should print an error message.
    Examples: (nth 1 (a b c d e)) => a
    (nth 4 (a b c d e)) => d
    (nth 9 (a b c d e)) => "error"

    6. Write the procedure (make-vec-from-points p1 p2) that returns the vector that goes from
    the point p1 to the point p2.
    make-vec-from-points: Point × Point → Vector
    Examples: (make-vec-from-points ’(1 3 4) ’(3 6 2)) => (2 3 -2)

    7. Write the procedure (dot-product v1 v2) that returns the dot-product (scalar product) of
    the two vectors v1 and v2.
    dot-product: Vector × Vector → Number
    Examples: (dot-product ’(1 2 3) ’(4 5 6)) => 32 ; This is 1*4 + 2*5 + 3*6

    8. Write the procedure (magnitude v) that returns the magnitude of the vector v. So that we
    do not have to worry about round-off error, the test cases will only use examples where the
    magnitude of the vector is an integer.
    vec-length: Vector => Number
    Examples: (magnitude ’(3 4 12)) => 13

    9. Write the procedure (distance p1 p2) that returns the distance from the point p1 to the
    point p2. So that we do not have to worry about round-off error, the test cases will only use
    examples where the returned value is an integer.
    [Hint: You may want to call some previously-defined procedures in your definition
    distance: Point × Point → Number
    Examples: (distance ’(3 1 2) ’(15 -15 23)) => 29

    You might also like