Cover Data Structures and Algorithms with Object-Oriented Design Patterns in Java
next up previous contents index

Projects

  1. Write a Java method that takes a single integer argument n and has a worst-case running time of O(n).
  2. Write a Java method that takes a single integer argument n and has a worst-case running time of tex2html_wrap_inline58122.
  3. Write a Java method that takes two integer arguments n and k and has a worst-case running time of tex2html_wrap_inline59848.
  4. Write a Java method that takes a single integer argument n and has a worst-case running time of tex2html_wrap_inline58840.
  5. Write a Java method that takes a single integer argument n and has a worst-case running time of tex2html_wrap_inline58846.
  6. Write a Java method that takes a single integer argument n and has a worst-case running time of tex2html_wrap_inline58856.
  7. The generalized Fibonacci numbers of order tex2html_wrap_inline59862 are given by

    equation2489

    Write both recursive and non-recursive methods that compute tex2html_wrap_inline59864. Measure the running times of your algorithms for various values of k and n.

next up previous contents index

Bruno Copyright © 1998 by Bruno R. Preiss, P.Eng. All rights reserved.