| date | assignments and notes |
|---|---|
Aug 28 | Assignment 1: Write a term paper discussing your future as a CS or CIS major. More details are given on the handouts page. If you do not know how to use MS Word, now is the time to learn! Due November 6. You can hand it in anytime before that. Assignment 2: Read the course outline. After reading it, send me an email. In the subject line enter "CS135:" or "CS135A:", your name, and your major. In the message part enter, "I read the course outline". Click to email me. I will send you a confirmation reply. This confirms that we can communicate via email and that you have read the course outline. You have two weeks to complete this assignment; the deadline September 8. Important Email Note: Always begin the subject line of any email you send to me with CS135 or CS135A. If you do not, then my spam checker will probably delete your email. My address is clayton at cookman dot edu. Reading Assignment: Find the tutorial for this class. Read as much as you find interesting and skim read the rest. |
Aug 30 | Hurricane, reading assignment: Begin the online tutorial. Carefully read the introduction. You should be able to work up to the point where it starts talking about Python. Check out the Python programs, you will probably be able to figure out what they are doing. |
Sept 1 | We should be in class today. If not, I will post another assignment. |
Sept 4 | Labor Day Holiday |
Sept 6 | Continue working through the tutorial... Make sure you can run Komodo and Python. |
Sept 8 | |
Sept 11 | |
Sept 13 | |
Sept 15 | Assignment 3: Demonstrate that you can use Python. Write the Hello World program. Turn in the source code and a printout of one run of the program. Due next Wednesday (9/20). |
Sept 18 | |
Sept 20 | |
Sept 22 | You must figure out how to the programs you write AND the output from those programs. Most of you missed the lab session on output printing (today after class). You will have to work through the tutorial appendix on setup. The discussion on output printing is on page 2, but you need to set up the run command on page 1, first. Assignment 4: Show me you can print code and output. Copy and paste the program on page 2 in Chapter 3. Replace my name with yours and change the date to the date when you run the program. Print your program. Run it three times. Print the output of each run. Hand in your printouts. Due Wednesday, September 27, at the beginning of class. Assignment 5: Problems: 2, 3, 4, and 8 from the Chapter 1 problem set. Due Monday, October 2, at the beginning of class. |
Sept 25 | |
Sept 27 | |
Sept 29 | |
Oct 2 | Assignment 6: Do the previous assignment over (problems 2, 3, 4, and 8). Due Wednesday, 10/4. |
Oct 4 | Assignment 7: Do problems 4 and 8 over. Let's get it right this time. Due Friday, 10/6. |
Oct 6 | Assignment 8: Write and test a Python program for problem 4. Due Monday, 10/9. |
Oct 9 | Assignment 9: Compete programs for problems 4 and 8a. Hand in source code and output. Due Wednesday, 10/11. |
Oct 11 | |
Oct 13 | Meet in the lab today. |
Oct 16 | Meet in the lab today. |
Oct 18 | |
Oct 20 | Midterm in the lab. Make sure you can write, run, and print Python programs in the lab. |
Oct 23 | |
Oct 25 | Assignment 10: Problems 1,2,3, and 5 at the end of Chapter 4 (arithmetic). Due next Wednesday, 11/1. |
Oct 27 | Last Day to drop a class. |
Oct 30 | Assignment 11 (extra): Write and run a Python program to find the first prime number bigger than 1,000,000. Due Wednesday (11/1). I will work this in class, so you must turn it in at the beginning of class. |
Nov 1 | Reading Assignment: Work through the discussion on stacks. |
Nov 3 | Assignment 12: Problems 2, 3 and 4 from stacks. Due next Wednesday. |
Nov 6 | Term paper due today. |
Nov 8 | Mini Assignment 13: Write a declaration for an array of 5000 urns. Turn in next time. |
Nov 10 | |
Nov 13 | Lab Assignment: Test linear searching. Does the average performance appear to be N/2? Due Wednesday. |
Nov 15 | Discussion of Linear Search. Memorize the algorithm and expected performance measures. |
Nov 17 | Discussion of Binary Search. Introduction to sorting. |
Nov 20 | |
Nov 22 | Discussion of Selection Sort |
Nov 24 | Thanksgiving Holiday |
Nov 27 | Selection sort continued |
Nov 29 | Discussion of Quicksort |
Dec 1 | |
Dec 4 | "Study Day", No class. |
Dec 6 | Final Exam: Wednesday, 8:00 AM to 9:50 AM. |