CS 117 Assignments, Fall 2000

Things to hand in

• Assigned Monday 9/11/00, due Wednesday 9/13/00. 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, 9/13/00. Due Wednesday, 9/20/00. Words: how many, how long, how frequent? .
  
  
• Assigned Monday, 9/25/00. Due Friday, 9/29/00. Write a graphics program to draw a face. If you get ambitious, you may want to organize your code into functions (e.g. DrawEye() or DrawMouth()). Have fun.
  
  
• Assigned Wednesday, 9/27/00. Due Wednesday, 10/4/00. Functions
  
  
• Assigned 10/23/00. Do these problems, but do not hand them in. You will be responsible for the material covered in these problems, so bring your questions to class and/or my office hours.
  
  
• Assigned 10/23/00. Due Monday, 10/30/00. Word frequencies
  
  
• Assigned 11/1/00. Due Monday, 11/6/00. Look at the program consisting of the files spellinglist.h, spellinglist.cpp, and spellingmain.cpp. Right now, the functions SpellingList::AddWord and SpellingList::IsIn are stubs. Your job is to implement these two functions so the resulting program (compiled by "g++ -g -Wall -o spelling spellingmain.cpp spellinglist.cpp") acts as a spell checker, as described in the comment at the top of spellingmain.cpp.

  Five points extra credit. Assume that the spelling list file consists of a large number of words in alphabetical order, and that the text file is very large (tens of thousands of words). Write AddWord and IsIn so the program works quickly (fewer than 5 seconds) under such conditions. If you want a long list of alphabetized spelling words, type "/Accounts/courses/cs117/ondich/words.txt" when spellingmain.cpp asks you for the spelling list. For long texts to spell-check, you might find http://www.gutenberg.net/ an interesting source.
  
  

• Assigned 11/6/00. Due 5:00 PM, Monday, 11/20/00. The final project.
  
  

Other things to do

• Assigned Monday 9/11/00. If you wish, sign up for the Edupage e-mail news service. Twice each week, Edupage subscribers receive a short collection of summaries of computer-related news stories. We'll discuss some of these stories now and then in class. It takes me less than five minutes to read each edition of Edupage, and I usually learn something interesting.

  To subscribe to Edupage, send a message to LISTSERV@LISTSERV.EDUCAUSE.EDU and in the body of the message type: "SUBSCRIBE Edupage YourFirstName YourLastName" Instructions for unsubscribing are included in each Edupage mailing. I suggest that you subscribe to Edupage from whichever account you use as your e-mail account.
  
  

Suggested Reading

• 9/13/00 Chapters 1 and 2 of Savitch. Much of this material showed up in the lab exercises, and most of the topics in Chapters 1 and 2 will be discussed in class Friday 9/15 and Monday 9/18.
• 9/18/00 Chapters 3 and 4 of Savitch.
• Sections 7.1 (boolean expressions), 7.3 (loops), 9.1 (arrays), and 9.2 (more arrays).
• Sections 7.1, 7.3, 7.3 (loops and decisions).
• Section 9.3 (sorting)
• 6.1 (structs), 6.2 (classes), and 6.3 (abstract data types).
• Sections 10.1 (null-terminated strings)
• Sections 12.1-2 (recursion)
• Section 14.1 (linked lists)