Ship-Ship-Hooray! Free Shipping on $25+ Details >

Textbooks |
Buy Textbooks |
Computer Science & Technology Textbooks |
Introductory Computer Science Textbooks

Cover type: Paperback

Edition: 04

Copyright: 2004

Publisher: Brooks/Cole Publishing Co.

Published: 2004

International: No

Edition: 04

Copyright: 2004

Publisher: Brooks/Cole Publishing Co.

Published: 2004

International: No

List price: $199.75

All of our used books are 100% hand-inspected and guaranteed! Happy you, happy us.

FREE Shipping on $25+

Order $25 or more and the shipping's on us. Marketplace items and other exclusions apply.

Ships tomorrow

Order by noon CST (Mon-Fri, excluding holidays). Some restrictions apply.

Easy 30-Day Returns

Not the right book for you? We accept returns within 30 days of purchase. Access codes are non-refundable once revealed or redeemed.

Ships directly from us

You Save $194.75 (97%)

$5.00

Condition: Very Good
**100% Satisfaction Guarantee**

We hand-inspect every one of our used books.

We hand-inspect every one of our used books.

Well, that's no good. Unfortunately, this edition is currently out of stock. Please check back soon.

Also available in the Marketplace starting at $8.12

Price | Condition | Seller | Comments |
---|

This book provides students with the modern skills and concepts needed to be able to use the computer expressively in scientific work. The author takes an integrated approach by covering programming, important methods and techniques of scientific computation (graphics, the organization of data, data acquisition, numerical methods, etc.) and the organization of software. Balancing the best of the teach-a-package and teach-a-language approaches, the book teaches general-purpose language skills and concepts, and also takes advantage of existing package-like software so that realistic computations can be performed.

**Features **

- Uses MATLAB to illustrate concepts in working examples.
- Provides examples that range from text processing to the synthesis of false-color images to building user interfaces.
- Contains short projects of an open-ended nature in the later chapters. Integrating the various kinds of skills needed for scientific computation, the self-contained projects introduce diverse areas of science and technology but require no previous exposure to an area.
- Covers the basic material on programming in Chapters 1 through 9.
- Gives the necessary background and provides an introduction to simple but useful graphical interfaces in Chapters 10 and 11.
- Introduces numerical methods using one dimension in Chapter 16 and extends the concepts and methods to multiple dimensions in Chapter 17.

**Kaplan, Daniel :**

Daniel Kaplan is Associate Professor in the Department of Mathematics and Computer Science at Macalester College.

1. WHAT IS COMPUTATION?

Computation as Transformation.

Computation as Reaction to Events.

Algorithms.

From Algorithms to Software.

Exercises.

2. INVOKING A COMPUTATION.

Expressions and Commands.

Changing State: Assignment.

A Variety of Notations.

Parsing.

Exercises.

3. SIMPLE TYPES: NUMBERS, TEXT, BOOLEANS.

The Organization of Computer Memory.

Text.

Collections of Numbers and Plotting.

Booleans: True or False.

Logical Operators: Boolean Operators with Boolean Inputs.

Example: Measuring Information in Bits.

Exercises.

4. NUMBERS AND PRECISION.

The Precision of Computer Arithmetic.

Example: Global Positioning.

Exercises.

5. COLLECTIONS AND INDEXING.

Indexing.

Matrices.

Mixed Data Types.

Exercises.

6. FILES AND SCRIPTS.

Filenames.

File Operators.

Importing and Exporting Data.

Scripts.

Scripts as Computations.

Exercises.

Project: Time for a Cool Cup of Coffee.

7. FUNCTIONS.

Computations without Effects.

Creating Functions.

Functions as Arguments and Values.

Exercises.

8. CONDITIONALS.

The if Statement. More Than Two Cases.

Completeness and Exclusivity.

Switch/Case.

Advanced: Parallelization of Conditional Operators.

Exercises.

Project: The Morse Code.

9. LOOPS.

For Loops.

Accumulators.

Nested Loops.

Example: Optimal Matching with Nested Loops.

Element-by-Element Operators.

Outputs of Unknown Size.

Loop Termination.

Conditional Looping.

Example: Measuring Information II.

Dimensions and Arrays.

Exercises.

Project: Cellular Automata.

Project: The Mandelbrot Set.

10. SCOPE.

Environments and Scope.

The Debugger.

Shared Environments.

Scoping of Functions.

Pass by Reference. Exercises.

11. EVENTS.

Activating Input Devices.

Example: Recording the Times of Events.

Example: Exploring the Mandelbrot Set.

Inputs without Waiting.

