This week's labs will focus on Control Structures (chapter B).  Last week you went through the multimedia for Computer Architecture (chapter B). This week's lab quiz and assignment will combine these two units.

This week's lab:

• If your PC does not have source code in H:\ucomp, then point Microsoft Internet Explorer at http://cimel.cse.lehigh.edu/ucsetup.exe. This will install the current Java source code (and other files) and start up the multimedia.  If the source code is already available (as it probably is, since you should have run ucsetup for your previous assignment), just  point Internet Explorer at http://cimel.cse.lehigh.edu to start up the multimedia.
• From the menu on the left, choose Control Structures.  The new multimedia has material introducing if-then-else statements and boolean expressions. When it asks you to use BlueJ (or JavaEdit) to study the payroll example, you can find the code in H:\ucomp\chapB\Pay.
• After you have completed the Control Structures multimedia, work on the following exercise from the book:
  • Exercise B.25: Rewrite the payroll program (in H:\ucomp\chapB\Pay) to use a chained if-else structure, rather than three independent if-statements.
• All students will also do a unit of the old multimedia: in Windows Run or DOS, enter umcpp then select chapter 7. This chapter covers loop control structures in C++. Not to worry! With respect to loops, there is no difference between C++ and Java. You do not, however, need to do any of the C++ programming exercises that the old multimedia encourages you to do. Instead, you will do analogous exercises in Java, most of which will be in H:\ucomp\chapB\multimed:
  • When Knobby asks you to look at a definite loop, try running Definite.java.
  • When Knobby asks you to write a program that calculates x cubed..., start with NegCubes.java.
  • When Knobby asks you to look at a nested loop, try running Nested.java.
  • When Knobby asks you to write a program that displays a table of powers, start with Powers.java (CSE14 only).
  • When Knobby asks you to look at a sentinel controlled loop, try running Sentinel.java.
  • When Knobby asks you to write a program that determines the average length of strings, start with SentinelString.java.
  • When a bug in glasses asks, "Wanna catch some real live bugs?" try debugging LoopBugs.java. (CSE14 only. The BlueJ debugger might be helpful.)

• After finishing the lab exercises from the previous week, take the quiz, which will be available via my web site (http://www.eecs.lehigh.edu/~glennb/csc10/csc10.htm).
• Work on your homework assignment, asking your lab instructors for help if you need it.

Homework exercises (hand in .java source code for any programming exercises):
The final project for CSE14 will be to implement the card game of "war" in Java.  As part of this students, both CSE13 and CSE14 students will develop a set of use cases (just the textual form) describing how to play this game.   You may work in pairs on this problem.
CSE13: exercises 5.2(second question), 5.3, 5.4, 5.5, 5.16, 5.39, B.4, B.11(b,e,f), B.19(b,d,f), B.25 (in H:\ucomp\chapB\Pay), B.55,B.56,NegCubes.java and SentinelString.java.
CSE14: exercises 5.2(second question), 5.3, 5.4, 5.5, 5.16, 5.39, B.4, B.11(b,e,f), B.19(b,d,f), B.23(a,d), B.25 (in H:\ucomp\chapB\Pay), B.55,B.56, NegCubes.java, Powers.java, SentinelString.java and LoopBugs.java.

Note about pair programming: You may work in pairs on any of the programming exercises as well as the "war" use case exercise.  As with the previous assignment, pair programming (see chapter 4, page 18, exercise 4.14) is optional, but you must follow the procedure outlined in chapter 4, page 18, working together at one computer, one partner coding, the other partner critiquing), and you declare your partners in a comment at the top of each program. For all programs that you work on as pairs, make sure your programs includes the names of both programmers in the comments; one person can submit the program, while the other person just includes a note in their file giving their partner's name for the exercises they worked on together. No "pair" work for non-programming exercises: for these, do and submit your own work.

Extra credit: exercises 5.19, 5.49, B.2 and B.31 (show both), B.28, or B.62

Due: Sunday, 11/3, anytime before noon.  Put a hard copy of your work, stapled or in a binder, in Packard Lab 104, on the left.  (Slide it under the door if it's closed.)

Hints:
For 5.2, explain how each instruction changes the value of which register.  E.g., STO 2 would change register 2 to 6.  By "second question," I mean "What would the effect be if theare are executed sequentially in that order?" I.e., first STO 7; then RCL 2; etc., with the state of the machine changing after each instruction.

For 5.39, chapter B, page 7, after reviewing truth tables, discusses the difference between inclusive and exclusive or.

B.10(b,e), see the ASCII table in Figure A.10.

For B.62, take a look C:\ucomp\chapB\InFile, notably themain method.

Prof. Blank