 |
|
| DESIGNING COMPUTER PROGRAMS
| |
| | |
|
|
To order this title, and for more information, click here
By
Jim Haigh, B.Sc., Dip.Ed., Lecturer, Peterborough Regional College, UK
Description
This is a book for students at every level who are learning to program for the first time - and for the considerable number who learned
how to program but were never taught to structure their programs. The author presents a simple set of guidelines that show the programmer
how to design in a manageable structure from the outset. The method is suitable for most languages, and is based on the widely used 'JSP'
method, to which the student may easily progress if it is needed at a later stage.
Most language specific texts contain very little
if any information on design, whilst books on design approach the topic at too high a level for someone learning their first language.
This inexpensive introduction to design can be used alongside whatever programming book suits the student's particular needs.
Audience
All students learning their first computer language as part of an FE or HE course; A level computing; adult education programming courses.
Contents
Glossary * Introduction * Structure diagrams * The computer * Repeats of repeats * Menus and subroutines * Arrays * File processing *
Validation * Program design language (PDL) * Starting at the top * Answers to exercises * Index.
| Bibliographic details |
Paperback, 160 pages, publication date: OCT-1994
ISBN-13: 978-0-340-61398-6
ISBN-10: 0-340-61398-X
Imprint: BUTTERWORTH HEINEMANN
|
| Price and Ordering |
Price:
EUR 33.95
USD 46.95
GBP 27.99
|  |
Books and book related electronic products are priced in US dollars (USD), euro (EUR), and Great Britain Pounds (GBP). USD prices apply to the Americas and Asia Pacific. EUR prices apply in Europe and the Middle East. GBP prices apply to the UK and all other countries.
|
See also information about conditions of sale & ordering procedures, and links to our regional sales offices.
|
034/330
Last update: 4 Sep 2009
|
|
| |
| | |
|
|
| |
Home | Elsevier Sites | Privacy Policy | Terms and Conditions | Feedback | Site Map | A Reed Elsevier Company