CS 1713 Introduction to Computer Science, Fall 2007 Exam 2 Comments

The grades were better on this exam, with 7 grades of 90 or above, but half of the class is still not doing well enough. If you got below 60 on this exam, please see me.

60 points of the exam were problems that I told you would be on the exam: search (problem 3), sort (problem 5) and trace (problem 8). Everyone should have been able to get close to full credit on these problems. Computer Science is not a spectator sport. You need to practice to be able to do it.

Only about 5 people have been staying after class on Mondays to do practice problems.

1. I should not have to tell you that you can do this by counting the number of A's and B's.
2. This was a small modification to finding the max in an array.
3. You were told you would need to write a binary search. Note that to compare Strings, use the equals method.
4. a) and b) were just like problems we have done in class. c) was worth only one point and I gave credit it you said that the time was about the same.
5. You were told that you had tp be able to write the selection sort and the insertion sort.
6. Draw a labeled box for each variable.
   Important point: for ints, values go in the box. For arrays, the box contains a reference.
7. There are 6 variables and 2 object. Each object is represented by a box containing its attributes. Each attribute is represented by a labeled box. We did a problem like this in class on Monday.
8. The trace was just like ones we did in class.