Algorithms and Data Structures: Design, Correctness, Analysis (2nd Edition) (Paperback)

by Jeffrey H. Kingston (Author)

Editorial Reviews

Product Description
Provides an in-depth treatment of the central algorithms and data structures of computer science and an introduction to the techniques of design, correctness, and analysis required for understanding them. Covers major applications such as lists, trees, sorting and disjoint sets. Paper.

From the Back Cover
Features

• Consistent use of state-of-the-art techniques throughout, including object-oriented programming
• Topics have been carefully selected to ensure that they are of real practical importance and presented in a logical sequence
• Features complete and carefully tested Eiffel implementations with many attractive examples, diagrams and exercises.

0201403749B04062001

See all Editorial Reviews

Product Details

• Paperback: 380 pages
• Publisher: Addison Wesley Publishing Company; 2 Sub edition (November 1997)
• Language: English
• ISBN-10: 0201403749
• ISBN-13: 978-0201403749
• Product Dimensions: 9.2 x 6.2 x 0.9 inches
• Shipping Weight: 1.3 pounds
• Average Customer Review: 4.0 out of 5 stars See all reviews (1 customer review)
• Amazon.com Sales Rank: #1,269,648 in Books (See Bestsellers in Books)

  Popular in this category: (What's this?)

  #91 in

  Books > Computers & Internet > Programming > Algorithms > Data Structures

Customer Reviews

Most Helpful Customer Reviews

2 of 8 people found the following review helpful:

4.0 out of 5 stars Advance, Useful, Helpful, November 22, 1998

By A Customer

If you are a computer science student or advance programmer, you should get this book. The diagrams and descriptions in the book give you insights of the advance programming which would help you. However you may get confused because the examples in the book is using the programming language Eiffel. You would like this book if and only if you like hard coding.