CSSE 220 -- Object-oriented Software Development

Homework 14 Due at 8:05 AM on Day 15. 
Written problems due at the beginning of your class period.

  1. Complete the assigned reading for the next session (see the course schedule). If there is something you do not understand, make note of it so you can ask about it.
  2. Do the written exercises that are listed below.  You may write them neatly by hand or do them on your computer and print them. Turn in hard copy at the beginning of the next session. Include your name and section number at the top of your paper. 
  3. Continue working with your partner on Minesweeper.  The end of the Day 15 class is approximately the half-way point in the coding phase of this assignment, and your progress should be commensurate with that.

Written problems

  1. (5 points) When the input size is N, algorithm A uses 5 N log N operations, while algorithm B  uses N2 operations.  For small values of N, algorithm B is faster; for large values of N, algorithm A is faster.  Determine the smallest possible integer N0 such that for all N > N0 algorithm A is faster than algorithm B.  Show how you know that this is the correct integer.
  2. (9 points) Weiss 5.7 (big-Oh running time)
  3. (3 points) Weiss 5.8 (big-Oh running time)