CS 106A: Programming Methodology, Spring 2017

Suggested optional pre-section practice problem:

1. Shining - (not from textbook): Write a graphical program that displays a text label with the text, "All WORK and no PLAY makes JACK a dull BOY." (This quote comes from the classic movie, The Shining.) Place the label in the northern area of the window. Also add three buttons to the southern area of the window that have the following behavior:
   • Lowercase: Converts the onscreen label to lowercase.
   • Cool: Changes the word "dull" to "cool" in the label text, leaving the other text unchanged.
   • Red: Makes the window's background color become red.

   The following screenshots show the effects of these buttons.

   

If you want to work on this week's section problems in CodeStepByStep, here are direct links to each problem. (This week's exercises are hard to test in CodeStepByStep because they use GUIs. You should test them manually in Eclipse instead using the provided ZIP project.)

1. ColoredWindow (GUIs)
2. InteractiveKarel (GUIs)
3. BouncingBall (GUIs)
4. WordProcessor (GUIs)

Suggested optional pre-section practice problem:

1. arrayListMystery2 - (not from textbook): Write the output of the method when passed each of the given lists.

If you want to work on this week's section problems in CodeStepByStep, here are direct links to each problem.

1. UniqueNames (ArrayList)
2. removeEvenLength (ArrayList)
3. mirror (ArrayList)
4. switchPairs (ArrayList)
5. CountNames (HashMap)
6. hasThree aka contains3 (HashMap)
7. intersect (HashMap)
8. maxOccurrences (HashMap)
9. reverse (HashMap)
10. FlyTunes (missing)

Suggested optional pre-section practice problem:

1. Skunk - (not from textbook): "The following Critter class named Skunk is an attempt to make a critter that goes ..."

If you want to work on this week's section problems in CodeStepByStep, here are direct links to each problem. (You may want to test Critter problems manually in Eclipse instead using the provided ZIP project.)

1. Student (classes and objects)
2. TimeSpan (classes and objects)
3. Rabbit (Critters)
4. WhiteRabbit (Critters)
5. Frog (Critters)

Suggested optional pre-section practice problem:

1. squaredArray - Review question 11.4 (p449): "Write the variable declaration and for loop necessary to create and initialize the following integer array: ..."

If you want to work on this week's section problems in CodeStepByStep, here are direct links to each problem. (This week's exercises are hard to test in CodeStepByStep because they use animation or events. You may want to test them manually in Eclipse instead using the provided ZIP project.)

1. array mystery (arrays)
2. indexOf (arrays)
3. numUnique (arrays)
4. banish (arrays)
5. collapse (arrays)
6. findMedian (arrays)
7. Sieve of Eratosthenes (arrays)
8. flipHorizontal (2D arrays, pixels)
9. stretch (2D arrays, pixels)
10. array mystery 2D (2D arrays)

Suggested optional pre-section practice problem:

1. PumpkinPie - Exercise 9.6 (p341): "Besides jack-o’-lanterns, one of the things you can make with pumpkins is pumpkin pie." Do a simplified version of this exercise where you divide the pie into four equal pieces by drawing a pair of lines rather than arcs.

If you want to work on this week's section problems in CodeStepByStep, here are direct links to each problem. (This week's exercises are hard to test in CodeStepByStep because they use animation or events. You may want to test them manually in Eclipse instead using the provided ZIP project.)

1. RandomCircles (graphics; randomness)
2. RubberBanding (graphics; mouse events)
3. Sunset (graphics; animation)
4. RobotFace (graphics; constants)

Suggested optional pre-section practice problem:

1. isPalindrome - Exercise 8.6 (p287): "A palindrome is a word that ..." Just write the method itself; you don't need to write the test program mentioned in the problem statement. Consider any one-letter or empty string to be a palindrome. If you want to extend the code to work for full sentences with spaces and punctuation as described in Exercise 8.7, feel free to do so, but that is up to you.

If you want to work on this week's section problems in CodeStepByStep, here are direct links to each problem:

1. addCommas (strings)
2. removeAll (strings)
3. convertToAltCaps (strings)
4. classPresidents (file input)
5. pigLatin/ pigLatin2 (file input)
6. negativeSum (file input)

Suggested optional pre-section practice problems:

1. FizzBuzz - a variation of book Exercise 4.4 (p128): "Write a program that displays the integers between ..."

   Write a variation of the book's exercise where you print all of the numbers in the range, separated by spaces. Use a loop to print the numbers. But for multiples of three print "Fizz" instead of the number, and for the multiples of five print "Buzz". For numbers which are multiples of both three and five print "FizzBuzz". The output would be:

   1 2 Fizz 4 Buzz Fizz 7 8 Fizz Buzz 11 Fizz 13 14 FizzBuzz 16 17 Fizz 19 Buzz
   Fizz 22 23 Fizz Buzz 26 Fizz 28 29 FizzBuzz 31 32 Fizz 34 Buzz Fizz 37 38 Fizz
   Buzz 41 Fizz 43 44 FizzBuzz 46 47 Fizz 49 Buzz Fizz 52 53 Fizz Buzz 56 Fizz 58
   59 FizzBuzz 61 62 Fizz 64 Buzz Fizz 67 68 Fizz Buzz 71 Fizz 73 74 FizzBuzz 76
   77 Fizz 79 Buzz Fizz 82 83 Fizz Buzz 86 Fizz 88 89 FizzBuzz 91 92 Fizz 94 Buzz
   Fizz 97 98 Fizz Buzz 
   

   ("FizzBuzz" is a commonly known problem. Many companies actually ask their interview candidates to solve it, and surprisingly a large number of applicants are unable to do so. It's considered a good "weed-out" problem because anybody with a CS degree ought to know how to solve a problem like this.)

2. countDigits - Exercise 5.4 (p172) - "Write a method countDigits(n) that ..." (See book Figure 4-6 for a helpful example to get you started. Can you write a version that handles negative numbers?)

If you want to work on this week's section problems in CodeStepByStep, here are direct links to each problem:

1. Fibonacci sequence
2. if/else mystery
3. Ascii figure
4. showTwos
5. Parameter mystery 1
6. Parameter mystery 2
7. Days in month
8. Piglet

Suggested optional pre-section practice problems: If you want to try a practice exercise to help you be ready for section, check out these ones. This is optional and not required; you do not have to do it, and you receive no points for doing it. You can write your answer in the Eclipse editor or in our CodeStepByStep tool. If you ever want more extra problems, look at the end of the relevant chapters in the textbook.

1. RoadRepairKarel - Karel reader Chapter 4 (p19): "... Your mission is to write a program that instructs Karel to fill all the holes in this road."
2. expressionsNumbers37 - Java book Review question 3.7 (p90): "By applying the appropriate precedence rules, calculate the result of each of the following expressions: ..." Solve all of parts a) - d). Show your work by writing out each expression part that is evaluated in order. For example:

   1 + 2 * 3 + 4
       -----
   1 +   6   + 4
   -------
      7      + 4
      ----------
          11
   

(The "Section 1 Handout" problems from the PDF document above are the problems that you'll work on in your section this week with the section leader. You don't need to work on any of those before your section, though you can optionally read them ahead of time if you like.)

If you want to work on this week's section problems in CodeStepByStep, here are direct links to each problem:

1. UnitedNationsKarel
2. ChadKarel
3. expressionsNumbers2
4. loopMysteryPrint1
5. InchesToCentimeters
6. CalculateLine