Warnings and Errors.

Testing Functions.

Optional and Default Arguments.

Exercises.

12. ARRANGING DATA: SEARCHING AND DATABASES.

Datasets.

Selecting Subsets from Lists.

Efficient Searching for Matches.

Combining Lists: Union and Intersection.

Tables.

Simultaneous Collection and Access of Data.

Databases.

Exercises.

Project: A Bridge Database.

13. TREES AND RECURSION.

Simple Recursion.

Multiway Recursion.

Accumulators.

Example: Optimal Matching (Recursive).

Trees as Data Structures.

Processing Trees.

Example: Huffman Encoding of Information.

Exercises.

Project: Clustering of Data.

14. SOUNDS AND SIGNALS.

Basics of Computer Sound.

Perception and Generation of Sound.

Synthesizing Complex Sounds.

Transduction and Recording Sound.

Aliasing and the Sampling Frequency.

Exercises.

Project: The Perception of Beats.

Project: Speeding Up Sound.

15. IMAGES.

Black-and-White Images.

Color.

Digital Sampling of Images.

Sampling and Storing Images in Files.

Manipulating and Synthesizing Images.

Example: Mona Lisa's Missing Blue.

Exercises.

Project: Landsat Images and False-Color.

16. MATHEMATICAL RELATIONSHIPS WITH ONE UNKNOWN.

Representing Mathematical Relationships.

Zeroing in on Solutions.

Derivatives.

Going to the Extreme: Optimization.

Fitting.

Interpolation.

Exercises.

17. MATHEMATICAL RELATIONSHIPS WITH TWO OR MORE UNKNOWNS.

Visualizing Functions of Two Variables.

Geometry of Functions: The Gradient.

Optimization Using the Gradient.

Finding Solutions.

Solutions to Systems of Linear Equations.

Best Solutions to Linear Systems.

Solutions to Systems of Nonlinear Equations.

Exercises.

18. FROM EQUALITY TO SIMILARITY: RANDOMNESS AND VARIATION.

A Classification Problem.

Describing Distributions.

Processes and Distributions.

Why the Gaussian is Important.

Multiple Variables.

Example: Handwritten Digit Recognition.

Exercises.

Project: Sums of Gaussians and Segmentation of Images.

APPENDICES.

Color Plates.

ASCII Characters.

Computations on Vectors and Matrices.

shop us with confidence

Summary

This book provides students with the modern skills and concepts needed to be able to use the computer expressively in scientific work. The author takes an integrated approach by covering programming, important methods and techniques of scientific computation (graphics, the organization of data, data acquisition, numerical methods, etc.) and the organization of software. Balancing the best of the teach-a-package and teach-a-language approaches, the book teaches general-purpose language skills and concepts, and also takes advantage of existing package-like software so that realistic computations can be performed.

**Features **

- Uses MATLAB to illustrate concepts in working examples.
- Provides examples that range from text processing to the synthesis of false-color images to building user interfaces.
- Contains short projects of an open-ended nature in the later chapters. Integrating the various kinds of skills needed for scientific computation, the self-contained projects introduce diverse areas of science and technology but require no previous exposure to an area.
- Covers the basic material on programming in Chapters 1 through 9.
- Gives the necessary background and provides an introduction to simple but useful graphical interfaces in Chapters 10 and 11.
- Introduces numerical methods using one dimension in Chapter 16 and extends the concepts and methods to multiple dimensions in Chapter 17.

Author Bio

**Kaplan, Daniel :**

Daniel Kaplan is Associate Professor in the Department of Mathematics and Computer Science at Macalester College.

Table of Contents

1. WHAT IS COMPUTATION?

Computation as Transformation.

Computation as Reaction to Events.

Algorithms.

From Algorithms to Software.

Exercises.

2. INVOKING A COMPUTATION.

Expressions and Commands.

Changing State: Assignment.

A Variety of Notations.

Parsing.

Exercises.

3. SIMPLE TYPES: NUMBERS, TEXT, BOOLEANS.

The Organization of Computer Memory.

Text.

Collections of Numbers and Plotting.

Booleans: True or False.

Logical Operators: Boolean Operators with Boolean Inputs.

Example: Measuring Information in Bits.

Exercises.

4. NUMBERS AND PRECISION.

The Precision of Computer Arithmetic.

Example: Global Positioning.

Exercises.

5. COLLECTIONS AND INDEXING.

Indexing.

Matrices.

Mixed Data Types.

Exercises.

6. FILES AND SCRIPTS.

Filenames.

File Operators.

Importing and Exporting Data.

Scripts.

