Explorations in Computing: An Introduction to Computer Science / Edition 1

Hardcover (Print)
Buy Used
Buy Used from BN.com
$53.51
(Save 36%)
Item is in good condition but packaging may have signs of shelf wear/aging or torn packaging.
Condition: Used – Good details
Used and New from Other Sellers
Used and New from Other Sellers
from $8.84
Usually ships in 1-2 business days
(Save 89%)
Other sellers (Hardcover)
  • All (15) from $8.84   
  • New (5) from $50.37   
  • Used (10) from $8.82   

Overview

Based on the author’s introductory course at the University of Oregon, Explorations in Computing: An Introduction to Computer Science focuses on the fundamental idea of computation and offers insight into how computation is used to solve a variety of interesting and important real-world problems. Taking an active learning approach, the text encourages students to explore computing ideas by running programs and testing them on different inputs. It also features illustrations by Phil Foglio, winner of the 2009 and 2010 Hugo Award for Best Graphic Novel.

Classroom-Tested Material
The first four chapters introduce key concepts, such as algorithms and scalability, and hone practical lab skills for creating and using objects. In the remaining chapters, the author covers "divide and conquer" as a problem solving strategy, the role of data structures, issues related to encoding data, computer architecture, random numbers, challenges for natural language processing, computer simulation, and genetic algorithms. Through a series of interactive projects in each chapter, students can experiment with one or more algorithms that illustrate the main topic. Requiring no prior experience with programming, these projects show students how algorithms provide computational solutions to real-world problems.

Web Resource
The book’s website at www.cs.uoregon.edu/eic presents numerous ancillaries. The lab manual offers step-by-step instructions for installing Ruby and the RubyLabs gem with Windows XP, Mac OS X, and Linux. The manual includes tips for editing programs and running commands in a terminal emulator. The site also provides online documentation of all the modules in the RubyLabs gem. Once the gem is installed, the documentation can be read locally by a web browser.

After working through the in-depth examples in this textbook, students will gain a better overall understanding of what computer science is about and how computer scientists think about problems.

Read More Show Less

Editorial Reviews

From the Publisher
This entry-level computer science textbook is intended for use in an introductory course for computer science majors or non-majors desiring an overview of the basic concepts and processes of computer programming. … Each chapter contains illustrations and code examples as well as a tutorial project that walks the student step-by-step through a task-related programming activity. Access to online resources, including a lab manual and links to the latest version of the open source Ruby software, is provided.
SciTech Book News, February 2011
Read More Show Less

Product Details

Meet the Author

John S. Conery is a professor in the Department of Computer and Information Science at the University of Oregon. With over 30 years of teaching experience, he has taught courses on high performance computing and scientific computing in addition to introductory computer science courses. A member of the University's Center for Ecology and Evolutionary Biology, Dr. Conery has worked with biologists on a variety of problems related to gene and genome duplication, artificial neural networks, and population modeling. His current research interests are computational biology and bioinformatics.

Read More Show Less

Table of Contents

Introduction
Computation
The Limits of Computation
Algorithms
A Laboratory for Computational Experiments

The Ruby Workbench
Introducing Ruby and the RubyLabs environment for computational experiments
Interactive Ruby
Numbers
Variables
Methods
RubyLabs

The Sieve of Eratosthenes
An algorithm for finding prime numbers
The Sieve Algorithm
The mod Operator
Containers
Iterators
Boolean Values and the delete if Method
Exploring the Algorithm
The sieve Method
A Better Sieve
Experiments with the Sieve

A Journey of a Thousand Miles
Iteration as a strategy for solving computational problems
Searching and Sorting
The Linear Search Algorithm
The Insertion Sort Algorithm
Scalability
Best Case, Worst Case

Divide and Conquer
A new strategy: breaking large problems into smaller subproblems
Binary Search
Binary Search Experiments
Merge Sort
Merge Sort Experiments
Recursive Methods

When Words Collide
Organizing data for more efficient problem solving
Word Lists
Hash Tables
The mod Function Again
Collisions
Hash Table Experiments

Bit by Bit
Binary codes and algorithms for text compression and error correction
Binary Codes
Codes for Characters
Parity Bits
Huffman Trees
Huffman Codes

The War of the Words
An introduction to computer architecture and assembly language programming
Hello, MARS
The Temperature on MARS
Corewar
Self-Referential Code
Clones

Now for Something Completely Different
An algorithm for generating random numbers
Pseudorandom Numbers
Numbers on Demand
Games with Random Numbers
Random Shuffles
Tests of Randomness

Ask Dr. Ruby
A program that understands English (or does it?)
Overview of ELIZA
Sentence Patterns
Building Responses from Parts of Sentences
Substitutions
An Algorithm for Having a Conversation
Writing Scripts for ELIZA
ELIZA and the Turing Test

The Music of the Spheres
Computer simulation and the N-body problem
Running around in Circles
The Force of Gravity
Force Vectors
N-Body Simulation of the Solar System

The Traveling Salesman
A genetic algorithm for a computationally demanding problem
Maps and Tours
Exhaustive Search
Random Search
Point Mutations
The Genetic Algorithm
Crossovers

Appendix A: Answers to Selected Exercises
Appendix B: Ruby Reference

Read More Show Less

Customer Reviews

Average Rating 5
( 1 )
Rating Distribution

5 Star

(1)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
Sort by: Showing 1 Customer Reviews
  • Anonymous

    Posted May 28, 2013

    WOW... I love MyDeals247 model - they create competition among t

    WOW... I love MyDeals247 model - they create competition among the sellers real-time.

    Was this review helpful? Yes  No   Report this review
Sort by: Showing 1 Customer Reviews

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?
Comments (optional)