Comp 272 - Data Abstraction and OOP - Dordal

Text: Ford & Topp, Introduction to Computing using C++ and Object Technology, Prentice-Hall 1999.

Grades: There will be a midterm, Monday February 23, and a final. The final will be Friday, April 16, 8:30-10:30 am, the time listed in the schedule, in our usual room. There will also be various programming assignments, and possibly some written exercises. Programming will be in C++.

My general course groundrules are here. Exams will count for between 70% to 80% of your grade, with homework and programs making up the rest.

• Classes as Abstract Data Types (ADTs)
• Static inheritance and code reuse
• Dynamic inheritance ("true" object-oriented programming, or OOP)
• Object-oriented design (OOD): how to apply the above to building large programs
• Details of the C++ language.

The midterm study guide is here. Answers for it are here.

My ongoing (but sometimes sketchy) class notes are here.

Here is a handout on basics of OO design; some rules for class design.

Here are some references for CRC-card OO design. Note that this is "large-scale" OO design: how to decompose a problem statement into a set of objects and relationships.

• Alistair Cockburn page
• Softstar page
• dbutler@calpoly page

I changed the protected: members of Shape to private: thus eliminating the problem we had in class on Friday March 12.

Programming assignments:
 

Assignment	Due date	data file	files needed, etc
Day, prog1.text	Wed, Feb 4	no data	no starter files (but cut/paste daysinmonth() from handout)
Mail, mail.text	Wed, Feb 18	no data	mail2004.cpp, note #1 (_new,_kept)
Shapes, shape.text	Fri, Mar 26	no data	ftshape.zip, or directory of files
string2, prog4strings.text	Wed, Apr 7	no data	T_array.cpp
game, prog5game.text	Fri, Apr 16	no data	game dir, with game.cpp fix

some demo programs from class:

• stringer.cpp (basics of strings and vectors)
• intro2classes.cpp (Stack, StackRC, Base, Deriv examples)
• ctordemo.cpp, demonstrating copy ctors and other ctors
• T_array.cpp, an implementation of an array class.
• polynomial.cpp, the polynomial class illustrating dynamic memory issues and copy_ctor/dtor/operator=.
• converter.cpp, two classes and mutual conversions, with ambiguity

To get the Microsoft Visual Studio .net software (2003 version?), you can either see me to get the CD or you can download it directly from our server turing (turing.math.luc.edu). The install file is one large 560MB .executable; you can find it by mounting
    \\turing\msdnaa (you may need \\turing.math.luc.edu\msdnaa),
entering your usual password, and then copying the file
    en_vs.net_2003_pro_full.exe.
This is available to Loyola students in CS courses under the terms of the MSDN Academic Alliance network; basically you can install it and use it forever but you're not entitled to upgrades after graduation. Even I think it's a good deal.

I also have the documentation (the so-called MSDN library) on four CDs. See me if interested. To install:
1. Create a folder C:\MSDN (maybe)
2. Copy the contents of Disk 1 into this folder.
3. Create another new folder, Program Files, under C:\MSDN.
4. Move the files listed below from the MSDN folder into the Program Files folder you created in Step 3:
     Cpref
     Dnduwam
     Dndotnet
     Dnenq
     Dnmag01
     Dnsmtphn
     Dnwmt
     Msdnvs
5. Copy the files on CD 2, CD 3, and CD 4 to the Program Files folder.
6. Run setup.exe from the MSDN folder. If it reports files not found, they're probably there but need to be moved to the right folder (eg from MSDN to Program Files. I apologize for the non-specificness of this step, but the setup error messages should tell you what files need to be relocated.