Scripts as Computations.

Exercises.

Project: Time for a Cool Cup of Coffee.

7. FUNCTIONS.

Computations without Effects.

Creating Functions.

Functions as Arguments and Values.

Exercises.

8. CONDITIONALS.

The if Statement. More Than Two Cases.

Completeness and Exclusivity.

Switch/Case.

Advanced: Parallelization of Conditional Operators.

Exercises.

Project: The Morse Code.

9. LOOPS.

For Loops.

Accumulators.

Nested Loops.

Example: Optimal Matching with Nested Loops.

Element-by-Element Operators.

Outputs of Unknown Size.

Loop Termination.

Conditional Looping.

Example: Measuring Information II.

Dimensions and Arrays.

Exercises.

Project: Cellular Automata.

Project: The Mandelbrot Set.

10. SCOPE.

Environments and Scope.

The Debugger.

Shared Environments.

Scoping of Functions.

Pass by Reference. Exercises.

11. EVENTS.

Activating Input Devices.

Example: Recording the Times of Events.

Example: Exploring the Mandelbrot Set.

Inputs without Waiting.

Warnings and Errors.

Testing Functions.

Optional and Default Arguments.

Exercises.

12. ARRANGING DATA: SEARCHING AND DATABASES.

Datasets.

Selecting Subsets from Lists.

Efficient Searching for Matches.

Combining Lists: Union and Intersection.

Tables.

Simultaneous Collection and Access of Data.

Databases.

Exercises.

Project: A Bridge Database.

13. TREES AND RECURSION.

Simple Recursion.

Multiway Recursion.

Accumulators.

Example: Optimal Matching (Recursive).

Trees as Data Structures.

Processing Trees.

Example: Huffman Encoding of Information.

Exercises.

Project: Clustering of Data.

14. SOUNDS AND SIGNALS.

Basics of Computer Sound.

Perception and Generation of Sound.

Synthesizing Complex Sounds.

Transduction and Recording Sound.

Aliasing and the Sampling Frequency.

Exercises.

Project: The Perception of Beats.

Project: Speeding Up Sound.

15. IMAGES.

Black-and-White Images.

Color.

Digital Sampling of Images.

Sampling and Storing Images in Files.

Manipulating and Synthesizing Images.

Example: Mona Lisa's Missing Blue.

Exercises.

Project: Landsat Images and False-Color.

16. MATHEMATICAL RELATIONSHIPS WITH ONE UNKNOWN.

Representing Mathematical Relationships.

Zeroing in on Solutions.

Derivatives.

Going to the Extreme: Optimization.

Fitting.

Interpolation.

Exercises.

17. MATHEMATICAL RELATIONSHIPS WITH TWO OR MORE UNKNOWNS.

Visualizing Functions of Two Variables.

Geometry of Functions: The Gradient.

Optimization Using the Gradient.

Finding Solutions.

Solutions to Systems of Linear Equations.

Best Solutions to Linear Systems.

Solutions to Systems of Nonlinear Equations.

Exercises.

18. FROM EQUALITY TO SIMILARITY: RANDOMNESS AND VARIATION.

A Classification Problem.

Describing Distributions.

Processes and Distributions.

Why the Gaussian is Important.

Multiple Variables.

Example: Handwritten Digit Recognition.

Exercises.

Project: Sums of Gaussians and Segmentation of Images.

APPENDICES.

Color Plates.

ASCII Characters.

Computations on Vectors and Matrices.

Publisher Info

Publisher: Brooks/Cole Publishing Co.

Published: 2004

International: No

Published: 2004

International: No

This book provides students with the modern skills and concepts needed to be able to use the computer expressively in scientific work. The author takes an integrated approach by covering programming, important methods and techniques of scientific computation (graphics, the organization of data, data acquisition, numerical methods, etc.) and the organization of software. Balancing the best of the teach-a-package and teach-a-language approaches, the book teaches general-purpose language skills and concepts, and also takes advantage of existing package-like software so that realistic computations can be performed.

**Features **

- Uses MATLAB to illustrate concepts in working examples.
- Provides examples that range from text processing to the synthesis of false-color images to building user interfaces.
- Contains short projects of an open-ended nature in the later chapters. Integrating the various kinds of skills needed for scientific computation, the self-contained projects introduce diverse areas of science and technology but require no previous exposure to an area.
- Covers the basic material on programming in Chapters 1 through 9.
- Gives the necessary background and provides an introduction to simple but useful graphical interfaces in Chapters 10 and 11.
- Introduces numerical methods using one dimension in Chapter 16 and extends the concepts and methods to multiple dimensions in Chapter 17.

