The following reading assignments are made. Homework, in the form of a synopsis of the reading assignment or other designated assignment, will be collected at the beginning of the designated class meeting. The intention of these assignments is (1) to persuade everyone to read the text books, (2) to allow the instructor more time to emphasize major concepts and critical points in the text material, and (3) to allow class discussions to introduce material not covered in the text.

Homework not turned in when collected in class will be designated "late." Late homework will be accepted until 4 p.m. on the date the homework is due. Homework will not be accepted after 4 p.m. on the date due except in exceptional circumstances. Late homework will receive a 2 point (out of 10 points) penalty. Homework will not be accepted by email. If class is cancelled due to inclement weather, the homework will be due at the next class meeting.

The text of homework must be typed (unless specified otherwise) using new Roman Times or Times 12 pt. font, single spaced, and double spaced between paragraphs. Figures may be (probably should be) hand-drawn. Unless specified otherwise, it is expected that the synopsis be at least 1.5 pages in length. Homework must have the name of the person submitting the homework typed at the top of the first page. All pages must be stapled together. Failure to follow instructions will result in deduction of points (1 pt. for no name, 1 pt. for not correctly stapled).

These homeworks will be valuable to you. You will probably be allowed to use your synopses on some daily quizzes, on some part of some hour quizzes, and on some part of the final exam. Therefore, you should organize your work so that you can make the best use of it as a reference.

Homework is to be done individually. The purpose of the "read and report" homework is to make it possible to cover the course material effectively. Thus, it is important that each person read and write for themselves. If the instructor believes that homework has been jointly written, on the first occurrence the grade will be shared jointly among the writers. A second occurrence will be considered academic dishonesty and appropriate action will be taken.

#1 (due Friday, January 9)

#2 (due Monday, January 14)

#3 (due Wednesday, January 16)

In problems 1 - 3, your code should execute to give exactly the same results
in all situations.

1.  Rewrite the following code using a while-loop

	  do
	  {
		 x = x + inc;
		 n = n * n;
	  } while ( n < nMax );

2.  Rewrite the code in problem 1 using a for-loop.

3.  Rewrite the following code using a do-loop

	  while ( x <= xMax )
	  {
		 s = s / 10;
		 x = x + inc;
	  }

4.  Rewrite the code in problem 3 using a for-loop.

5.  Rewrite the following code using a while-loop.

	  for ( y = x ; z < x + y ; y = y - inc )
	  {
		 sum = sum + y;
	  }

6.  Rewrite the code in problem 5 using a do-loop. 

7.  In a single sentence, when do you prefer the do-loop?

8.  In a single sentence, when do you prefer the for-loop?

9.  Rewrite the following code using a switch statement.

	  if ( c == 'a' || c == 'e' || c == 'i' || c == 'u' )
		 vowel = true;
	  else
		 vowel = false;

10.  Read problem 3.1 on page 92.  Was 1900 a leap year?  Justify your answer.

#4 (due Friday, January 18)

#5 (due Wednesday, January 23)

	  public static int convert ( char c )
	  // pre: c is a character between '0' and '9' inclusive in ASCII code
	  // post:  The integer corresponding to c is returned

2.  Suppose String s is "Clemson University");

What is returned by s.charAt(1)?
What is returned by s.indexOf(' ')?
What is returned by s.substring(10)?
What is returned by s.substring(10,11)?

3.  Work Exercise 5.10 on page 137.

#6 (due Friday, January 25)

