shopping cart
Call us: 800-878-7323 HELP
McAfee SECURE helps keep you safe from identity theft, credit card fraud, spyware, spam, viruses and online scams.
Interviews | June 19, 2009

All posts by Dave Jim Lynch Makes Landscape Art... Out of Text

3 comments By Dave

If Carl Hiaasen set one of his novels on a residential stretch of boundary line between British Columbia and Washington, or if Richard Russo's characters had relatives in the Pacific Northwest, the result might be something like Jim Lynch's Border Songs. Continue »

  1. $18.16 Sale Hardcover add to wish list

    Border Songs

    Jim Lynch
$75.00
List price: $113.75
TRADE PAPER, USED
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
2 Partner Warehouse Computer Languages- C
Click here to hide store locations


More copies of this ISBN:

Data Structures, Algorithms and Software Principles in C (95 Edition)

by Thomas A. Standish

Data Structures, Algorithms and Software Principles in C (95 Edition) Cover

ISBN13: 9780201591187
ISBN10: 0201591189
Condition: Student Owned
All Product Details

Only 2 left in stock at $75.00!
  1. This particular item is stocked in a Partner Warehouse and will ship separately from other items in your shopping cart.

Synopses & Reviews

Please note that used books may not include additional media (study guides, CDs, DVDs, solutions manuals, etc.) as described in the publisher comments.

Publisher Comments:

Using C, this book develops the concepts and theory of data structures and algorithm analysis step-by-step. It gradually proceeds from concrete examples to abstract principles. The presentation stresses motivation, intuition, and utility before giving technical details. Recurring themes, such as recursion, levels of abstraction, efficiency, representation, and trade-offs, unify the material completely. Important traditional and contemporary software engineering principles are also covered, including modularity, abstract data types and information hiding, as well as new developments, such as risk-based software life cycle models and object-oriented programming.

Book News Annotation:

Text develops the concepts and theories of data structures and algorithm analysis in a gradual, step-by-step fashion, proceeding from concrete examples to abstract principles. The author discusses many contemporary programming topics in the C language, including risk- based software life cycle models, rapid prototyping, and reusable software components. Also provides an introduction to object oriented programming using C++.
Annotation c. Book News, Inc., Portland, OR (booknews.com)

Synopsis:

0201591189B04062001

back to top

About the Author

Thomas A. Standish is the chairman of computer science at the University of California, Irvine. In 1990-91, he became the fourth winner of University of California Irvine's Distinguished Faculty Lectureship for Teaching, the campus' highest distinction for teaching excellence. He has also been a co-winner of his department's best-teacher award, chosen by the popular vote of University of California Irvine undergraduate computer science students.

0201591189AB04062001

back to top

Table of Contents

(All chapters, except Chapter 1, begin with an Introduction and Motivation.)

1. Preparing for the Journey.

Where Are We Going?

Blending Mathematics, Science, and Engineering.

The Search for Enduring Principles in Computer Science.

Principles of Software System Structure.

Efficiency and Tradeoffs.

Software Engineering Principles.

Our Approach to Mathematics.

Some Notes on Programming Notation.

Preview of Coming Attractions.

2. Linked Data Representations.

What are Pointers? The Basic Intuition.

Pointers in CThe Rudiments.

Pointer Diagramming Notation.

Linear Linked Lists.

Other Linked Data Structures.

3. Introduction to Recursion.

Thinking Recursively.

Common PitfallInfinite Regresses.

Quantitative Aspects of Recursive Algorithms.

4. Modularity and Data Abstraction.

The Structure of C Modules.

Priority QueuesAn Abstract Data Type.

A Pocket Calculator Interface.

How to Hide Data Representations.

Modularity and Information Hiding in Program Design.

5. Introduction to Software Engineering Concepts.

Top-Down Programming By Stepwise Refinement.

Proving Programs Correct.

Transforming and Optimizing Programs.

Testing Programs.

The Philosophy of Measurement and Tuning.

Software Reuse and Bottom-up Programming.

Program Structuring and Documentation.

6. Introduction to Analysis of Algorithms.

What Do We Use for a Yardstick?

The Intuition Behind O-Notation.

O-NotationDefinition and Manipulation.

Analyzing Simple Algorithms.

