Image from Google Jackets

The Algorithm Design Manual / Steven S. Skiena.

By: Material type: TextTextPublication details: Santa Clara, CA : TELOS--the Electronic Library of Science, c1998.Description: xvi, 486 p. : ill. ; 25 cm. + 1 computer laser optical disc (4 3/4 in.)ISBN:
  • 0387948600 (hardcover : alk. paper)
Subject(s): LOC classification:
  • QA76.9.A43 S55 1998
Online resources:
Incomplete contents:
Part I: Techniques 1) Introduction to Algorithms; 2) Data Structures and Sorting; 3) Breaking Problems Down; 4) Graph Algorithms; 5) Combinatorial Search and Heuristic Methods; 6) Intractable Problems and Approximations; 7) How to Design Algorithms Part II: Resources 8) A Catalog of Algorithmic Problems; 9) Algorithmic Resources
Summary: This material has been developed over a period of several years in an upper-division course taught to computer science students at SUNY, Stony Brook, by Steve Skiena. A major goal of the author has been to take some of the mystery out of identifying and dealing with algorithms which these students will later use in the workplace, drawing heavily on the author's own real-world experiences, the book stressing design and analysis. Thus the work takes on a very practical character, as reflected in its title: Manual. The Book is divided into two parts, the first being a general guide to techniques for the design and analysis of computer algorithms. The second is a reference section, comprising the catalog of algorithmic resources, implementations, and an extensive bibliography. The primary audience for this book/CD-ROM combination is the working professional who uses algorithms on a daily basis and has need for a handy reference.A major feature of this book is the inclusion of a complete catalog of important algorithmic problems.By browsing this catalog, readers can quickly identify what the problem they have encountered is called, what is known about it, and how they should proceed if they need to solve it. Nothing like this catalog exists in the computing literature for general computer algorithms. This work can also readily be used as a course supplement or adjunct text in standard courses on algorithm design, or simply as a student reference guide, as the author puts it. Pedagogic features include pen-and-paper exercises, team projects, independent student projects, take home lessons (goals) at the beginning of chapters. Other teaching and learning aids reside on the accompanying CD-ROM.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Copy number Status Notes Barcode
Books Library First Floor QA76.9.A43 S55 1998 (Browse shelf(Opens below)) 1 Available +CD 3020
CD's Library Ground Floor QA76.9.A43 S55 1998 (Browse shelf(Opens below)) 1 Available 00027459
Books Library First Floor QA76.9.A43 S55 1998 (Browse shelf(Opens below)) 2 Available 27459

Includes bibliographical references (p. [439]-462) and index.

Part I: Techniques 1) Introduction to Algorithms; 2) Data Structures and Sorting; 3) Breaking Problems Down; 4) Graph Algorithms; 5) Combinatorial Search and Heuristic Methods; 6) Intractable Problems and Approximations; 7) How to Design Algorithms Part II: Resources 8) A Catalog of Algorithmic Problems; 9) Algorithmic Resources

This material has been developed over a period of several years in an upper-division course taught to computer science students at SUNY, Stony Brook, by Steve Skiena. A major goal of the author has been to take some of the mystery out of identifying and dealing with algorithms which these students will later use in the workplace, drawing heavily on the author's own real-world experiences, the book stressing design and analysis. Thus the work takes on a very practical character, as reflected in its title: Manual. The Book is divided into two parts, the first being a general guide to techniques for the design and analysis of computer algorithms. The second is a reference section, comprising the catalog of algorithmic resources, implementations, and an extensive bibliography. The primary audience for this book/CD-ROM combination is the working professional who uses algorithms on a daily basis and has need for a handy reference.A major feature of this book is the inclusion of a complete catalog of important algorithmic problems.By browsing this catalog, readers can quickly identify what the problem they have encountered is called, what is known about it, and how they should proceed if they need to solve it. Nothing like this catalog exists in the computing literature for general computer algorithms. This work can also readily be used as a course supplement or adjunct text in standard courses on algorithm design, or simply as a student reference guide, as the author puts it. Pedagogic features include pen-and-paper exercises, team projects, independent student projects, take home lessons (goals) at the beginning of chapters. Other teaching and learning aids reside on the accompanying CD-ROM.

There are no comments on this title.

to post a comment.
New Arrivals

Loading...

Contact Us

Library: Location maps

Phone: 00968 2323 7091 Email: Ask us a question

Library Hours

Sunday - Thursday 7:30AM - 8:00 PM

Friday - Saturday Closed