**Kaplan, Daniel :**

Daniel Kaplan is Associate Professor in the Department of Mathematics and Computer Science at Macalester College.

1. WHAT IS COMPUTATION?

Computation as Transformation.

Computation as Reaction to Events.

Algorithms.

From Algorithms to Software.

Exercises.

2. INVOKING A COMPUTATION.

Expressions and Commands.

Changing State: Assignment.

A Variety of Notations.

Parsing.

Exercises.

3. SIMPLE TYPES: NUMBERS, TEXT, BOOLEANS.

The Organization of Computer Memory.

Text.

Collections of Numbers and Plotting.

Booleans: True or False.

Logical Operators: Boolean Operators with Boolean Inputs.

Example: Measuring Information in Bits.

Exercises.

4. NUMBERS AND PRECISION.

The Precision of Computer Arithmetic.

Example: Global Positioning.

Exercises.

5. COLLECTIONS AND INDEXING.

Indexing.

Matrices.

Mixed Data Types.

Exercises.

6. FILES AND SCRIPTS.

Filenames.

File Operators.

Importing and Exporting Data.

Scripts.

Scripts as Computations.

Exercises.

Project: Time for a Cool Cup of Coffee.

7. FUNCTIONS.

Computations without Effects.

Creating Functions.

Functions as Arguments and Values.

Exercises.

8. CONDITIONALS.

The if Statement. More Than Two Cases.

Completeness and Exclusivity.

Switch/Case.

Advanced: Parallelization of Conditional Operators.

Exercises.

Project: The Morse Code.

9. LOOPS.

For Loops.

Accumulators.

Nested Loops.

Example: Optimal Matching with Nested Loops.

Element-by-Element Operators.

Outputs of Unknown Size.

Loop Termination.

Conditional Looping.

Example: Measuring Information II.

Dimensions and Arrays.

Exercises.

Project: Cellular Automata.

Project: The Mandelbrot Set.

10. SCOPE.

Environments and Scope.

The Debugger.

Shared Environments.

Scoping of Functions.

Pass by Reference. Exercises.

11. EVENTS.

Activating Input Devices.

Example: Recording the Times of Events.

Example: Exploring the Mandelbrot Set.

Inputs without Waiting.

Warnings and Errors.

Testing Functions.

Optional and Default Arguments.

Exercises.

12. ARRANGING DATA: SEARCHING AND DATABASES.

Datasets.

Selecting Subsets from Lists.

Efficient Searching for Matches.

Combining Lists: Union and Intersection.

Tables.

Simultaneous Collection and Access of Data.

Databases.

Exercises.

Project: A Bridge Database.

13. TREES AND RECURSION.

Simple Recursion.

Multiway Recursion.

Accumulators.

Example: Optimal Matching (Recursive).

Trees as Data Structures.

Processing Trees.

Example: Huffman Encoding of Information.

Exercises.

Project: Clustering of Data.

14. SOUNDS AND SIGNALS.

Basics of Computer Sound.

Perception and Generation of Sound.

Synthesizing Complex Sounds.

Transduction and Recording Sound.

Aliasing and the Sampling Frequency.

Exercises.

Project: The Perception of Beats.

Project: Speeding Up Sound.

15. IMAGES.

Black-and-White Images.

Color.

Digital Sampling of Images.

Sampling and Storing Images in Files.

Manipulating and Synthesizing Images.

Example: Mona Lisa's Missing Blue.

Exercises.

Project: Landsat Images and False-Color.

16. MATHEMATICAL RELATIONSHIPS WITH ONE UNKNOWN.

Representing Mathematical Relationships.

Zeroing in on Solutions.

Derivatives.

Going to the Extreme: Optimization.

Fitting.

Interpolation.

Exercises.

17. MATHEMATICAL RELATIONSHIPS WITH TWO OR MORE UNKNOWNS.

Visualizing Functions of Two Variables.

Geometry of Functions: The Gradient.

Optimization Using the Gradient.

Finding Solutions.

Solutions to Systems of Linear Equations.

Best Solutions to Linear Systems.

Solutions to Systems of Nonlinear Equations.

Exercises.

18. FROM EQUALITY TO SIMILARITY: RANDOMNESS AND VARIATION.

A Classification Problem.

Describing Distributions.

Processes and Distributions.

Why the Gaussian is Important.

Multiple Variables.

Example: Handwritten Digit Recognition.

Exercises.

Project: Sums of Gaussians and Segmentation of Images.

APPENDICES.

Color Plates.

ASCII Characters.

Computations on Vectors and Matrices.