CS 117 Assignments, Winter 2001

Things to hand in

• Assigned Wednesday 1/3/01, due Friday 1/5/01. Login to your Math/CS account and send me e-mail at jondich. I'd love to hear the story of your experiences with computers, and what inspired you to take this course. Feel free to write briefly or at length, and in prose or verse, as you see fit. If you have questions, ask them. I'll try to answer.
  
  
• Assigned Wednesday 1/10/01, due 5:00PM Monday 1/15/01. E-mail files, part I: Listing the Senders.
  
  
• Assigned Wednesday 1/17/01, due 5:00PM Monday 1/22/01. E-mail files, part II: Printing messages.
  
  
• Assigned Wednesday 1/24/01, due 5:00PM Monday 1/29/01. E-mail files, part III: Replying .
  
  
• Assigned Friday 2/9/01, due 5:00PM Tuesday, 2/13/01. Write a program that draws a face. A simple, boring face will be worth 15/20. Something with a little pizzazz (interesting features, animation, etc.) will be worth 19/20. The truly amazing will earn 20/20 (with "best of show," as judged by the grader and me, earning 21/20). Have fun.
  
  
• Assigned Thursday 2/15/01, due 5:00PM Monday, 2/19/01. Send me e-mail describing your ideas for a final project you would like to do. In class on 2/16, I will discuss the kind of thing I'm looking for.
  
  
• Assigned Thursday 2/15/01, due 5:00PM Wednesday, 2/21/01. Counting word frequencies.
  
  
• Assigned Wednesday 2/21/01, due 5:00PM Wednesday, 2/28/01. Write a detailed description of what you plan to do for your final project. Describe the input that the program will receive (will the input come from a file? if so, how will the file be structured? if not, what does the user have to provide?). Describe what the program will do with the input, and what output will result.

  Also, provide an incremental design plan. That is, show me a step-by-step list of the intermediate versions of the program that you will write, starting with a program that does nothing at all, and culminating in a program that achieves the goals you described above.
  
  

• Due 5:00PM Wednesday, March 14. The Final Project.

Things to do, but not hand in

• 1/8/01. Try writing some of the following small programs:
  • Write a program that asks the user for a temperature in Fahrenheit and prints out the corresponding temperature in Celsius (C = 5*(F-32)/9, by the way).
  • Write a program that gives the user two choices--"type 1 to translate from Fahrenheit to Celsius, type 2 to translate from Celsius to Fahrenheit"--and then asks for the temperature and perform the translation the user requested.
  • Write a program that asks the user for a positive integer N and then computes the sum of the first N odd numbers. For example, if the user enters the number 5, your program should compute 1 + 3 + 5 + 7 + 9 and print out the result.
  • Write a program that counts the number of times the letter 'Q' appears in the input file.
  • Write a program that asks the user for a string and then prints it backwards.
  
  
  
• 1/17/01. Try some of these. Getting the functions right is part of the task, but you should also spend time thinking about how to write simple main programs to test these functions.
  • Write a function "int QCount( string s )" that returns the number of Q's in the given string.
  • Write a function "int VowelCount( string s )" that returns the number of vowels in the given string.
  • Write a function "void MakeUpper( string& s )" that changes all the lowercase letters in s to uppercase. (You might find the library function toupper() useful--see page 262 of your textbook, or type "man toupper" at a UNIX prompt.)
  • Write a function "bool IsPalindrome( string s )" that returns true if the given string is a palindrome, and false otherwise. You can do this in strict form (capitalization, spacing, and punctuation matter, so "rats live on no evil star" is a palindrome, but "Rats live on no evil star" and "nurse, I spy gypsies. run!" are not), or in the more general form (all three of the above examples are palindromes). To do the more general version is quite a bit harder. You might find the library functions toupper(), ispunct(), tolower(), and isalpha() useful.
  • Write a function "int SumOfFactors( int N )" that returns the sum of the positive factors of N other than N itself. For example, for N = 21, the sum is 1 + 3 + 7 = 11.
  • Write a function "bool IsPrime( int N )" which returns true if N is a prime number, and false otherwise.
  
  
  
• 2/19/01. Try some of these: problems 13 and 14 on page 723, problem 15 on page 739, and problems 1-4 on pages 745-746.

Suggested Reading

• 1/3/01. Chapters 1 and 2 of Savitch. Much of this material will show up in the lab exercises, and most of the topics in Chapters 1 and 2 will be discussed in class during the first two weeks.
  
  
• 1/10/01. Read sections 3.1-3.3 on functions, and section 7.3 on the for-loop.
  
  
• 1/12/01. Read section 5.1 on file input and output. See the programs fileInput1.cpp and files.cpp for examples of file I/O.
  
  
• 1/22/01. Read sections 3.4, 3.5, 4.1-4.4, 7.1, and 7.2.
  
  
• Early Feb 2001. Read sections 9.1-9.3 (arrays), 10.1 (strings), and 12.1-12.3 (recursion).
  
  
• 2/26/01. Read sections 6.1-6.3.