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

---

CS 1713 Lecture 42: Review
December 8, 1999

• Comprehensive but emphasizing the later material, since that incorporates all earlier programming skills.
• Types of programming problems:
  • Write a method to do X.
  • Write a code segment to do X.
  • Design a class with the following properties....
  • Instantiate objects of a specified class and use them to solve a problem.
  • Trace the following code segment. (Since this wasn't on either exam, you can expect a problem on the final.) Here are some hints:
    • Represent each variable by a rectangle. For objects and arrays, this rectangle will reference a more complicated structure which you should also show.
    • As the value of a primitive variable changes, you should display successive values from right to left, crossing out the old values.
    • For variables that hold references, the value will be represented by an arrow to something else. As the variable changes, indicate the old reference is no longer valid by putting two short lines across it. You should also number the order of the references.
  • Draw a picture of the variables and objects after the following code is executed. (As you probably have already figured out, I really like this kind of problem so you can expect to see it on the final.)

• Object-oriented terminology:
  • Class versus object.
  • Field versus method.
  • Instantiation.
  • Polymorphism.
  • Inheritance.
  • Is-a versus has-a.
  • Method overloading.
  • Constructor.
  • Visibility - private versus public.

• Scope and parameter passing:
  • Given a code segment, you should be able to specify the scope of any variable in the segment.
  • You should be able to explain how parameters are passed to methods and constructors.

• Binary search and the selection sort algorithms:
  • You should be able to reproduce the algorithm or its variations (ascending versus descending, objects rather than primitive types).
  • You should be able to trace the algorithm if given it.
  • You should be able to show what the algorithm does on a specified array, without writing down the algorithm or having it on the exam.

• Special classes:
  • Be able to use Vector and String classes in code.
  • You will be given the methods that you need to do the implementation so you don't need to memorize the definitions.
  • String methods to be familiar with:
    • charAt
    • indexOf
    • substring
    • equals
    • compareTo
    • length
  • Vector methods to be familiar with:
    • size
    • addElement
    • addElementAt
    • insertElementAt
    • removeElementAt
    • elementAt

---

Objective: Review for the Final

---

Last revision: December 4, 1999 at 6:10 am