CSE 222 Syllabus

Spring 2008

CSE 222: Development of Software Components

Description

Templates for generalization and decoupling; container components; component-based software from implementer's perspective; data representation using layering and using pointers.

Level and Credits

• U 4 (three one-hour lectures, one one-hour lab)

Prerequisites

• CSE 221

Quarters Offered

• Au, Wi, Sp, Su (H222: Sp)

General Information, Exclusions, etc.

• Resolve/C++ is used.

Intended Learning Outcomes

• Master using the computing environment (operating system, tools, language system, etc.) needed to complete lab assignments;
• Master using C++ class templates and classes, and related Resolve/C++ principles for clients, to write layered implementations of operations;
• Master using simple recursion to write layered implementations of operations;
• Master using simple techniques to test layered implementations of operations, including developing and carrying out simple specification-based test plans;
• Master using simple techniques to debug layered implementations of operations;
• Be familiar with using the Array, Binary_Tree, List, Partial Map, Queue, Record, Representation, Sequence, Set, Sorting_Machine, Stack, and Static_Array templates to write application programs and/or component implementations;
• Be familiar with using basic C++ control structures and statements, Resolve/C++ class templates and classes, and related Resolve/C++ principles for clients and implementers, to write bodies of components that define new types with layered data representations;
• Be familiar with writing code that uses dynamic storage management and pointers to write bodies of components that define new types with simple "raw C++" linked data representations;
• Be familiar with using basic algorithm analysis techniques and notations to analyze and express execution time of operations whose implementations involve straight-line code and simple loops;
• Be familiar with using simple formal logic assertions involving mathematical set models to understand and reason about an operation's behavior;
• Be familiar with using simple techniques to test implementations of class templates that define new types, including developing and carrying out simple specification-based test plans;
• Be familiar with using simple techniques to debug implementations of class templates that define new types;
• Be exposed to using data representation conventions ("representation invariants") and correspondences ("abstraction relations") to reason about correctness of data representations;
• Be exposed to using the Resolve/C++ principles for interface designers to guide the choice of mathematical model and operation behavior of a new software component;
• Be exposed to using loop invariants to reason about loop behavior [not achieved during 9-week quarters].

Texts

• CSE 222 Course Packet, OSU UniPrint, December 2007.

Sequence of Topics and Activities (Approximate)

• Lecture/activity days are MTW.  The first homework assignment due in a given week generally will be due on Monday.  The second homework assignment due in a given week generally will be due on Wednesday.
• Lab assignments will be due at 10:00 PM on Thursdays except as noted below.
• Closed lab day is Friday.  Homework assignments that involve preparation for closed lab will be due at the beginning of closed lab.

Lab Assignments

1. Resolve/C++ pretty-printer
2. Glossary generator
3. Partial_Map with hash table representation using Array of Queue of Record
4. Partial_Map with binary search tree representation using Binary_Tree of Record
5. List_Retreat with doubly-linked list representation (using pointers)

Grading Plan

• Note: A passing score on the final exam is required in order to receive a passing grade for the course.