What O-Notation Doesn't Tell You.

7. Linear Data StructuresStacks and Queues.

Some Background on Stacks.

ADTs for Stacks and Queues.

Using the Stack ADT to Check for Balanced Parentheses.

Using the Stack ADT to Evaluate Postfix Expressions.

Implementing the Stack ADT.

How C Implements Recursive Function Calls Using Stacks.

Implementations of the Queue ADT.

More Queue Applications.

8. Lists, Strings, and Dynamic Memory Allocation.

Lists.

Generalized Lists.

Applications of Generalized Lists.

Strings.

Dynamic Memory Allocation.

9. Trees.

Basic Concepts and Terminology.

Binary Trees.

A Sequential Binary Tree Representation.

An ApplicationHeaps and Priority Queues.

Traversing Binary Trees.

Binary Search Trees.

AVL Trees and Their Performance.

Two-Three Trees.

Tries.

An ApplicationHuffman Codes.

10. Graphs.

Basic Concepts and Terminology.

Graph Representations.

Graph Searching.

Topological Ordering.

Shortest Paths.

Task Networks.

Useful Background on Graphs.

11. Hashing and the Table ADT.

The Table ADT.

Introduction to Hashing by Simple Examples.

Collisions, Load Factors, and Clusters.

Algorithms for Hashing by Open Addressing.

Choosing a Hash Function.

Comparison of Searching Methods Using the Table ADT.

12. External Collections of Data.

Characteristics of External Storage Devices.

Techniques That Don't Work Well.

Techniques That Work Well.

Information Retrieval and Databases.

13. Sorting.

Laying Some Groundwork.

Priority Queue Sorting Methods.

Divide-and-Conquer Methods.

Methods That Insert Keys and Keep Them Sorted.

O(n) MethodsAddress Calculation Sorting.

Other Methods.

Comparison and Perspective.

14. Advanced Recursion.

Recursion as a Descriptive Method.

Using Recursion to Build a Parser.

Translating from Infix to Postfix.

Recursion and Program Verification.

15. Object-Oriented Programming.

Exploring OOP Through Progressive Examples.

Building Systems Using Object-Oriented Programming.

Advantages and Disadvantages of Object-Oriented Programming.

16. Advanced Software Engineering Concepts.

The Software Lifecycle.

Software Productivity.

Software Process Models.

Appendix Math Reference and Tutorial. 0201591189T04062001

back to top
back to top

Product Details

ISBN:
9780201591187
Author:
Standish, Thomas A.
Publisher:
Addison Wesley Longman
Location:
Reading, Mass. :
Subject:
Computer Science
Subject:
Programming Languages - C
Subject:
Programming Languages - General
Subject:
C (computer program language)
Subject:
Data structures (computer science)
Subject:
Software engineering
Subject:
Computer algorithms
Subject:
Data structures
Subject:
Language, literature and biography
Subject:
Programming - Algorithms
Subject:
C
Copyright:
1995
Series Volume:
no. 25-015
Publication Date:
September 1994
Binding:
Hardcover
Grade Level:
College/higher education:
Language:
English
Illustrations:
Yes
Pages:
748
Dimensions:
9.54x8.26x1.28 in. 3.22 lbs.
back to top

Other books you might like

  1. $9.50 Used Trade Paper add to wish list

    The Music of the Primes: Searching to Solve the Greatest Mystery in Mathematics

    Marcus Du Sautoy
  2. $30.00 Used Hardcover add to wish list

    Complex Variables

    George Polya
  3. $10.50 Used Trade Paper add to wish list

    The Mystery of the Aleph: Mathematics, the Kabbalah, and the Search for Infinity

    Amir D Aczel
  4. $98.95 New Trade Paper add to wish list

    Abelian Functions (Cambridge Mathematical Library)

    H. F. Baker
  5. $105.95 New Hardcover add to wish list

    Fractional Differential Equations: An Introduction to Fractional Derivatives, Fractional Differential Equations, to Methods of Their Solution and Some (Science and Engineering)

    Igor Podlubny
  6. $35.00 Used Trade Paper add to wish list

    Testing Computer Software 2ND Edition

    Cem Kaner
back to top

Related Aisles

  • back to top

Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and eBooks — here at Powells.com.