CPSC 170 Spring 2004
Test 1 Topics

• Arrays in Java
  • Declaring, instantiating and initializing arrays
  • How arrays are stored in memory
  • Setting and accessing array elements
  • Physical vs. logical length of an array
  • Arrays as parameters
  • Arrays of objects
  • Non-rectangular arrays
  • Assigning meaning to array indices
  • Two-dimensional (and higher) arrays
  • Command-line arguments

• Searching and Sorting
  • Algorithms, complexities and code for
    • selection sort
    • insertion sort
    • sequential search
    • binary search
  • The Comparable interface and its usefulness in writing a general sort method.

• Computational Complexity
  • The big-Oh equivalent for a given function
  • The number of steps required (or the number of times a particular statement executes) in a given piece of code, and its complexity in big-Oh.
  • The implications of an algorithm being O(1), O(log N), O(N), O(N²), and O(2^N).
  • Interpretation of timing data relative to algorithm complexity.

• Inheritance -- basic concepts only