<--- Back to Details
First PageDocument Content
Software design / Diagrams / Flowchart / Technical communication / Call graph / Decomposition / Subroutine / Main function / Software engineering / Computing / Computer programming
Date: 2001-01-07 17:04:54
Software design
Diagrams
Flowchart
Technical communication
Call graph
Decomposition
Subroutine
Main function
Software engineering
Computing
Computer programming

15 15 Design and documentation : 1 The examples given in earlier chapters, particularly Chapter 12, have in a rather informal way illustrated a design style known as "top-down functional decomposition". "Top down functio

Add to Reading List

Source URL: www.uow.edu.au

Download Document from Source Website

File Size: 19,22 KB

Share Document on Facebook

Similar Documents

FINITE DECOMPOSITION COMPLEXITY AND THE INTEGRAL NOVIKOV CONJECTURE FOR HIGHER ALGEBRAIC K–THEORY (DRAFT) DANIEL A. RAMRAS, ROMAIN TESSERA, AND GUOLIANG YU Abstract. Decomposition complexity for metric spaces was recen

FINITE DECOMPOSITION COMPLEXITY AND THE INTEGRAL NOVIKOV CONJECTURE FOR HIGHER ALGEBRAIC K–THEORY (DRAFT) DANIEL A. RAMRAS, ROMAIN TESSERA, AND GUOLIANG YU Abstract. Decomposition complexity for metric spaces was recen

DocID: 1xVhW - View Document

A NOTION OF GEOMETRIC COMPLEXITY AND ITS APPLICATION TO TOPOLOGICAL RIGIDITY ERIK GUENTNER, ROMAIN TESSERA, AND GUOLIANG YU Abstract. We introduce a geometric invariant, called finite decomposition complexity (FDC), to s

A NOTION OF GEOMETRIC COMPLEXITY AND ITS APPLICATION TO TOPOLOGICAL RIGIDITY ERIK GUENTNER, ROMAIN TESSERA, AND GUOLIANG YU Abstract. We introduce a geometric invariant, called finite decomposition complexity (FDC), to s

DocID: 1xUCC - View Document

Rigorous Reachability Analysis and Domain Decomposition of Taylor Models Martin Berz and Kyoko Makino Department of Physics and Astronomy Michigan State University

Rigorous Reachability Analysis and Domain Decomposition of Taylor Models Martin Berz and Kyoko Makino Department of Physics and Astronomy Michigan State University

DocID: 1xTVE - View Document

Computer Vision Winter Workshop 2008, Janez Perˇs (ed.) Moravske Toplice, Slovenia, February 4–6 Slovenian Pattern Recognition Society, Ljubljana, Slovenia A Lower Bound by One-against-all Decomposition for Potts Mode

Computer Vision Winter Workshop 2008, Janez Perˇs (ed.) Moravske Toplice, Slovenia, February 4–6 Slovenian Pattern Recognition Society, Ljubljana, Slovenia A Lower Bound by One-against-all Decomposition for Potts Mode

DocID: 1vs97 - View Document

Functional Decomposition in Engineering: A Survey

Functional Decomposition in Engineering: A Survey

DocID: 1vqfM - View Document