CS 117 Daily Assignments

Fall, 2000

Due on Monday, 11/13/00:

• Read sections 13.1-13.2.
• Turn in project design.

• Look over class project.

• Study for the quiz.

• Review material to ask questions in class before quiz.

• Read section 14.1.
• Turn in Project 7.

• Read sections 11.1 and 11.2.
• Turn in Exercise 4 on page 662. Include a memory diagram to show what's happening.

• Turn in Project 6.

• Finish chapter 6.

• Read chapter 6.
• Turn in a class diagram and C++ code for a class to simulate a student's records at the registrar at Carleton. It should be able to produce a GPA as well as a list of all courses taken and grades within each. Use an array to contain strings of course names, and an array of doubles to contain course grades.
• Don't make this too complicated. Assume that the students grades are stored as doubles (e.g. 4.0, 3.5, etc.) and just average them to get GPA.
• Don't spend time coding this on the machine or debugging it. Write it up and hand it in on paper.

• Finish Project 5.

• Read section 12.3 in the textbook.
• In your own words, what condition is used as the stopping case for recursive binary search?

• Read sections 12.1-12.2 in the textbook.
• Submit the design document for project 5.

• Read over Project 5.
• Submit a "mini" version of the design document. Follow all the guidelines on the web page, but do it for only one of the functions that you will need to use.

• Read sections 10.2-10.3 in the textbook. Since we'll be skipping 10.1, the references to cstrings in 10.2-10.3 will be a bit odd. Do the best you can with it.
• Suppose I initialize a string as string text = "Hello". What is the difference between the expressions text[8] and text.at(8)?

• Study for the quiz.

• Review notes and textbook readings thus far.
• Bring questions to class.

• Look again at array sorting, pp. 555-557.
• Nothing to turn in.

• Read sections 9.1-9.3.
• Nothing to turn in.

• Read chapter 7.
• Do problem 19 on page 388.

• Read sections 5.1-5.3.
• Write the output from self-test 18 on p. 247, but instead of the line of code "count++", put in instead "count = count + next". Don't code this up on the computer - figure it out by tracing through the code yourself.

• Read chapter 4.
• None: Project due.

• No daily assignment: we'll be in the lab doing graphics.

• Finish reading chapter 3.
• Do the "jacket size" part of problem 8 on pages 164-165.

• Finish chapter 2, and read 3.1-3.2
• Write down a complete C++ program that to do the following:

Ask a user to choose a PIN number for a new ATM card. Then, prompt the user to enter it again. If the number is not entered correctly, keep prompting the user to re-enter it until it matches the original choice.

• Write down a complete C++ program that will read the weight of a package of breakfast cereal in ounces, and output the weight in metric tons. (A metric ton is 35273.92 ounces). If the package is over one metric ton, output the message "That's one heavy box of cereal!"

• Read Chapter 2 in the textbook.
• Write down a complete C++ program that will read the weight of a package of breakfast cereal in ounces, and output the weight in metric tons. (A metric ton is 35273.92 ounces).