The final exams are graded. Due to time constraints, I counted the best three of four programs towards your final score. Also, there was one question on the sorts and searches page that I tossed since everyone missed it.I will likely post final grades tomorrow night, after the last call deadline.
Grade distribution follows:
Comp 137 officially ended with the end of last night's exam. In the best interest of certain students, I am willing to accept lab submissions up until 6pm tomorrow (Wednesday) evening.
This assignment requires that you generate 100 pseudo-random numbers, between 0 and 9, inclusive. You need to use an array to keep track of how many times each digit is generated. The most efficient way to do this is to create one ten-integer array, named counts, and to increment the contents of the appropriate array location each time its value is randomly generated. That is, each time your code generates a 0, you increment the contents of counts[0]; each time your code generates a 1, you increment the contents of counts[1]; and so on.
Register for the spring term before the end of the fall semester! You will have a better selection of classes and sections if you do. Also, you should be aware that if you wait too long, there is the possibility that a section you want could be cancelled due to insufficient enrollment.
Read chapter 10, Applications of Arrays (Searching and Sorting) and the
I strongly suggest that each student develop a C++ solution to the following problems in preparation for the coding portion of the first exam. While I do not promise that the practical part of the exam will be *exactly* the same as any one of these problems, the actual test question will at least be very similar to one or more of these practice problems.