x

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

Programming Abstractions in C A Second Course in Computer Science

ISBN-10: 0201545411
ISBN-13: 9780201545418
Edition: 1998
Authors: Eric S. Roberts
List price: $149.60
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: This exciting new data structures book provides students with powerful procedural programming skills that will serve as a solid foundation for later object-oriented programming. Throughout the book, Eric Roberts takes a library-based approach to the  More...

what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
You could win $10,000

Get an entry for every item you buy, rent, or sell.

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: $149.60
Copyright year: 1998
Publisher: Addison Wesley
Publication date: 8/8/1997
Binding: Paperback
Pages: 819
Size: 7.50" wide x 9.25" long x 1.25" tall
Weight: 2.750
Language: English

This exciting new data structures book provides students with powerful procedural programming skills that will serve as a solid foundation for later object-oriented programming. Throughout the book, Eric Roberts takes a library-based approach to the concepts, which allows readers to see more advanced programs early on. This innovative use of libraries will motivate students as they begin tackling more advanced data structures topics. In the first section of the book, Roberts brings readers up-to-speed on libraries and also provides a nice review of C. Eric Roberts is famous for his wonderful writing style, his use of real-world examples, and his special "bug features."

Preliminaries
An Overview of Ansi C.
What is C?
The Structure of a C Program
Variables, Values, and Types
Expressions
Statements
Functions
Data Types in C
Enumeration Types
Data and Memory
Pointers
Arrays
Pointers and Arrays
Records
Dynamic Allocation
Libraries and Interfaces
The Concept of an Interface
Random Numbers
Strings
The Standard I/O Library
Other ANSI Libraries
Recursion and Algorithmic Analysis
Introduction to Recursion
A Simple Example of Recursion
The Factorial Function
The Fibonacci Function
Other Examples of Recursion
Thinking Recursively
Recursive Procedures
The Towers of Hanoi
Generating Permutations
Graphical Applications of Recursion
Backtracing Algorithms
Solving a Maze by Recursive Backtracking
Backtracking and Games
Analysis of Algorithms
The Sorting Problem
Computational Complexity and Big-O Notation
Recursion to the Rescue
Standard Complexity Classes
The Quicksort Algorithm
Mathematical Induction
Data Abstraction
Abstract Data Types
Stacks
Defining a Stack ADT
Using Stacks in an Application
Implementing the Stack Abstraction
Defining a Scanner ADT. Efficiency and ADTs
The Concept of an Editor Buffer
Defining the Buffer Abstraction
Implementing the Editor Using Arrays
Implementing the Editor Using Stacks
Implementing the Editor Using Linked Lists
Linear Structures: Stacks and Queues
Stacks Revisited
Queues
Simulations Involving Queues
Symbol Tables
Designing the Symbol Table Interface
Hash Tables
Using Functions as Data
Mapping Functions
Iterators
Command Dispatch Tables
Recursive Data
Recursive Lists
The Recursive Formulation of a List
Defining a List Abstraction
Generalized List Structure
Trees
Family Trees
Binary Search Trees
Balanced Trees
Defining a General Interface for Binary Search Trees
Expression Trees
Overview of the Interpreter
Understanding the Abstract Structure of Expressions
Representing Expressions as a Concrete Type
Parsing an Expression
Evaluating an Expression
Sets
Sets as a Mathematical Abstraction
Designing a Set Interface
Implementing the Set Package
Designing a Polymorphic Iterator
Enhancing the Efficiency of Integer Sets
Graphs
The Structure of a Graph
A Standalone Interface for Graphs
Implementation Strategies for Graphs
A Set-Based Interface for Graphs
Graph Traversals
Finding Minimum Paths
Looking Ahead
The Concept of Object-Oriented Programming
A Brief Tour of the Java Programming Language
Interactive Programming. 0201545411T04062001

×
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.

×