>

CS 1323 Honors, Fall 1996

Individual Project 2
Diction Analysis

Due Monday, September 9, 4:29pm
- late papers not accepted -

Ground Rules What to Hand In (see also: example project solution)

Project 2A

Define a function called "matchingElements" that delivers a sequence made up of those elements of a sequence supplied as the second argument of the function that are equal to the value supplied as the first argument.

Project 2B

Define a function called "longerThan" that delivers those elements of a sequence of sequences supplied as its second argument whose lengths strictly exceed a number supplied as its first argument.

Project 2C

Define a function called "shorterThan" that delivers those elements of a sequence of sequences supplied as its second argument whose lengths are strictly less than a number supplied as its first argument.

Project 2D

Define a function called "bar" that delivers a string of asterisks. The number of asterisks in the string it delivers must be the same as the number of elements in the sequence supplied as the argument the function.

Project 2E

Define a function called "removePunctuation" that delivers a string like its argument, but containing no periods, commas, question marks, colons, semicolons, parentheses, quotation marks, or apostrophes.