CSE 321: Case Studies in Component-Based Software

CSE 321:
Case Studies in Component-Based Software

Description

Case studies using tree, tokenizing, parsing, and code generating components; context-free grammars; sorting components and sorting algorithms.

Level and Credits

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

Prerequisites

CSE 222 and a minimum CPHR of 2.00. Prereq or concur: Math 366.

Quarters Offered

Au, Wi, Sp, Su

General Information, Exclusions, etc.

RESOLVE/C++ is used.

Objectives

Mastery of using the computing environment (operating system, tools, language system, etc.) to complete programming projects and to communicate electronically with others;
Mastery of using RESOLVE/C++ class templates and classes, and related RESOLVE/C++ principles for clients and implementers, to build new components with layered data representations;
Mastery of using simple techniques to debug implementations of class templates;
Familiarity with using layering of software components to implement a large programming project;
Familiarity with using conventions ("representation invariants") and correspondences ("abstraction relations") to reason about layered data representations;
Familiarity with using the RESOLVE/C++ principles for interface designers to guide the choice of mathematical model and operation behavior of a new software component;
Familiarity with using simple techniques to test implementations of class templates including developing and carrying out simple specification-based and code-based test plans;
Familiarity with using context-free grammars and languages to specify syntax;
Familiarity with using recursive descent to process context-free languages;
Familiarity with using state-transition diagrams to tokenize languages;
Familiarity with using tokenizing software components and their implementations;
Familiarity with using Tree template as a client;
Familiarity with using Sorting Machine template as a client and as an implementer;
Familiarity with important classical sorting algorithms as implementations of Sorting Machine template;
Familiarity with using basic algorithm analysis techniques and notations to analyze and express execution time;
Familiarity with working as part of a team to implement a large programming project.

Sequence of Topics and Activities (Approximate)

Monday-Tuesday-Wednesday (lecture/activity days)	Friday (closed lab day)	Lab assignment due at midnight
Week of 9/23 Course introduction; Sorting_Machine, sorting algorithms	Meet in DL 480 - no closed lab
Week of 9/28 Sorting_Machine implementation, heapsort	Sorting_Machine with quicksort
Week of 10/5 Convention/correspondence; Project intro; Tree	BugsWorld contest
Week of 10/12 Statement; Program	Tree operations	Lab 1 due Mon. 10/12: Sorting_Machine with heapsort
Week of 10/19 Program cont.; Context-free grammars	Program kernel and pretty print	Lab 2 due Fri. 10/23: Statement kernel and pretty print
Week of 10/26 Midterm exam on Wed. 10/28 Recursive descent parsing	Evaluating arithmetic expressions
Week of 11/2 BL program execution; code generation; BL_Tokenizing_Machine	BL interpreter	Lab 3 due Fri. 11/6: Parser for Program/Statement
Week of 11/9 Wed. 11/11, no class BL_Tokenizing_Machine cont.	Word counter	Lab 4 due Fri. 11/13: Code generator for Program
Week of 11/16 Resolve/C++ model of software	Meet in DL 480 - no closed lab	Lab 5 due Fri. 11/20: BL_Tokenizing_Machine
Week of 11/23 Resolve/C++ model of software cont.	No class
Week of 11/30 Mon. 11/30 - Meet in DL 280 for closed lab: Timing of sorting machines Performance analysis	Meet in DL 480 - Final exam review	Lab 6 due Fri. 12/4: New component family and tag cloud generator

Lab Assignments

Heapsort implementation of Sorting_Machine
Implementation of Statement and Pretty_Print
Parser for Program/Statement
Code generator for Program
Implementation of BL_Tokenizing_Machine
New component family and tag cloud generator

Grading Plan

Midterm Exam	20%
Final Exam	30%
Homework Assignments	10% (total of many)
Closed Lab Assignments	8% (8 @ 1% each)
Lab Assignments	30% (6 @ 5% each)
Class Activities/Participation	2%

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

Texts

CSE 321 Course Packet, OSU UniPrint, 2009.
Weide, B.W., Software Component Engineering With Resolve/C++, Volume 2: The Client's View, OSU UniPrint, 2007.
Weide, B.W., Software Component Engineering With Resolve/C++, Volume 3: The Implementer's View, OSU UniPrint, 2007.