CIS 222: Software Development Using Components

CIS 222:
Software Development Using Components

Description

Component-based software from implementer's perspective; container and graphical user interface components; data representation using layering and using pointers; introduction to algorithm analysis.

Level, Credits, Class Time Distribution, Prerequisites

Level	Credits	Class Time Distribution	Prerequisites
U	4	Three one-hour lectures, one one-hour lab	CIS 221 (H222: CIS H221)

Quarters Offered, General Information, Exclusions, Cross-Listings, etc.

Au, Wi, Sp, Su (222H: Sp)
C++ is used.

Course Objectives

Master using the computing environment (operating system, tools, language system, etc.) to complete lab assignments and to communicate electronically with others;
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, List, Partial Map, Queue, Record, Sequence, Set, and Stack templates to write layered implementations of operations;
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 component realizations with layered data representations;
Be familiar with reading code that uses dynamic storage management (new and delete) and pointers to create simple "raw C++" data representations;
Be familiar with using loop invariants to reason about loop behavior
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 writing programs using dynamic storage management to create "raw C++" data representations;
Be exposed to writing simple formal logic assertions involving mathematical set models to describe an operation's behavior;
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.

Relationship to ABET Criterion 3

Relationship to CSE Program Objectives

a	b	c	d	e	f	g	h	i	j	k
XX	X	XXX	X	XX	X	X		X		XXX

1a	1b	1c	2a	2b	3a	3b	3c	4a	4b
XXX	XX	XXX		X	X		X	X	X

Textbooks and Other Required Material

CIS 221 and CIS 222 Course Notes, a.k.a. Weide, B.W., Software Component Engineering, OSU Reprographics, 1999.
CIS 222 Handouts, OSU Reprographics.

Topics

Number of Weeks	Topics	Readings
1	Templates; instantiates relation; component coupling diagrams and code; instantiation diagrams and code; Set and Sequence components	[W98] Set, [W98] Sequence
1	Checking components; checks relation using templates; Queue component	[W98] Queue
1	Extensions; extends relation using templates; toolkit classes; sorting Queues	Handouts
1	Stack component; how recursion works; Record and Partial_Map components	[W98] Record, [W98] Partial_Map
1	Loop invariants	[W98] Chapter 6, [W98] Stack
1	Performance analysis; analysis of algorithms	Handouts
1	Representation; encapsulates relation; convention and correspondence	Handouts
1	Array component; hashing to implement Partial_Map; fully parameterized components; uses relation; partial instantiation; specializes relation	Handouts, [W98] Array
1.5	Pointers and dynamic storage; List component	Handouts, [W98] List
0.5	Review and exams

Representative Lab Assignments

Week	Lab Topic	Week	Lab Topic
1	Pretty printer using HTML	5-6	Automated glossary generation
2	Sorted table generator for HTML	7-8	Partial_Map represented using Array of Queue of Record (hashing)
3	Medical information processing	7-8
4	Pizza delivery service	9-10	List represented using "raw C++" pointers

Grading Plan

Midterm Exam	Final Exam	Homework Assignments	Closed Lab Assignments	Lab Assignments	Class Participation
20%	30%	10% (total of many)	9% (9 @ 1% each)	28% (8 @ 3.5%)	3%

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

Preparer Information and Date: Syllabus prepared by Bruce W. Weide, last modified 11 March 1999.