Silicon Press Logo
Spacer Spacer

Cover; click to enlarge Software Development in Java
by Sartaj Sahni & Raj Kumar
ISBN 0-929306-26-0
2003
465 pages, Paperback
$49.95 (US Dollars)
Author Bios: Sahni, Kumar

Table of Contents:

  • Chapter 1: Software Development
    • Development Activities
    • Specification
    • Design
    • Modularization
    • Selecting a Programming Language
    • Program Development
    • Section 1.7: Validation
    • Performance Analysis and Measurement
    • Documentation
    • Maintenance
    • Enhancement
    • Computer Aids
    • Summary
    • References and Selected Readings
  • Chapter 2: Specification
    • Introduction
    • Mathematical Problems
    • Programming Languages
    • Spread Sheet
    • Database Management
    • Summary
    • Exercises
  • Chapter 3: Design
    • Introduction
    • Capabilities
    • Menus
    • On-line Help
    • Exercises
  • Chapter 4: Modularization
    • Introduction
    • Spread Sheet
    • Database Management
    • Programs
    • Summary
    • References and Selected Readings
    • Exercises
  • Chapter 5: Aesthetic Programs
    • Program Beauty
    • Choice of Names
    • Comments
    • Program Layout
    • Statement Composition
    • Choice of Control Statements
    • Generality
    • Input/Output Formats
    • Exercises
  • Chapter 6: Defensive Programming
    • Introduction
    • Input Errors
    • Numerical Errors
    • Boundary Errors
    • Miscellaneous Errors
    • Exercises
  • Chapter 7: Stepwise Refinement
    • Introduction
    • Rat in a Maze
    • Sorting
    • Nets
    • Assembly Line Ordering
    • References and Selected Readings
    • Exercises
  • Chapter 8: Program Correctness
    • Introduction
    • Mathematical Induction
    • The Predicate Transformation Method
    • References and Selected Readings
    • Exercises
  • Chapter 9: Testing
    • Introduction
    • Module Testing Strategies
    • Generation of Test Data
    • Debugging
    • References and Selected Readings
    • Exercises
  • Chapter 10: Performance Analysis
    • Introduction
    • Space Complexity
    • Time Complexity
    • Asymptotic Notation
    • Practical Complexities
    • References and Selected Readings
    • Exercises
  • Chapter 11: Performance Measurement
    • Introduction
    • Function Call Overhead
    • Recursion vs. Iteration
    • Boundary Tests
    • Programming for Efficiency
    • Comparing Algorithms
    • Generating Test Data
    • Exercises
  • Chapter 12: Data Structures
    • Introduction
    • Formula Based Representation
    • Linked Representation
    • Indirect Addressing
    • A Comparison
    • Simulating Pointers
    • References and Selected Readings
    • Exercises
  • Chapter 13: Advanced Data Structures
    • Binary Trees
    • Heaps
    • Binary Search Trees
    • Graphs
    • References and Selected Readings
    • Exercises
  • Chapter 14: 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


Google
 
Web www.silicon-press.com
About SP   FAQs   Authors   Custom Reports   Our Partners   For Partners