HOME | Overview | Syllabus | Instructor | Lectures | Laboratories | Readings | Assignments | Resources | Other Links

---

CS 1713 Lecture 34: Practice Problems for Review
November 17, 1999

• Do part of the solution for Lab 7, reiterating scope.

• You should know how to work with arrays of primitive types (int, double, boolean and char) and arrays of String objects. Questions involving arrays of more complicated objects will be deferred to the final examination.

• Assume that apple is an array of integers and banana is an array of Strings. Write a Java code segment to accomplish each of the following:
  • Add 3 to each element in apple.
  • Square each element of apple.
  • Set the element in position 2 of banana to "delicious"
  • Find the largest value in apple.
  • Find the position of the largest value in apple.

• Write the following public methods.
  • public boolean match(int [] a, int [] b) returns true if a and b are of the same length and their elements match.
  • public boolean match(String [] a, String [] b).
  • public int countValues(int [] a, int value) returns the number of times value appears in the array a.
  • public int linearSearch(String [] a, String name) returns the position of an item that matches name in the array a.

• Output the number of times each of the numbers 0 through 9 appear in a stream of 1000 random numbers that range from 0 to 19.

• String methods to know for this test:
  • compareTo
  • equals
  • length - note this is a method, in contrast to the length field for arrays.

• Additional String methods to know for the final examination:
  • substring
  • indexOf
  • charAt

---

Objective: Practice using arrays and loops in preparation for exam II.

---

Last revision: November 19, 1999 at 8:30 am