By Marshall C. Yovits
This quantity in a sequence detailing strategies in undefined, software program and the theory/design/applications of pcs, is worried with reusable software program elements, object-oriented modelling, discrete occasion simulation, and neurocomputing formalisms in computing device studying and visualization.
Read or Download Advances in Computers, Vol. 33 PDF
Similar object-oriented design books
This can be the final in a four-book sequence comprising a serious evaluation of the Unified approach that features a survey of the exchange software program strategies and the synthesis of a much better method. The Transition and construction levels are the ultimate levels of the Unified strategy that offer for the deployment, operation and aid of the procedure one of the person teams.
Kathrin Koslicki bargains an research of standard fabric items, these fabric items to which we take ourselves to be dedicated in usual, scientifically proficient discourse. She focuses relatively at the query of the way the elements of such items are relating to the wholes which they compose. Many philosophers at the present time locate themselves within the grip of an extremely deflationary belief of what it ability to be an item.
This ebook introduces Modula-2 via an object-oriented programming strategy which has been built over the last 5 years at the BSc and MSc machine technology classes at Hatfield. bankruptcy 1 introduces the most gains of Modula-2 via an instance application, while bankruptcy 2 introduces the strategies required for object-oriented software layout.
- Object-Oriented Analysis and Design
- Logic programming : proceedings of the 1999 International Conference on Logic Programming
- Java Programming Language Handbook: The Ultimate Source for Conquering the Java Programming Language
- PHP Reference: Beginner to Intermediate PHP5
- Microsoft Visual FoxPro: Programmer's Guide
- Inside Smalltalk Vol 1
Additional info for Advances in Computers, Vol. 33
Consider an Ada generic package body to implement the Stack-Template. Suppose Stack is declared as a private type with a typical representation-a record with two fields: contents (an array of Items) and top-index (the index in the contents array of the top of the Stack). Ignore the fact that the array has a fixed maximum size while the Stack it represents can be arbitrarily large; the BRUCE W. WEIDE ef a/. The code for Push, Pop, and Top might look like this: package body Stack-Template is ... top-index)); - - copying an Item end Top; + ...
4 An Example: Critique and Redesign of the Stack-Template The Stack-Template of Section 3 embodies the classical design of a stack component that appears-although usually without a formal specificationin a variety of modern texts, presumably as an example of a good abstract design. It has its formal basis in the earliest works on algebraic specification (Liskov and Zilles, 1975) and no doubt has been used in hundreds of programs over many years. How does it stack up against the criteria outlined previously?
However, the operations Push, Pop, and Top in the current design do not constitute a well-chosen set of primary operations. Notice that there is no reason for any restriction on type Item and in fact none is specified. A client instantiating Stack-Template may replace Item by any program type, including simple types such as Integer or more complex types such as Queue of Integers or even Stack of Integers. The problem with the Push operation is that it demands that x not be changed, but also demands that the (old) value of x become the top Item of s.