CS128 - Programming and Problem Solving

CS128 - Programming and Problem Solving - Assignments

Last updated: Friday, 11-Dec-2009 07:29:54 EST

Due Friday December 11th
- Encryption and decryption program.
- Questions about the material covered since the mid-term, or things from before that, in preparation for the final exam on Wednesday.
Due Wednesday December 9th
- Read through the encryption/decryption programming project, work on your algorithms, work on some of the code and come to class with questions.
- Read chapter 12 in Invitation, pages 560 through 581.
- Exercises 1, 4, 6, 7, 8, 9 a and b from chapter 12.
Due Monday December 7th
- Design and implement exercise 31 as a complete program.
  Include a copy of your algorithm as part of the comment block at the beginning of the source code.
  Turn-in a print-out of the source code and a screen capture of the output showing one run of the program using the following dimensions for the three rooms: 8 x 10, 20 x 12.5 and 3.25 x 5.5.
- Read pages 447 through 463 in Invitation.
- Exercises 13, 15, 17 and 18 from chapter 9.
- Extra Credit - Exercise 22 from chapter 9. A picture is worth a 1K words for working out this problem.
Due Friday December 4th
1. Read the Functions (II) tutorial. Skip the sections on overloading and recursion.
2. Exercise 30 as a complete program. Turn-in a print-out of the source code and a screen capture of the output showing one run of the program with the data of your choice.
3. Develop an algorithm for exercise 31. Follow all the same guidelines for developing algorithms as we did earlier this semester. Turn-in a print-out of your algorithm.
Due Wednesday December 2nd
- Exercise 26 as a complete program. Turn-in a print-out of the source code and a screen capture of the output showing one run of the program with 45 and 230.10 as values so far this month and 5 and 30.20 as the values entered for today's sales. Your main() function should display the new totals.
- Design an algorithm for exercise 30. Follow all the same guidelines for developing algorithms as we did earlier this semester. Turn-in a print-out of your algorithm.
- Read pages 425 through the middle of 447 in chapter 9 of Invitation.
- Work-out and write-up exercises 1, 2, 4, 6, 7, 10 and 12 from chapter 9 of Invitation.
Due Monday November 30th
- Read Why the future doesn't need us by Bill Joy. Write a couple of paragraphs with your take on this including what's changed in the past 10 years for the better or worse.
- Identify, read and summarize in a couple of paragraphs a credible contemporaneous critique of Joy's article.
Due Friday November 14th
- Exercise 29 as a complete program (this implies exercise 28 as well). Turn-in a print-out of the source code and a screen capture of the output showing one run of the program using 221 miles and 4 gallons.
Due Wednesday November 18th
- Read the Control Structures and Functions (I) tutorials.
- Exercise 27 as a complete program. Turn-in a print-out of the source code and a screen capture of the output showing one run of the program using 5, 7, and 9.
Due Monday November 16th
- Read the Operators and Basic Input/Output tutorials. You have seen most of this material before. Save these tutorials as reference guides to the C++ language elements.
- Exercise 25 as a complete program. Your main() should prompt the user for the two integers, then pass them to a function which calculates their sum and product and then prints them out. Turn-in a print-out of the source code and a screen capture of the output showing one run of the program using 5 and 7.
- A variant of Exercise 25 as a complete program. Your main() should prompt the user for the two characters, then pass them to a function which concatinates them together as they are printed-out by the function. Turn-in a print-out of the source code and a screen capture of the output showing one run of the program using A and Z.
Due Friday November 13th
- Read pages 408 through 418 in Invitation.
- Read the Structure of a program, Variables & Data Types, and Constants tutorials (found on the course homepage). You have seen much of this material before. Save these tutorials as reference guides to the C++ language elements.
- Exercise 24.b as a complete program. You should use one function which prompts the user for the values, calculates the average and returns the average to main() where it is printed-out. Turn-in a print-out of the source code and a screen capture of the output showing one run of the program using 20, 30, 45, and 59.
Due Wednesday November 11th
- Exercise 21 as a complete program. Turn-in a print-out of the source code and a screen capture of the output showing two runs of the program using one input less than 35 and one more than 35. By "quote a rate" display what the rate would be based on their age. Think, plan, outline the algorithm, then write the code!
- Exercise 22 as a complete program. Turn-in a print-out of the source code and a screen capture of the output showing one run of the program using 1, 2, 3, 4, 5, 6, -1, -2, -3, -4, -5, -6 as the input. Think, plan, outline the algorithm, then write the code!
- Exercise 24 b as a complete program. Turn-in a print-out of the source code and a screen capture of the output showing one run of the program using 76, 88, 90, 56, 82, 98, 86 as the input. Think, plan, outline the algorithm, then write the code!
- Re-read (or read, as the case may be) pages 370 through 388 of Invitation.
Due Monday November 9th
- Exercise 15 as a complete program. Turn-in a print-out of the source code and a screen capture of the output showing two runs of the program, one with an a and one with a z. Think, plan, outline the algorithm, then write the code!
- Exercise 18 as a complete program. Turn-in a print-out of the source code and a screen capture of the output showing one run of the program. Think, plan, outline the algorithm, then write the code!
- Exercise 20 as a complete program. Turn-in a print-out of the source code and a screen capture of the output showing two runs of the program, one with an input of 2 hours 10 minutes and one 0 hours 59 minutes. Think, plan, outline the algorithm, then write the code!
- Read pages 370 through 388 in chapter 8 of Invitation.
Due Friday November 6th
- Exercises 1, 2, 3, 4, 5, 6, 7, 8, 9, 12, and 14 from chapter 8 of Invitation.
- Exercise 13 as a complete program. Turn-in a print-out of the source code and a screen capture of the output showing two runs of the program, one with 4 and 5 and one with 3 and 7. Think, plan, outline the algorithm, then write the code!
Due Wednesday November 4th
- Programming Exercise 1 (Hello World). Bring a print-out of a run of your program as described in the assignment.
- Read the Programming Process Example handout.
- Make a list of three questions based on the material you read for Friday, Monday and Wednesday. Syntax, technique, capabilities, etc. You won't need to turn the list in but you will need to have the questions.
Due Monday November 2nd
- Re-read the first chunk of chapter 8 (pages 338 through 357) if it didn't stick the first time.
- Read pages 358 through 369 in Invitation. Work through the practice problems on page 369.
Due Friday October 30th
- Read pages 338 through the middle of 357 in Invitation.
Due Wednesday October 28th
- Catch-up on the reading in chapter 6 of Invitation (see Monday October 26th)
- Exercises 1, 2, 18, 20, 21, 23, 24 and 26 from chapter 6 of Invitation.
Due Monday October 26th
- Read pages 240-244, 263-273 and 282-284 in chapter 6 of Invitation.
Due over the weekend
- Take the midterm exam on Moodle sometime between Friday at 5p EDT and Sunday at 10a EDT.
Due Friday October 23rd
- Exercise 14 from chapter 5.
- Calculate the processing power of the cell phones in China. Use the following parameters:
  - Each cell phone has a 500 MHz clock
  - Each cell phone completes one instruction per clock cycle
  - 50% of the population has a cell phone
  Give your answer in instructions per second.
