The.Algorithm.Design.Manual.Springer-Verlag.1998

The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998

18.04.2013 Views

About the Book -- The Algorithm Design Manual problem doesn't appear in this book. Equally important is what we do not do in this book. We do not stress the mathematical analysis of algorithms, leaving most of the analysis as informal arguments. You will not find a single theorem anywhere in this book. But what is a manual without software? This book comes with a substantial electronic supplement, a ISO- 9660 compatible, multiplatform CD-ROM, which can be viewed using Netscape, Microsoft Explorer, or any other WWW browser. This CD-ROM contains: ● A complete hypertext version of the full printed book. Indeed, the extensive cross-references within the text are best followed using the hypertext version. ● The source code and URLs for all cited implementations, mirroring the Algorithm Repository WWW site. Programs in C, C++, Fortran, and Pascal are included, providing an average of four different implementations for each algorithmic problem. ● Over 30 hours of audio lectures on the design and analysis of algorithms are provided, all keyed to on-line lecture notes. Following these lectures provides another approach to learning algorithm design techniques. Together, this book covers material sufficient for a standard Introduction to Algorithms course. Its assumes the reader has completed the equivalent of a second programming course, typically titled Data Structures or Computer Science II . Special textbook oriented-features include: ● In addition to standard pen-and-paper exercises, this book includes ``implementation challenges'' suitable for teams or individual students. These projects and the applied focus of the text can be used to provide a new laboratory focus to the traditional algorithms course. ● ``Take-home lessons'' at the beginning of each chapter emphasize the concepts to be gained from the chapter. ● This book stresses design over analysis. It is suitable for both traditional lecture courses, and the new ``active learning'' method, where the professor does not lecture instead guides student groups to solve real problems. The ``war stories'' provide a great introduction to the active learning method. ● A full set of lecture slides for teaching this course is available on the CD-ROM, keyed to unique on-line audio lectures covering a full semester algorithm course. ``I have no doubt that it will become a classic the day it is published. It has all the right ingredients: rich contents, friendly, personal language, subtle humor, the right references, and a plethora of pointers to resources.'' -- P. Takis Metaxas, Wellesley College. ``A major theme that runs through the book is that the most important technique to solve an algorithmic problem from the real world is to learn how to model the problem well. I did not believe this before; the file:///E|/WEBSITE/INFO/FORM.HTM (2 of 3) [19/1/2003 1:36:48]

About the Book -- The Algorithm Design Manual book did an admirable job of convincing me that there is considerable truth in it.'' -- Giri Narasimhan, The University of Memphis. ``The questions on problem solving are good enough that they ought to be talked about in every programming class in the undergraduate curriculum.'' -- Ron Danielson, Santa Clara University. Check out the preface and table of contents for more information. You may order this book, and are encouraged to do so. You might also be interested in my previous book, Implementing Discrete Mathematics . Please leave your name and address to receive additional information about the book and notification of significant upgrades to this site when they occur. If your WWW client does not support forms, please send an e-mail to algorith@cs.sunysb.edu with your name, e-mail address, and mailing address for further information. First Name: Last Name : E-mail : Company Name : Number and Street : City : State : Zip : Phone : Return to the home page If you have problems with this page, please send E-mail to: algorith@cs.sunysb.edu file:///E|/WEBSITE/INFO/FORM.HTM (3 of 3) [19/1/2003 1:36:48]

About the Book -- <strong>The</strong> <strong>Algorithm</strong> <strong>Design</strong> <strong>Manual</strong><br />

problem doesn't appear in this book.<br />

Equally important is what we do not do in this book. We do not stress the mathematical analysis of<br />

algorithms, leaving most of the analysis as informal arguments. You will not find a single theorem<br />

anywhere in this book.<br />

But what is a manual without software? This book comes with a substantial electronic supplement, a ISO-<br />

9660 compatible, multiplatform CD-ROM, which can be viewed using Netscape, Microsoft Explorer, or<br />

any other WWW browser. This CD-ROM contains:<br />

● A complete hypertext version of the full printed book. Indeed, the extensive cross-references<br />

within the text are best followed using the hypertext version.<br />

● <strong>The</strong> source code and URLs for all cited implementations, mirroring the <strong>Algorithm</strong> Repository<br />

WWW site. Programs in C, C++, Fortran, and Pascal are included, providing an average of four<br />

different implementations for each algorithmic problem.<br />

● Over 30 hours of audio lectures on the design and analysis of algorithms are provided, all keyed to<br />

on-line lecture notes. Following these lectures provides another approach to learning algorithm<br />

design techniques.<br />

Together, this book covers material sufficient for a standard Introduction to <strong>Algorithm</strong>s course. Its<br />

assumes the reader has completed the equivalent of a second programming course, typically titled Data<br />

Structures or Computer Science II . Special textbook oriented-features include:<br />

● In addition to standard pen-and-paper exercises, this book includes ``implementation challenges''<br />

suitable for teams or individual students. <strong>The</strong>se projects and the applied focus of the text can be<br />

used to provide a new laboratory focus to the traditional algorithms course.<br />

● ``Take-home lessons'' at the beginning of each chapter emphasize the concepts to be gained from<br />

the chapter.<br />

● This book stresses design over analysis. It is suitable for both traditional lecture courses, and the<br />

new ``active learning'' method, where the professor does not lecture instead guides student groups<br />

to solve real problems. <strong>The</strong> ``war stories'' provide a great introduction to the active learning<br />

method.<br />

● A full set of lecture slides for teaching this course is available on the CD-ROM, keyed to unique<br />

on-line audio lectures covering a full semester algorithm course.<br />

``I have no doubt that it will become a classic the day it is published. It has all the right ingredients: rich<br />

contents, friendly, personal language, subtle humor, the right references, and a plethora of pointers to<br />

resources.''<br />

-- P. Takis Metaxas, Wellesley College.<br />

``A major theme that runs through the book is that the most important technique to solve an algorithmic<br />

problem from the real world is to learn how to model the problem well. I did not believe this before; the<br />

file:///E|/WEBSITE/INFO/FORM.HTM (2 of 3) [19/1/2003 1:36:48]

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!