ISBN-10:
0201314517
ISBN-13:
2900201314518
Pub. Date:
10/30/1997
Publisher:
Pearson
Introduction to Computing and Algorithms / Edition 1

Introduction to Computing and Algorithms / Edition 1

by Russel L Shackelford

Paperback

View All Available Formats & Editions
Current price is , Original price is $161.6. You
Select a Purchase Option (New Edition)
  • purchase options
    $40.98 $161.60 Save 75% Current price is $40.98, Original price is $161.6. You Save 74.64108910891089%.
    • Free return shipping at the end of the rental period details
    • Textbook Rentals in 3 Easy Steps  details
    icon-error
    Note: Access code and/or supplemental material are not guaranteed to be included with textbook rental or used textbook.
  • purchase options
    $141.40 $161.60 Save 12% Current price is $141.4, Original price is $161.6. You Save 12%.
  • purchase options
    $89.78 $161.60 Save 44% Current price is $89.78, Original price is $161.6. You Save 44%.
    icon-error
    Note: Access code and/or supplemental material are not guaranteed to be included with textbook rental or used textbook.

Product Details

ISBN-13: 2900201314518
Publisher: Pearson
Publication date: 10/30/1997
Edition description: New Edition
Pages: 399
Product dimensions: 6.00(w) x 1.25(h) x 9.00(d)

About the Author

Russell Shackelford is currently the Director of Lower Division Studies in The College of Computing at Georgia Tech. He holds various degrees in Computer Science, Education, and Psychology. His work is aimed at integrating research and practice concerning computing education, and at the development of computing tools and associated human methods for supporting education. Besides having a well-rounded education, Dr. Shackelford also loves baseball and occasionally can be found walking on the beach somewhere in Alabama.



0201314517AB04062001

Table of Contents

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

II. 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 Scopeof 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.

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

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews