Building Better Applications: A Theory of Efficient Software DevelopmentAs computer software has grown more capable and sophisticated, the underlying operating code has expanded. Now an experienced software developer proposes a new set of theoretical ideas and practical techniques for writing simpler, more efficient programs. Dunlavey analyzes programmers and the work they produce, offering a strategy for making both perform better. |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
REDUNDANCY | 22 |
LANGUAGE | 46 |
DATA | 72 |
METHOD | 105 |
Appendix A Graphical Utilities | 111 |
Appendix B CIM SimulationOriginal | 122 |
CIM SimulationRedesign | 137 |
| 151 | |
Common terms and phrases
accept allocated amount application arguments bits block break buffer char cleared cluster color completion conditional consists contains copy create data structure define display draw ERASE example execution extern field FIFO Figure function given graphical handling heap ILST implement input instruction interpreted keep language lexan lines loop machine macro major account match memory method minor mode NULL object operation outcome parallel parse parse tree performance pointer primitive problem procedure ptop queue record redundancy represented request requires RESUME routine screen seconds simple simulation source code stack statement STEP storage string struct subroutine takes task technique thing token TOLONG transaction translation update variables void WAIT write
Bibliographic information
| Title | Building Better Applications: A Theory of Efficient Software Development VNR computer library |
| Author | Michael R. Dunlavey |
| Edition | illustrated |
| Publisher | Michael Dunlavey, 1994 |
| ISBN | 0442017405, 9780442017408 |
| Length | 160 pages |
| Subjects | › Computers / General |
| Export Citation | BiBTeX EndNote RefMan |