Software Development In C
by Sartaj Sahni & Robert F. Cmelik
ISBN 0-929306-16-3
1995
556 pages, Paperback
$49.95 (US Dollars)
Author Bios: Sahni, Cmelik

 Summary    Contents 

Table of Contents:

• Software Development
  • Development Activities
  • Specification
  • Design
  • Modularization
  • Selecting a Programming Language
  • Program Development
  • Validation
  • Performance Analysis and Measurement
  • Documentation
  • Maintenance
  • Enhancement
  • Computer Aids
  • Summary
  • References and Selected Readings
• Specification
  • Introduction
  • Mathematical Problems
  • Programming Languages
  • Spread Sheet
  • Database Management
  • Summary
  • References and Selected Readings
  • Exercises
• Design
  • Introduction
  • Capabilities
  • Menus
  • Command Format
  • On-Line Help
  • Design Examples
  • References and Selected Readings
  • Exercises
• Modularization
  • Introduction
  • Text Editor
  • Spread Sheet
  • Database Management
  • Programs
  • Summary
  • References and Selected Readings
  • Exercises
• Aesthetic Programs
  • Program Beauty
  • Choice of Names
  • Comments
  • Program Layout
  • Statement Composition
  • Choice of Control Statements
  • Generality
  • Input/Output Formats
  • References and Selected Readings
  • Exercises
• Defensive Programming
  • Introduction
  • Input Errors
  • Numerical Errors
  • Boundary Errors
  • Miscellaneous Causes
  • References and Selected Readings
  • Exercises
• Stepwise Refinement
  • Introduction
  • Rat in a Maze
  • Sorting
  • Nets
  • Assembly Line Ordering
  • References and Selected Readings
  • Exercises
• Program Correctness
  • Introduction
  • Mathematical Induction
  • The Predicate Transformer Method
  • References and Selected Readings
  • Exercises
• Testing
  • Introduction
  • Module Testing Strategies
  • Generation of Test Data
  • Debugging
  • References and Selected Readings
  • Exercises
• Performance Analysis
  • Introduction
  • Space Complexity
  • Time Complexity
  • Asymptotic Notation
  • Practical Complexities
  • References and Selected Readings
  • Exercises
• Performance Measurement
  • Introduction
  • Function Call Overhead
  • Recursion vs. Iteration
  • Boundary Tests
  • Programming for Efficiency
  • Comparing Algorithms
  • Generating Test Data
  • Exercises
• Data Structures
  • Introduction
  • Formula Based Representation
  • Linked Representation
  • Indirect Addressing
  • A Comparison
  • Simulating Pointers
  • References and Selected Readings
  • Exercises
• Advanced Data Structures
  • Binary Trees
  • Heaps
  • Binary Search Trees
  • Union-Find Trees
  • Graphs
  • References and Selected Readings
  • Exercises
• Algorithm Design Methods
  • Introduction
  • The Greedy Method
  • Divide-and-Conquer
  • Dynamic Programming
  • Backtracking
  • Branch-and-Bound
  • Heuristic Methods
  • References and Selected Readings
  • Exercises
• Appendix A: Curve Fitting
• Index