Fundamentals of data structures (Computer software engineering series) [Hardcover]

Ellis Horowitz (Author)

Product Details

• Hardcover: 564 pages
• Publisher: Computer Science Press (1976)
• Language: English
• ISBN-10: 091489420X
• ISBN-13: 978-0914894209
• Product Dimensions: 9.1 x 6.2 x 1.5 inches
• Shipping Weight: 1.8 pounds
• Average Customer Review: 3.0 out of 5 stars  See all reviews (3 customer reviews)
• Amazon Best Sellers Rank: #1,654,671 in Books (See Top 100 in Books)

Customer Reviews

Most Helpful Customer Reviews

1 of 1 people found the following review helpful:

4.0 out of 5 stars I used this book in college..., March 12, 2001

By 

John Keating (Santa Monica, CA USA) - See all my reviews

This review is from: Fundamentals of Data Structures (Hardcover)

It was the main textbook in one of my CS courses and I thought it was great. In fact, over the years, just about every company I've worked has had a copy lying around for reference. I think that says a lot.

4.0 out of 5 stars One of the best, January 14, 2006

By 

Abhishek Singh "Abhishek" (NY, USA) - See all my reviews

This review is from: Fundamentals of Data Structures (Hardcover)

This is a classic, I had this in my BS and ever after. Though a bit cryptic in the beginning but as you read on you start getting the grip on the subject. I have kept this for over 8 years now and always keep going back to it.

The Key to read it is to have patience.

2 of 4 people found the following review helpful:

1.0 out of 5 stars A dull, difficult read, August 4, 2000

By 

Ranjith Nair (Evanston, IL) - See all my reviews
(REAL NAME)   

This review is from: Fundamentals of Data Structures (Hardcover)

This book was the prescribed textbook for my data structures course. Reading it, however, was a very unpleasant experience. I found most of the discussions long, digressive and pedantic and of a nature that made you wonder after reading two pages what it was that the author started out to say in the first place. However, one plus point is that the algorithms are written in a simple enough pseudocode, and not in C or Pascal. But even so, the algorithms tend to be like the text - too notation-intensive and very difficult to follow. For example, the author, pedantically, wants to write an iterative version of the Inorder tree traversal algorithm - and succeeds after 3 ugly tries. A display that is hardly useful or enjoyable, especially for the beginning student. More mentally exhausting and undecipherable algorithms are found in the chapter on internal sorting. The level of the exercises is way too high, especially since the text does not cover fundamentals well. My advice to people starting to learn data structures would be to stay away from this book. I sincerely hope that there are other books that one can learn data structures from.