Introduction to Computing and Algorithms [Paperback]

Russel L Shackelford (Author)

Book Description

ISBN-10: 0201314517 | ISBN-13: 978-0201314519 | Publication Date: October 26, 1997 | Edition: 1

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.

Editorial Reviews

From the Back Cover

Introduction to Computing and Algorithms prepares students for the world of computing by giving them a solid foundation in the study of computer science--algorithms. By taking an algorithm-based approach to the subject, this new introductory text helps students grasp overall concepts, rather than getting them bogged down with specific syntax details of a programming language that can become obsolete. Students work with algorithms from the start and apply these ideas to real problems that computers can help solve. The benefit of this approach is that students will understand the power of computers as problem-solving tools, learn to think like programmers and gain an appreication of the computer science discipline.

Features

• Introduces basic computing ideas, including essential algorithm constructs, software engineering, and certain foundational aspects of theory, tailored to students at a beginning level.
• Using a "Java-like" pseudo-code, this text prepares students for learning how to program with an object-oriented language.
• Provides a comprehensive lab manaual that introduces students to various software applications that they will use throughout their careers.
• Reinforces key concepts with pedagogical features like "Food for Thought" sections and boxed definitions.

0201314517B04062001

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

Product Details

• Paperback: 399 pages
• Publisher: Addison Wesley; 1 edition (October 26, 1997)
• Language: English
• ISBN-10: 0201314517
• ISBN-13: 978-0201314519
• Product Dimensions: 9.2 x 7.5 x 0.9 inches
• Shipping Weight: 1.6 pounds (View shipping rates and policies)
• Average Customer Review: 4.5 out of 5 stars  See all reviews (12 customer reviews)
• Amazon Best Sellers Rank: #718,366 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

12 of 13 people found the following review helpful:

5.0 out of 5 stars An excellent introduction into algorithmic concepts., April 13, 1999

By 

G P (Seattle, WA United States) - See all my reviews

This review is from: Introduction to Computing and Algorithms (Paperback)

As a teaching assistant for CS1501, Introduction to Computing at Georgia Tech, a successful brain-child of Dr. Shackelford's, I have used this book from both a student's and a teacher's standpoint, and thus feel adept at highlighting its successes.

This book provides a concise, clear review of the basic concepts of algorithmic thought and its subsequent expression and application. After a brief review of the history of computing, the reader is launched into an ever-deepening understanding of basic CS tools from a problem-solving point of view.

Topics of interest include dynamic data structures (BST's, linked lists), array storage, stacks + queues, object-oriented programming, precedence and dependence, and a brief sojourn into higher-level theory concepts.

The highlight, and in my opinion success, of this book is the fact that no "real" programming language is used to notate any examples. Rather, Dr. Shackelford, along with other TA's of recent past, devised a pseudo-language which encapsulates many elements of previous educational languages (such as Pascal); naturally, this language is not vulnerable to obsolescence. Also, since this language can not be practically compiled, the reader is forced to trace through examples on his or her own, building his or her skills in mentally evaluating algorithms.

This book, once limited to the Georgia Tech CS curriculum, has now expanded to many other colleges and universities, and more institutions are becoming interested as the months progress. This text is a must-have for any individual interested in getting a substantial taste in algorithms and computing.

8 of 8 people found the following review helpful:

5.0 out of 5 stars Not a teacher, or even a college student, December 13, 2001

By 

Adina Reeve - See all my reviews

This review is from: Introduction to Computing and Algorithms (Paperback)

I've been a professional computer programmer for the last seven years, with no formal training. I bought this book to begin improving my grasp of computer theory as well as practice. I've found this book to be eminantly readable, an actual page turner. Parts of it are quite elementary, but it's very good at explaining "why" as well as "what".

I consider the pseudo-code an advantage, since it forces me to look at unfamiliar terms and structures and equate them with the equivalent items in my "real" language. It teaches *theory*, which I can apply to any language, not implementation in a single language that will be obsolete in a year or two.

7 of 7 people found the following review helpful:

5.0 out of 5 stars Read this book and rule the galaxy (well, not quite but....), April 12, 1999

By 

[e-mail] (lost in space) - See all my reviews

This review is from: Introduction to Computing and Algorithms (Paperback)

I can only copy the other two reviewers. This book makes for an excellent....no, an awesome introduction into computing, algorithms and data structures (even OOP fundamentals are covered).

While this book is a textbook for computer science students it's neither dry to read nor hard to understand. There are several amusing or eye-opening anecdotes plus an excellent history section of how the alphabet developed (and with it book printing, etc.) and how programming influences our way of thinking.

On the technical side this book is the first I read that explained the inner workings of recursive functions in such a simple way that I wondered why there's so much mystery around recursion. Not to mention all the other things like ADTs, BSTs, debugging and so on.

Although this book uses pseudo-code for its explanations and exercises don't think of this as a disadvantage. In fact, it makes things easier to follow and makes for good exercises to convert the pseudo-code to real code to whatever language you're using.

Anyone who's programming should have read this book. Anyone who's going to learn programming MUST read this book (well, to be honest, you do not need to, but don't come crying if, after years, you read it and find out how much easier it would have been....).

So I give this book 5 Million stars, a hug and a big smile :)))