T-Th 9:05 |
CS 1110: Introduction to Computing Using Python Fall 2013 |
||||||||||||
Main
About: Announcements Staff Consultants Times & Places Calendar Materials: Texts Python Command Shell Terminology VideoNote Handouts: Lectures Assignments Labs Assessment: Grading Exams Resources: CMS Piazza AEWs FAQ Python Tutor 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 17th, 7:30 pm to 9:00 pmPlace: Your exam room is determined by your last name. Review Session: Wednesday, October 16th in Lab SectionStudy 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, October 8. There is no Recursion on this prelim. In addition, you are responsible for any and all reading listed on the lecture slides for each day. Prelim 2Time: Thursday, November 14th, 7:30 pm to 9:00 pmPlace: Your exam room is determined by your last name. Review Session: Sunday, November 10th, 4:00 pm to 6:00 pm in Kimball B11Study 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, November 7. This includes recursion, iteration (for-loops), classes, and principles of class design. Final ExamTime: Monday, December 16th, 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. Exam ArchiveTo give you some idea of what the exams might be like, we are freely posting all of the exams from earlier semesters for you to look at how. However, please be aware of the following: The material covered changes every semester in CS 1110. Furthermore, material is not always covered in the same order. The topics on these older exams may not be the topics in our exams. Prelim 1 in Previous Semesters
Prelim 2 in Previous Semesters
Final Exam in Previous Semesters
|
||||||||||||
Course Material Authors: D. Gries, L. Lee, S. Marschner, & W. White (over the years) |