x

Our Privacy Policy has changed. By using this site, you agree to the Privacy Policy.

Data Structures, Algorithms and Software Principles in C

ISBN-10: 0201591189
ISBN-13: 9780201591187
Edition: 1995
List price: $172.40 Buy it from $32.69
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description: Using C, this book develops the concepts and theory of data structures and algorithm analysis in a gradual, step-by-step manner, proceeding from concrete examples to abstract principles. Standish covers a wide range of both traditional and  More...

Used Starting from $103.13
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Periodic Table Online content $4.95 $1.99
Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $172.40
Copyright year: 1995
Publisher: Addison Wesley
Publication date: 9/30/1994
Binding: Paperback
Pages: 748
Size: 8.50" wide x 9.75" long x 1.25" tall
Weight: 3.498
Language: English

Using C, this book develops the concepts and theory of data structures and algorithm analysis in a gradual, step-by-step manner, proceeding from concrete examples to abstract principles. Standish covers a wide range of both traditional and contemporary software engineering topics. The text also includes an introduction to object-oriented programming using C++. By introducing recurring themes such as levels of abstraction, recursion, efficiency, representation and trade-offs, the author unifies the material throughout. Mathematical foundations can be incorporated at a variety of depths, allowing the appropriate amount of math for each user.

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
Linked Data Representations
What are Pointers?
The Basic Intuition
Pointers in C—The Rudiments
Pointer Diagramming Notation
Linear Linked Lists
Other Linked Data Structures
Introduction to Recursion
Thinking Recursively
Common Pitfall—Infinite Regresses
Quantitative Aspects of Recursive Algorithms
Modularity and Data Abstraction
Modularity and Information Hiding in Program Design
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
Introduction to Analysis of Algorithms
What Do We Use for a Yardstick?
The Intuition Behind O-Notation
O-Notation—Definition and Manipulation
Analyzing Simple Algorithms
What O-Notation Doesn't Tell You
Linear Data Structures—Stacks 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
Lists, Strings, and Dynamic Memory Allocation
Lists
Generalized Lists
Applications of Generalized Lists
Strings
Dynamic Memory Allocation
Trees
Basic Concepts and Terminology
Binary Trees
A Sequential Binary Tree Representation
An Application—Heaps and Priority Queues
Traversing Binary Trees
Binary Search Trees
AVL Trees and Their Performance
Two-Three Trees
Tries
An Application—Huffman Codes
Graphs
Basic Concepts and Terminology
Graph Representations
Graph Searching
Topological Ordering
Shortest Paths
Task Networks
Useful Background on Graphs
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
External Collections of Data
Characteristics of External Storage Devices
Techniques That Don't Work Well
Techniques That Work Well
Information Retrieval and Databases
Sorting
Laying Some Groundwork
Priority Queue Sorting Methods
Divide-and-Conquer Methods
Methods That Insert Keys and Keep Them Sorted <B

×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×