Computer Science 252
Problem Solving with Java

Fall 2015, The College of Saint Rose

Home     Syllabus     Schedule     Examples     Style Guide     Refcard

Agenda

• Announcements
• Lecture 23 assignment recap
• Command-line parameters to Java applications (not in notes)
• Matrices
• Strings and Characters (will not cover specifially in class)
• In-class Exercise 24 - (10 lecture assignment points) due before the start of our next class.

  Your task is to add some functionality to the Matrix2D example and write code to test it in the main method there. The functionality you are to add:

  • A method max that returns the largest number in the matrix (5 points)
  • A destructive method, that is, a method that modifies the matrix on which it is called, named scale that multiplies each entry in the matrix by a number (5 points)

  Please demonstrate your program or submit only the file Matrix2D.java by email before the start of our next class. Email submissions should use a meaningful subject line, clearly indicating the course number and assignment name.

Lecture 24 Assignment

Due at the start of class, Tuesday, December 8.

Please submit answers to these questions either as a hard copy (typeset or handwritten are OK) or by email to terescoj AT strose.edu by the start of class. Please use a clear subject line when submitting by email (e.g., CSC 252 Lecture 24 Assignment , Joe Student). We will discuss these questions at the start of class, so no late submissions are accepted.

(20 points) Write a Java application in a class WordStats that takes the name of a text file as its command-line parameter, then reads all of the words in that file. It should ignore any word that contains a non-alphabetic character, but consider all other words to compute the information below. Your program should report to standard output (the terminal window) the following information:

• the number of words read in
• the first and last words alphabetically, ignoring case
• the longest and shortest words (list all words of the shortest and longest length, but only once each)
• the number of words that contain the substring "and" anywhere within the word
• the total number of times the letter 'e' (upper or lower case) occurs in all of the words that you did not ignore

Include simple error checking to ensure that the command-line parameter exists, and that the file was successfully opened.

Terminology

• matrices
• object types
• non-object/base/primitive types
• immutable
• characters
• ASCII
• Unicode

Examples

• Matrix2D