Homework 6, Feedback

• Please write your algorithm
  • In pseudo-code
  • Using conrol structures
  • Look at the example on page 567
  • You generally do not declare variables.
• Please look at the structure chart on page 569
  • I don't care for the arrows
  • But in general, this is the form.
  • It indicates what functions call what other functions.
  • Look at https://www.umletino.com/umletino.html
• Think about how you break your program down.
  • Try to keep simple, coheasive tasks.
  • Should spinning a spinner change a player? - NO
• Think about what you are storing
  • Do you need both a basket and a spinner?
• I should be able to tell by reading your algorithms how you will handle the end of the game.
  • IE how do you abort the turn when a player wins.
• Copy my examples for now.
  • Unknown should be the LAST enumerated item.
• Don't delete page breaks from the template.
• You need to improve, get better.
  • There is really no excuse for a structure chart that does not look like the ones in the book.
  • There is no excuse for algorithms that don't look like the ones in the book.
• Take this seriously
  • The purpose is to determine
    • What will your program do?
    • Is can this be implemented?
  • Can you tell anything from this algorithm?

  • Main:
    Setup players
    Play Game
            

  • How about this

  • Main:
    initiailze  all players and get their names.
    set the bucket to 10
    print winner.
            

• Think about how you are breaking things down.
  • The SpinnerT should only deal with spinner things.
  • There should be no mention on the player at all.
  • Does the spinner "know" the values of the results? It just know what the results are.
• You really don't need to type out big case statements for enumerated types.
• By no means should you ever enumerate all of the items in an array
  • Input: player[0], player[1], player[2], ...
  • Input: The player array
• Do not use an enumerated type for names.
• The enumerated type in this game should be spinner results.