T-Th 9:05 |
CS 1110: Introduction to Computing Using Python Fall 2012 |
Main
About: Announcements Staff Consultants Times & Places Calendar Materials: Texts Python Command Shell Terminology Handouts: Lectures Assignments Labs Assessment: Grading Exams Resources: CMS Piazza (link) Piazza (about) AEWs FAQ Python API Style Guide Academic Integrity |
ExamsThere are two prelims and a final in this course. Because of the size of this class, and having to coordinate multiple sections, the exam times have already been scheduled way in advance. Please make sure that you have nothing else planned at these times; there are no alternative times for these exams. With that said, we will have a policy for legitimate conflicts. We will explain later how to deal with these issues. Prelim 1Time: Thursday, October 4th, 7:30 pm to 9:00 pmPlace: Exact rooms determined by last name. Review Session: Sunday, September 30th, 1:00 pm to 3:00 pm in Olin 155Study Guide Review Questions (no answers) Review Questions (answers)This prelim will cover the basics of Python. It will include the material presented in class up to, and including, September 25. There is no Recursion on this prelim. In addition, you are responsible for any and all reading in listed on the lecture slides for each day. Prelim 2Time: Tuesday, November 6th, 7:30 pm to 9:00 pmPlace: Exact rooms determined by last name. Review Session: Sunday, November 4th, 4:00 pm to 6:00 pm in Hollister B14Study Guide Review Questions (no answers) Review Questions (answers)This prelim will cover the more advanced concepts that we have talked about since the last exam. In particular, both recursion and classes will feature heavily on this exam. It will include the material presented in class up to, and including, October 30. This includes recursion, iteration (for-loops), classes, and object-oriented design. Final ExamTime: Friday, December 7th, 9:00 am to 11:30 amPlace: Exact rooms determined by last name. Review Session: Information PageStudy GuideThe final is comprehensive, and will include topics from the previous two prelims. New topics on the final include while loops and loop invariants. You will be expected to reproduce one of the important sequence algorithms covered in class. |