public static String reverseString ( String inputString )
// post:  returns the reverse of inputString
{

#7 (due Monday, January 28)

 public static String removeChar ( String s, char w )
 // pre:  s is not null  
 // post:  the String s, with all instances of w removed, is returned

#8 (due Wednesday, January 30)

 public static int sumDigits ( int number )
 // pre: number >= zero
 // post:  returns sum of digis of number

#9 (due Friday, February 1)

public static void createArray ( String [ ] stringList )
// post:  returns array of Strings to calling program
{
  ... // initialize stringList here
}   

public static String removeString ( String [ ] target, String toRemove )
// pre:  String toRemove exists and is not the empty String
// post:  Removes first occurrance of toRemove, preserving relative
//        order of remaining elements of array.  An empty String is
//        inserted as the last entry in target array.

public static void createVector ( Vector stringList )
// pre:  Vector stringList exists and is empty
// post:  returns Vector of Strings to calling program
{
  ... // initialize stringList here
}

public static void removeString ( Vector target, String toRemove )
// pre:  String toRemove exists and is not the empty String
// post:  if toRemove is an entry in target, toRemove is removed
//        without changing the order of the remaining Strings in target.
//        Only the first occurrance of toRemove is removed.
{
  ... // code here
}

#10 (due Monday, February 4)

  public Name ( String wholeName ) // a constructor 
  // pre:  The first and last names are each separated from the middle
  //       name by at least one space, as in "Jane  Smith Doe" .
  
  public Name ( String first, String middle, String last ) // constructor

  public String getFirst ( )
  // post:  returns the first name of the person

  public String getMiddle ( )
  // post:  returns the middle name of the person

  public String getLast ( )
  // post:  returns the last name of the person

You are not requested to include the main method, but an example of how the 
main method might begin is:

  public static void main ( String [ ] args )
  // test driver for Name class
  {
	 Name one = new Name ( "John Quincey Adams" );
	 System.out.println ("The last name of John Quincey Adams is "
		+ one.getLast ( ) );

	 Name two = new Name ( "George", "Bernard", "Shaw" );  
	 System.out.println ("The middle name of George Benard Shaw is "
		+ two.getMiddle ( ) );

	 // more test code here
  }

#11 (due Wednesday, February 6)

public class Primes
{
  static int [ ] primeArray;
  static int primeCount;
  static final int MAX_COUNT = 20;

  public static void main ( String [ ] args )
  {
	 primeArray = new int [ MAX_COUNT ];
	 primeArray [0] = 2;
	 primeArray [1] = 3;
	 primeArray [2] = 5;
	 primeArray [3] = 7;
	 primeArray [4] = 11;
	 primeCount = 5;  // the number primes stored in the array primeArray
	 storeNextPrime ( );
	 // more code with more calls to storeNextPrime and print statements
  }

  private static void storeNextPrime ( )
  // pre: primeCount < MAX_COUNT - 1      
  // post:  primeArray[primeCount] is initialized to the next prime
  //       after primeArray[primeCount - 1] and primeCount is incremented.

#12 (due Friday, February 8)

• 1. What is a container class?
• 2. What is the purpose of threads in Java?
• 3. What is a Java Virtual Machine and why is it important?
• 4. Why is the Turing machine an important concept?
• 5. What is a P-RAM? What is it used for?

No homework for Wednesday, February 13

#13 (due Friday, February 15)

// names of global variables
static private int [ ] primeArray;    // holds the prime numbers
static int primeCount;           // how many primes have been stored

private static void resize ( )
// post:  the size of the array holding the primes is doubled
{
  // code goes here
}

#14 (due Friday, February 22)

#15 (due Monday, February 25)

#16 (due Friday, March 8)

To answer the second question, we will assume use of the methods:

   private ListElement first ( ) // in the List class
   // post:  returns a reference to the first Element in the List

   private ListElement next ( ListElement current ) // in the ListElement class
   // post:  returns a reference to the the next ListElement after current

#17 (due Monday, April 1)

           30    -2    15    18    -5    0    10    -35   65
          [0]   [1]   [2]   [3]   [4]   [5]   [6]   [7]   [8] 

#18 (due Friday, April 26)

• A = - B
• A = - B - C
• A = (-B) - C
• A = - (B - C)
• A = - B + ( - C )

Return to Eleanor Hare's home page.

Return to Department of Computer Science Home page.