CPSC 219: Extra Ideas For Practice

Extra review questions: Code writing

• Calling a method within the methods of the same class

• Calling a method outside the methods of a class

• Writing a program that illustrates an example of: information hiding, method overloading, attributes and local variables

• Converting an iterative program to a recursive equivalent

• Any of the linked list functions covered in class plus:

•      In order insert (using two pointers "2-step" and 1 pointer "peek-ahead")

•      Search and remove (using  1 pointer "peek-ahead")

•      Reverse order insert

•      Recursive reverse order display

• Array operations covered in class plus:

•      In order insert

•      Reverse order insert

•      Recursive display (reverse order)

•      Iterative display (reverse order)

•      Search and replace an element

•      Finding the average (numeric only)

•      Finding the largest and smallest element

• Mutators, accessors, constructors, overloaded constructors and this()

• Writing the code (and not calling a pre-built library method) for common string-type operations on character arrays

•     String length

•     String copy

•     String compare

•     String concatenation

•     Sub-string (remove a portion from some start index to some end index).

Note: this list is not meant to be a comprehensive list of topics that you should study, for that information you should look to the course notes. Instead this link is meant to give you an idea of some questions that are similar in difficulty to some of the ones that you could find in the actual midterm.