CSE 222 Syllabus

Winter 2010

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, September 2008.

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 on Tuesdays at 10:00 PM 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.

Lecture/Activity	Lab Assignment Due	Closed Lab
Week of 1/4 Overview; review of using templates for generalization; Sequence; Set; Queue		Get_Words and Put_Words
Week of 1/11 Record; using templates for decoupling; utility classes; Sorting_Machine		Sort extension for Queue (using selection sort)
Week of 1/18 (Holiday on Monday) Stack; how recursion works; Partial_Map	Lab #1: Resolve/C++ Pretty-Printer	Client of Partial_Map
Week of 1/25 Implementer's view; convention and correspondence; Representation		Representing a Sequence using two Stacks
Week of 2/1 Commutative diagrams; Static_Array; Array; review	Lab #2: Glossary generator	Midterm exam (during closed lab)
Week of 2/8 Hashing; mathematical binary trees; Binary_Tree		Implementing and testing a Hash operation
Week of 2/15 Binary search trees; introduction to pointers and dynamically allocated storage	Lab #3: Partial_Map using a hash table	Get_Tree and Put_Tree
Week of 2/22 Pointers and dynamically allocated storage; singly-linked list data structures		Representing a Stack using a singly-linked data structure
Week of 3/1 List; doubly-linked list data structures; ordinary C++ pointers	Lab #4: Partial_Map using a binary search tree	Adventures with C strings and C++ aliasing
Week of 3/8 Loop invariants	Lab #5 due on Thurs at 10:00 PM: List_Retreat using a doubly-linked list data structure	Review (during closed lab)

Lab Assignments

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

Grading Plan

Midterm Exam	20%
Final Exam	30%
Homework Assignments	5% (total of many)
Closed Lab Assignments	8% (8 @ 1% each)
Lab Assignments	35% (5 @ 7% each)
Class Participation	2%

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