Newsgroup: | rice.owlnews.comp212 | for questions of general interest -- Read it often. |
rice-owlnews-comp212@rice.edu | ||
Email: | comp212@rice.edu | for questions specific to your assignments or grades |
Role | Name | Office Hours (* = also by appt.) | Phone | |||
---|---|---|---|---|---|---|
Instructors | Alan Cox | alc@rice.edu | WF | 11.00a-12.00n * | Duncan Hall 3009 | x5730 |
John Greiner | greiner@rice.edu | M | 1p-3p * | Duncan Hall 3118 | x3838 | |
Teaching Assistants | Romer Gil | rgil@rice.edu | M | 4p-6p * | Duncan Hall 3111 | x2286 |
Rajnish Kumar | rajnish@rice.edu | T | 4p-6p * | Duncan Hall 3064 | x5060 | |
Anirban Mandal | anirban@rice.edu | T | 7p-9p * | Duncan Hall 3061 | x2268 | |
Amit Saha | amsaha@rice.edu | Th | 2p-4p * | Duncan Hall 2070 | x2738 | |
Lab Assistants | Kileen Cheng | kileen@rice.edu | F | 8.30p-10.30p | Ryon 102 | |
Sarah Dover | sdover@rice.edu | T | 8.30p-10.30p | Ryon 102 | ||
Andrew Fuqua | andrewf@rice.edu | F | 1-3p | Ryon 102 | ||
Bryan Guido Hassin | guido@rice.edu | W | 3p-5p | Ryon 102 | ||
James Hsia | jhsia@rice.edu | Th | 7.30p-9.30p | Ryon 102 | ||
Greg Stoll | gstoll@rice.edu | M | 8.30p-10.30p | Ryon 102 | ||
Reuben Uy | ruy@rice.edu | T | 4p-6p | Ryon 102 | ||
Gilbert Wang | thewang@rice.edu | Sa | 12n-2p | Ryon 102 | ||
Theo Yaung | othello@rice.edu | Su | 2p-4p | Ryon 102 |
There are no required textbooks for this course. The following are some recommended books, of which the first two are available in the campus bookstore.
Some additional reference material:
Each assignment is given via this website. Refer to the list of assignments on the main COMP 212 page. Assignments are due at class time, regardless of whether they are to be turned in electronically or on paper. All programming is to be done in Java.
Honor code policy: Assignments will be done individually. You may use course notes, texts, and any other reference material. You may discuss general strategies or algorithms with other people (in the course or not), but you may not collaborate in the detail development or actual writing of answers. You may not obtain code from anyone (in the course or not), aside from code provided as part of the course, in reference material, or in standard code libraries.
If you feel that an assignment was graded incorrectly, first state your case to the person who originally graded it. If you still have a complaint, see an instructor.
You are expected to use good programming style. "Design Patterns", a central theme of this course, dictates many aspects of what is considered good style. Other things to keep in mind include informative and useful commenting, useful naming conventions, and good identation. We will encourage good style with our feedback during grading.
There will be three exams of equal weight. The first two will be scheduled in the evening during the semester. The last will be a take-home during finals.
Scores are divided as follows:
45% | "Major" programming assignments |
45% | Exams (3 exams, 15% each) |
10% | "Minor" assignments & lab quizzes |
The minor assignments' primary purpose is to help prepare you for the major assignments.
Each student will receive 3 "slip days". I.e., you may extend assignment (not exam) deadlines by using some of your slip days. They may be used in increments of a single day. To use a slip day, you must inform a course instructor.
Aside from the use of slip days, late assignments or exams are not accepted without exceptional reason, e.g., severe sickness or a family emergency. That you have "too much work" is not sufficient. Your slip days must be used first.
Any student with a disability requiring accomodations in this class is encouraged to contact an instructor after class or during office hours. Additionally, students should contact the Coordinator for Disabled Student Services in the RMC Cloisters.
There is one formal prerequisite: COMP 210: Principles to Computing and Programming. This course is reasonably self-contained; the major informal prerequisites are some proficiency in programming and familiarity with basic data structures like vectors, lists, and trees.