Supplemental Problems For Computer Science 153

Supplemental Problems

Supplemental Problems

Supplemental Problems extend the range of problems considered in the course and help sharpen problem-solving skills. Starred problems may be turned in for extra credit.

Format: In turning in any programs for the course, please follow these directions:

  1. The first three lines of any Scheme program should be comments containing your name, your mailbox number, and an identification of assignment being solved. For example:
        ;;; Henry M. Walker
        ;;; Box Y-06
        ;;; Supplemental Problem 2
    Also, a comment is needed for every procedure, stating in English what that procedure is supposed to do.

  2. Obtain a listing of your program and a record of relevant test runs using the submit command:

  3. Either write on your printout or include a separate statement that argues why your program is correct, based upon the evidence from your test runs.
List Processing: A common processing pattern in Scheme involves operating on pairs of adjacent elements in a list rather than on single elements. For instance, we might want a procedure adjacent-sums that takes a non-empty list of numbers and returns a list of the sums of adjacent pairs, thus:

(adjacent-sums '(1 2 3 4 5 6 7)) ===> (3 5 7 9 11 13)
(adjacent-sums '(-5 12 13 0 -8)) ===> (7 25 13 -8)
(adjacent-sums '(7/3 -1/2 8/5 9/4)) ===> (11/6 11/10 77/20)
(adjacent-sums '(4 7)) ===> (11)
(adjacent-sums '(16)) ===> ()
Here's how we'd write it:

(define adjacent-sums
  (lambda (ls)
    (if (null? (cdr ls))
        (cons (+ (car ls) (cadr ls)) (adjacent-sums (cdr ls)))
  1. Give your own rendition of this procedure ``in English.''

  2. Write and test a Scheme procedure adjacent-elements that takes any non-empty list ls and returns a list of two-element lists, each two-element list consisting of two adjacent elements of ls.
    (adjacent-elements '(a b c d e)) ===> ((a b) (b c) (c d) (d e))
    (adjacent-elements '(5 12 12 0)) ===> ((5 12) (12 12) (12 0))
    (adjacent-elements '(first second)) ===> ((first second))
    (adjacent-elements '(only)) ===> ()
  3. Write and test a Scheme predicate (a procedure that always returns #t or #f) that takes any non-empty list of real numbers and determines whether they are in ascending numerical order, in the sense that each one is strictly less than the one that follows it.
    (ascending? '(-50 0 50 100 150)) ===> #t
    (ascending? '(3.8 4.1 5.0)) ===> #t
    (ascending? '(1 2 3 5 4 6 7 8)) ===> #f
    (ascending? '(0 0 0 0)) ===> #f
    (ascending? '(-2 -3)) ===> #f
    (ascending? '(17)) ===> #t
Another Exercise
  1. (*)A baby sitter charges $1.50 per hour until 9:00 pm (while the kids are still up), $1.00 per hour between 9:00 pm and midnight, and $1.25 per hour after midnight (since late night baby sitting interferes with morning classes).

    Write a procedure that takes as arguments the sitter's starting time in hours and minutes and the ending time in hours and minutes and then computes the sitter's fee. Assume all times are between 6:00 pm and 6:00 am.

Identifying Frequently Used Words
  1. Lab 38 on Arrays and Hash Tables presents a basic program to count words read from the keyboard. This exercise asks you to complete part J6.4 of that lab and then extend your work to identify which words are used most often.

    Work proceeds in three steps:

    1. Translate the insertion sort from the Scheme lab on sorting, so that it becomes a method in Java.

    2. Modify the sorting algorithm, so that while it orders the count array it also moves the words array in a corresponding way. Thus, the count and words arrays will continue to be parallel, with count[i] giving the word count for words[i].

    3. Use the resulting ordered array to print out the 10 most common words read from the keyboard.

    Reading Test Data

    1. (*)File in directory ~walker/151s/labs contains information on test results for a certain class. Each line of the file contains a students first and last name and the results of three hour tests. Write a program that computes the average test score for each student, the maximum and the minimum scores for each test, and prints the results in a nicely formatted table. For example, the table might have the following form:
           Name                        Test
      First        Last        1       2       3     Average
      Egbert       Bacon      88      85      92      88.33   
      Maximum                 --      --      --
      Minimum                 --      --      --
    Information on the 1997-1998 Iowa Senate

    1. File /u2/walker/151s/labs/ia-senate contains information about the members of the 1997-1998 Iowa Senate. After a title line and a blank line, a typical line has the following form:
      Angelo          Jeff        44      Creston           IA 50801
      Kramer          Mary        37      West Des Moines   IA 50265
      Lundby          Mary        26      Marion            IA 52302-0563
      Thus, a typical line gives the last name, the first name, the district number, the town of residence, the state (always IA), and the town's zip code. The information in these lines is arranged in columns.

      Design and write a Scheme program that reads in data from this file and creates two output files, senators-by-district and senators-by-zip-code, in the current working directory. The senators-by-district file should contain the same data as the source file, in the same format, but with the lines arranged by senate district (column 3). The other file, senators-by-zip-code, should contain a list of all senators in the following format

      Jeff Angelo
      Creston, IA 50801
      A blank line should appear after each senator and city address. In this format, the name appears on a first line (first name, then last), and the city, a comma, the state, and zip code is on the next line -- separated by single spaces in the format shown. Note that a variation of this format (with a street address, if available) might be used for a mailing label.

    Any of the following problems may be done for extra credit. As noted in the course syllabus, however, a student's overall problems' average may not exceed 120%.

    Multiplication of Three-Digit Integers

    1. Write a procedure that has two three-digit integers as parameters and then prints their product in the following format:
          x   381
    Unusual Canceling
    1. The fraction 64/16 has the unusual property that its reduced value of 4 may be obtained by "canceling" the 6 in the numerator with that in the denominator. Write a program to find the other fractions whose numerators and denominators are two-digit numbers and whose values remain unchanged after "canceling."

      Of course, some fractions trivially have this property. For example, when numerator and denominator are multiples of 10, such as 20/30, one can always "cancel" the zeroes. Similarly, cancelation is always possible when the numerator and denominator are equal, as in 22/22. Your program should omit these obvious cases.

    Roman Numerals
    1. Write a procedure that reads an integer between 1 and 1000 from the keyboard and prints the equivalent number in Roman numerals.

    City Data

    1. (*)The file ~walker/151p/labs/lab26.dat contains several items of information about large American cities. More specifically, in ~walker/151p/labs/lab26.dat , each entry consists of the name of the city (line 1), the county or counties (line 2) and the state (line 3) in which it is situated, the year in which it was incorporated (line 4), its population as determined by the census of 1980 (line 5), its area in square kilometers (line 6), an estimate of the number of telephones in the city (line 7), and the number of radio stations (line 8) and television stations (line 9) serving the city. Thus a typical entry reads as follows:
      New Mexico
      A blank line follows each entry, including the last.

      Write a procedure which has a filename as parameter and which answers the following questions about the cities represented in the data files.

      1. Which of those cities has the highest population density (population divided by area)?
      2. Which of these cities has over one million telephones?
      3. Which city has the lowest per capita number of radio and television stations (together)?
      The answers to each of these questions should be printed neatly and clearly by the procedure.

    File Analysis

    1. (*)Write a procedure file-analysis that takes the name of a file as its argument, opens the file, reads through it to determine the number of words in each sentence, displays the total number of words and sentences, and computes the average number of words per sentence. The results should be printed in a table (at standard output), such as shown below:
           This program counts words and sentences in file "comp.text ".
           Sentence:  1    Words: 29
           Sentence:  2    Words: 41
           Sentence:  3    Words: 16
           Sentence:  4    Words: 22
           Sentence:  5    Words: 44
           Sentence:  6    Words: 14
           Sentence:  7    Words: 32
           File "comp.text" contains 198 words words in 7 sentences
           for an average of 28.3 words per sentence.
      In this program, you should count a word as any contiguous sequence of letters, and apostrophies should be ignored. Thus, "word", "sentence", "O'Henry", "government's", and "friends'" should each be considered as one word.

      Also in the program, you should think of a sentence as any sequence of words that ends with a period, exclamation point, or question mark.
      Exception: A period after a single capital letter (e.g., an initial) or embedded within digits (e.g., a real number) should not be counted as being the end of a sentence.
      White space, digits, and other punctuation should be ignored.

This document is available on the World Wide Web as

created February 6, 1997
last revised April 22, 2000 Henry Walker (