Algorithms and Data Structures An Approach in C

Name: Algorithms and Data Structures An Approach in C
Price: 44.56 USD
Availability: InStock
ISBN: 9780030967023

ISBN-10: 0030967023

ISBN-13: 9780030967023

Edition: N/A

Authors: Charles F. Bowman

List price: $45.00

30 day, 100% satisfaction guarantee!

Marketplace

1 new & used from $44.56

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

With numerous practical, real-world algorithms presented in the C programming language, Bowman's Algorithms and Data Structures: An Approach in C is the algorithms text for courses that take a modern approach. For the one- or two-semester undergraduate course in data structures, it instructs students on the science of developing and analyzing algorithms. Bowman focuses on both the theoretical and practical aspects of algorithm development. He discusses problem-solving techniques and introduces the concepts of data abstraction and algorithm efficiency. More importantly, the text does not present algorithms in a "shopping-list" format. Rather it provides actual insight into the design process…

Book details

List price: $45.00
Publisher: Oxford University Press, Incorporated
Publication date: 2/1/1994
Binding: Hardcover
Pages: 352
Size: 7.75" wide x 9.56" long x 1.09" tall
Weight: 2.024

Introduction
Overview
Why Study Algorithms?
Why C?
Coding Style
What You Need to Know
Algorithm Design
How to Design an Algorithm
Example 1: Fibonacci Numbers
Example 2: Matrix Addition
Static Data Structures
Overview
Arrays
Ordered Lists
Stacks
Example Calculator
Queues
Recursion
Introduction
Factorial Numbers
Writing Recursive Functions
Use of Recursion
Dynamic Data Structures
Introduction
Linked Lists
Linked Lists Using Pointers
List Processing
Stacks Revisited
Queues Revisited
Dynamic Memory Allocation
Simulation Example
Doubly Linked Lists
Generalized Lists
Trees
Basic Principles
Binary Trees
Balanced Trees
Threaded Binary Trees
Applications of Trees
Graphs and Digraphs
Introduction
Internal Representation
Traversals
Spanning Trees
Shortest Path Algorithm
Searching
Introduction
Sequential Searching
Searching Ordered Tables
Hashing
Sorting Techniques
Introduction
Bubble Sort
Selection Sort
Insertion Sort
Quicksort
Heapsort
Mergesort
Acrostic Puzzle
C for Programmers
Introduction
Data Types
Declarations
Operator Set
Expressions and Statements
Control Flow
Pointers
The C Preprocessor Suggested Readings
Index
Table of Contents provided by Publisher. All Rights Reserved.