Introduction to Computing and Algorithms

ISBN-10: 0201314517
ISBN-13: 9780201314519
Edition: 1998
List price: $161.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 book prepares students for the world of computing by giving them a solid foundation in the "science" of computer science - algorithms. By taking an algorithm-based approach to the subject, this new book helps readers grasp overall concepts,  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
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
Add to cart
Study Briefs
MS PowerPoint® 2010 Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $161.60
Copyright year: 1998
Publisher: Addison Wesley
Publication date: 10/16/1997
Binding: Paperback
Pages: 399
Size: 7.50" wide x 9.25" long x 0.75" tall
Weight: 1.914
Language: English

This book prepares students for the world of computing by giving them a solid foundation in the "science" of computer science - algorithms. By taking an algorithm-based approach to the subject, this new book helps readers grasp overall concepts, rather than getting them bogged down with specific syntax details of a programming language that can become obsolete quickly. By working with algorithms from the start and applying the concepts to the real world, students will understand the power of computers as problem solving tools and learn to think like programmers.

The Computing Perspective
Technology, Science and Culture
What is Technology
Technology and Human Evolution
Paradigmatic Change
The Age of Tribal Consciousness
Abstract Media Technology
The Age of Absolute Abstraction
Mechanical Media Technology
The Age of Mechanistic Thinking
Electronic Media Technology
Hallmarks of a Paradigm Shift
Essential Features of the Emerging Paradigm
The Central Theme of the New Paradigm
The Algorithmic Model
Introduction
Flow Charts
Properties of Algorithms
Algorithms
Components
Seeing Things from the Computing Perspective
Summary
The Algorithm Toolkit
Basic Data, Operations, and Decisions
Atomic Data
Operators
Data Types and Declarations
Conditions and Decisions
Summary
Tools for Procedural Abstraction
Why modularity?
Two Kinds of Modules
The Scope of Data
Parameters
The Importance of Procedural Abstraction
Documenting Modules
Recursive Control
Using a stack to Trace Recursion
Summary
Tools for Data Abstraction
Records
The Difference Between Types and Variables
Anonymous Data Types
Dynamic Data Structures
Linked Lists
The Scope of Linked Data
Binary Trees
Graphs
Iterative Control
Iteration vs. Recursion
Arrays
The Abstraction Power of Constants
The Data Abstraction Power of Creating New Data Types
Summary
Graphical Data Notation
Algorithmic Methods
Searches and Traversals
Divide and Conquer
Optimization Algorithms
Summary
Tools for Estimating Cost and Complexity
Measures of Performance
Analysis of work done
Performance and Data Structures
Reasonable vs. Unreasonable Algorithms
Summary
Tools for Verifying Correctness
Bugs and Debugging
Ambiguity
Language errors
Logic errors
Proving correctness
Verification
Summary
Tools for Behavioral Abstraction
The Object-Oriented Paradigm
The Benefits of the OO Approach
Achieving Superior Encapsulation
Achieving Superior Reusability
Achieving Superior Adaptability
Achieving Polymorphism
Everything is an Object
Summary
The Limits of Computing
Concurrency and Parallelism
Overview: Concurrency vs. Parallelism
Concurrency
Issues in Concurrency
Parallelism
Summary
Hierarchies of Complexity
The Complexity of Problems
Tractable vs. Intractable Problems
NP-Complete Problems
Oracles and Determinism
NP-Complete vs. Intractable Problems
Undecidability
Summary

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

×