|
|
|
CS 420/520 Object-Oriented ProgrammingCRN 14210 (for CS 420) and 14211 (for CS 520) |
||||
|
||||||
|
Academic Integrity Policy |
|
Fall Quarter 2009
PrerequisitesNo familiarity with object-oriented programming is assumed; students who have expereince with Java or C++ should be prepared to unlearn some of what they think they know. Prior experience with Smalltalk is not required. The class assumes a working knowledge of discrete mathematics and machine organization the fundamentals of instruction coding and data representation in the computer's memory. (Students who have completed PSU CS 310 and CS 340 will be well prepared) TextbooksCourse DescriptionThe objective of this course is to teach students to program well in an object-oriented style. The focus is more on object-oriented design and programming than on a particular language and its niceties. The course will use the Pharo dialect of the Smalltalk language because Smalltalk is very simple and allows the programmer to manipulate objects directly. Using Smalltalk permits the course to be focussed on concepts rather than on navigating the intricacies of a language definition. Samples of other languages, such as Ruby and Java, may be included.Topics covered will include responsibility-driven design, test-driven development, refactoring, code reading, reuse, parameterization, inheritance and programming patterns. Specific Learning ObjectivesOn completion of this course, students should be able to
Policies
Academic IntegrityStudents are at university for two reasons: to learn stuff, and to gain a credential. Because the credential is important to many of our students, part of my role as a professor is to make sure that it has value. This means ensuring that the degree is awarded only to those students who have mastered the material in my course. I have every sympathy for those who have difficulty with the material and seek the assistance of the instructor, the TA or their fellow students. I have no sympathy at all for those who decide that the fastest way to a degree is to cheat. I have been responsible for having cheating students dismissed from the university in the past, and I will not hesitate to seek to have cheaters dismissed in the future. The most common form of academic dishonesty — cheating — is representing the work of others as your own. In all written material, it is expected that you will use others' work, but when you do so it must be in a way that makes it absolutely clear that someone else's work is being cited, and who is the original author. If you reproduce someone else's work in a way that makes it appear to be yours, you are guilty of plagiarism, in other words, of cheating. Cheating on an assignment or exam will result in an automatic zero grade for that piece of work, and the initiation of disciplinary action at the University level. Cheating and collaborationI encourage collaboration on certain assignments; I will not tolerate cheating. Where is the line between these activities? First, if an assignment is explicitly set up as a team assignment, you are of course allowed — indeed, required — to collaborate with the members of your team. In this case I will generally require only one completed piece of work to be turned in from the team as a whole. For individual assignments, I encourage you to talk about the problem with your fellow students. During such discussion, you may even write something, perhaps the code of a critical method, as a group. If you do this, there is a danger that you might reproduce that group work as if it were your own. To guard against this danger, do the following: after the group session, destroy all the notes and code fragments that you may have brought away with you. Then go and do something else for an hour or two: go for a walk or a bike ride, play your favorite sport, go to the gym: do something to flush your short-term memory. Then sit down with a blank sheet of paper or a blank workspace and start work on your own solution. If you have a photographic memory or otherwise won't be able to forget what you have seen someone else write, then don't participate in collaborative problem-solving sessions. If I see the same code or writing assignment from two or more students I will take this as evidence that these guidelines have been ignored, and will assign a grade of zero to all of the students involved. |
||||
| |
|
|
Grade Distribution: 40% on homework assignments, 15% on the (take home) mid-term, 35% on the class project, and 10% on attendance and class participation. Your participation will be used to judge whether you are keeping up with the reading assignments.
Course slides will be available as Adobe Acrobat files as the course
proceeds, but probably not until the day of class.
If you look ahead, you will find slides or notes from the previous year's offering, which are certainly out of date. but may nevertheless be useful.
Weekly Schedule (subject to change, as the quarter progresses)
|
Date |
Reading |
Lecture material |
Homework Assignments (due at 16:30 on date) |
||
|---|---|---|---|---|---|
| 1 | Monday 28th Sept | No class | Read chapters 1 and 2 of Pharo By Example (here is an abbreviated download of just those chapters). Download Pharo and work through the process of creating the "Lights Out" game as described in Chapter 2.
Also, sign up for the class mailing list using mailman. |
||
|
Wed. 30th Sept. |
Chapters 1 and 2 of Pharo by Example (PBE) |
Introduction to the Course, and Introduction to Objects |
Fun with Smalltalk Syntax |
||
| 2 | Monday 5th Oct. |
|
More on Smalltalk Syntax. |
|
|
|
Wed. 7th October |
Read PBE Chapters 34, 11 |
|
Good Smalltalk, Part I |
||
| 3 | Monday 12th October | PBE Chapters 510 | Collections, Blocks. Enumerating over collections.
Testing. |
(Assignment 1 due) | |
| Wed. 14th October |
Code developed in class: Boxes and KWIC | ||||
| 4 | Mon. 19th October |
Completing the KWIC index problem. |
Simple Smalltalk testing: with Patterns. Testing slides (pdf) Using TestResources |
(Assignment 2 due) | |
| Wed. 21st October |
Beck pages 1975 |
Lessons from the Homework (pdf) | |||
| 5 | Mon. 26th Oct. |
Guest lecture on Smalltalk Implementation
Dr. Harry Porter |
Harry Porter's slides | ||
| Wed 28th October |
Guest lecture on Smalltalk Implementation. Dr. Harry Porter |
Assignment 3 due on Friday 30th | |||
| 6 | Mon. 2nd November |
Beck pp 178 |
Coding patterns for Methods |
Best Practice Patterns I (slides) |
Project Proposals assigned |
|
Wed 4th Novermber |
|
More Coding patterns for Methods |
Best Practice Patterns II (slides) |
||
| 7 | Mon. 9th November | On Understanding Data Abstraction.
Types in OO Languages |
Cook's Essay; Slides
Types slides |
Project Proposals due today | |
| Wed. 11th November
Armistice Day: PSU Closed no class! |
|||||
| 8 | Mon 16th November |
Mark Guzdial's chapter on Morphic | Project Process
Programming GUIs with Morphic |
Slides
MorphicDemo-Dice is on SqueakSource |
Assignment 5 set |
| Wed 18th November |
Checks Pattern Language Pratt's Null Object Pattern Alpert extract on Observer |
Iterator Pattern. Observer pattern; Dependencies; model-view separation and the |
Programming Patterns chart Patterns Slides |
||
| 9 | Mon. 23rd November |
How to make an Object: Patterns for Object Creation and initialization
UML Sequence diagrams |
Slides (1_up)
Sequence diagrams web page |
Assignment 5 due | |
| Wed 25th November Thanksgiving Eve: no live class! |
Biddle & Tempero on Reuse | Reuse: context & component. Patterns that aid in reuse. Delegation | Reuse slides | ||
| 10 | Mon. 30th November |
Black: A use for inheritance | Subtyping, conformity and Polymorphism | Subtyping slides
Trampoline changeset |
|
| Wed 2nd December |
Schärli, Black, Ducasse: Encapsulation paper | Enhancing Reuse with the Core/Support split. | Encapsulation Slides (4-up) Core/Support Slides (1-up) Traits Slides (1-up) |
||
| Exam Week |
Mon. 7th December 17:3019:20 |
Project Demonstrations | Refactoring
Metrics paper Refactoring Case Study paper |
Most recently modifed on