Skip to main content
  • Book
  • © 1979

A Structured Programming Approach to Data

Authors:

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (15 chapters)

  1. Front Matter

    Pages i-xi
  2. An Overview of Program Design

    1. An Overview of Program Design

      • Derek Coleman
      Pages 1-5
  3. Program Design Notation

    1. Program Design Notation

      • Derek Coleman
      Pages 6-20
  4. Arrays

    1. Arrays

      • Derek Coleman
      Pages 21-26
  5. Simple Data Structuring

    1. Simple Data Structuring

      • Derek Coleman
      Pages 27-35
  6. On Program Design

    1. On Program Design

      • Derek Coleman
      Pages 36-48
  7. Exercises 1

    1. Front Matter

      Pages 49-52
    2. Set Structures

      • Derek Coleman
      Pages 53-65
    3. The Class Construct

      • Derek Coleman
      Pages 66-79
    4. Dynamic Data Structures

      • Derek Coleman
      Pages 80-94
    5. Sequences

      • Derek Coleman
      Pages 95-112
  8. Exercises 2

    1. Front Matter

      Pages 113-115
    2. Simple Searching Techniques

      • Derek Coleman
      Pages 116-127
    3. Hashing Techniques

      • Derek Coleman
      Pages 128-140
    4. Recursion and Recursive Algorithms

      • Derek Coleman
      Pages 141-157
    5. Binary Search Trees

      • Derek Coleman
      Pages 158-180
  9. Exercises 3

    1. Front Matter

      Pages 181-186
    2. Designing Programs from Data Structures

      • Derek Coleman
      Pages 187-209
  10. Exercises 4

    1. Exercises 4

      • Derek Coleman
      Pages 210-216
  11. Back Matter

    Pages 217-222

About this book

Much of current programming practice is basically empirical and ad hoc in approach. Each problem is tackled without relation to those that have gone before; experiences are made and stored as a series of fragments. Now, under the pressure of events, this unsatisfactory state of affairs is coming to an end. Programming is becoming a technology, a theory known as structured programming is developing. The purpose of a theory is to categorise and explain existing practice, thus enabling it to be improved through the development of new and sharper techniques. The resulting experiences have then to be fed back into the theory so that the process of enrichment may continue. This dialectical relationship between theory and practice is essential to a healthy programming technology. The lack of such a relationship in the 1950s and 60s and the accompanying software crisis certainly confirm the converse of this proposition. My aim in writing this book has been to explain the current state of the theory of structured programming, so that it may be used to improve the reader's practice. The book deals with two facets of programming - how to design a program in terms of abstract data structures and how to represent the data structures on real and bounded computers. The separation between program design and data structure representation leads to more reliable and flexible programs.

Authors and Affiliations

  • Department of Computation, Institute of Science Technology, University of Manchester, Manchester, England

    Derek Coleman

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access