- Study the study guides, come to class with questions in preparation for the midterm exam.
Due Wednesday October 21st
- Exercise 13 and challenge work 1 from chapter 5.
- If any of the material in section 5.4 didn't stick re-read it.
- Study the key terms handouts, algorithm guide and exercise solutions; come to class with questions.
Due Monday October 19th
- Read pages 219 through 232 in chapter 5, don't worry too much about the details of operation codes but do be sure to read the various colored boxes. (You will need some of that information for one of the exercises.)
- Exercises 2, 3, 4, 8, 9, 10, and 11 from chapter 5.
Due Wednesday October 14th
- Take the chapter 4 quiz on Moodle sometime between 5p EDT Tuesday and 9a EDT on Wednesday.
- Read pages 188 through the top of 219 in chapter 5 of Invitation.
Due Monday October 12th
- Exercises 15, 16, 17 and 22 from chapter 4 of Invitation, for extra credit work-out exercise 19.
Due Friday October 9th
- Lab 7, turn-in the completed worksheet.
- Read sections 4.5 and 4.6 in chapter 4 of Invitation.
Due Wednesday October 7th
- Read all of section 4.3 (Boolean logic and gates) and section 4.4.1 (Building computer circuits) in chapter 4 of Invitation.
- Review Lab 7.
- If you didn't complete the first set of exercises for chapter 4 do so.
Due Monday October 5th
- Read through section 4.2.4 (the middle of page 156) in chapter 4 of Invitation.
- Exercises 1, 2, 3, 4, 9, 10, 11, and 14 from chapter 4.
- Complete or re-do any missing or sub-standard assignments from chapters 2 and 3.
Due Friday October 2nd
- Read pages 130 through 134 and mid-139 through 149 (up to 4.2.3) in chapter 4 of Invitation, come to class with questions!
- Take the chapter 3 quiz on Moodle sometime between 5p EDT Thursday and 9a EDT on Friday.
Due Wednesday September 30th
- Exercises 19, 20, 21, 22 and 25 from chapter 3.
- Complete any exercise sets you haven't previously from chapters 1, 2 and 3. This is the last call for these.
Due Friday September 25th
- Class will be in D224 working on a NetLogo lab.
- The two labs from Chapter 3.
Due Wednesday September 23rd
- Read the introduction, Rules, Origin and Examples of Patterns sections in Wikipedia's entry on Conway's Game of Life, found here.
- Read through the middle of the third page in the Rauch article, Seeing Around Corners
Due Monday September 21st
- Read pages 106 through 119 in chapter 3 of Invitation.
- Exercises 11, 12, 17, and 18 in chapter 3 of Invitation.
Due Friday September 18th
- Exercises 1, 2, 5, and 6 in chapter 3 of Invitation.
- Lab 4, 4.1 through 4.8 only (completed worksheet). The latter part of the reading for the lab includes a description of the quick sort, you can safely skip that part.
Due Wednesday September 16th
- Read pages 99 through 106 in chapter 3 of Invitation.
- Do/re-do any of the exercises from chapter 2. Use the algorithm handout and the solutions I've provided as guides, examples, etc.
- Work on lab 4, come to class with questions, problems and the like.
Due Monday September 14th
- Exercise 21 from chapter 2, for extra credit exercise 23.
- Read pages 80 through 98 in chapter 3 of Invitation.
Due Friday September 11th
- Lab 2 from Invitation (completed worksheet).
- Draft of a solution for exercise 21 in chapter 2. Bring this to class with your questions, etc.
- Chapter 2 quiz on Moodle completed by 11a EDT.
Due Wednesday September 9th
- Exercises 8 and 9 from chapter 2.
- Start on Lab 2 and come to class with questions, etc.
Due Monday September 7th
- Re-read pages 54 through 74 in chapter 2 of Invitation if need be.
- Exercises 10, 17, 18, 19, and 20 from chapter 2, done well. That is complete, organized, and well presented.
- Class will meet in the Dennis 224 Mac lab on Monday!
Due Friday September 4th
- Read pages 54 through 74 in chapter 2 of Invitation.
- Exercises 7, 13, 14, 15, and 16 from chapter 2, done well. That is complete, organized, and well presented.
Due Wednesday September 2nd
- Take the Chapter 1 quiz on the course Moodle. You must finish it by 9a EDT on Wednesday September 2nd.
- Read from page 40 to the middle of page 54 in Chapter 2.
- Exercises 1, 2, 3, 4, and 5 from Chapter 2, done well. That is complete, organized, and well presented.
Due Monday August 31st
- Finish reading chapter 1 if you haven't already.
- Exercises 8, 9, and 13 from chapter 1, done well. That is complete, organized, and well presented.
Due Friday August 28th
- Read Chapter 1, Introduction, including the various side-bars. Make a list of terms/ideas you don't grok and bring it to class.
- Complete the survey and bring it to class.