Start reading Data Structures and Algorithms Using C# on your Kindle in under a minute. Don't have a Kindle? Get your Kindle here.

Deliver to your Kindle or other device

 
 
 

Try it free

Sample the beginning of this book for free

Deliver to your Kindle or other device

Read books on your computer or other mobile devices with our FREE Kindle Reading Apps.
Data Structures and Algorithms Using C#
 
 
Share your own customer images

Data Structures and Algorithms Using C# [Kindle Edition]

Michael McMillan (Author)
1.0 out of 5 stars  See all reviews (1 customer review) |
Print List Price: £29.99
Kindle Price: £19.79 includes VAT* & free wireless delivery via Amazon Whispernet
You Save: £10.20 (34%)
Unlike print books, digital books are subject to VAT.

Formats

 Amazon Price New from Used from
Kindle Edition £19.79   -- --
Hardcover £58.65   -- --
Paperback £26.39   -- --

Customers Who Viewed This Item Also Viewed

Product Description

Review

"An excellent, thoroughly enjoyable work on introductory and intermediate data structures for the increasingly popular C# programming language.... This book is valuable for any data structures course." -- M Connell, SUNY College at Cortland, CHOICE

Product Description

C# programmers: no more translating data structures from C++ or Java to use in your programs! Mike McMillan provides a tutorial on how to use data structures and algorithms plus the first comprehensive reference for C# implementation of data structures and algorithms found in the .NET Framework library, as well as those developed by the programmer. The approach is very practical, using timing tests rather than Big O notation to analyze the efficiency of an approach. Coverage includes arrays and array lists, linked lists, hash tables, dictionaries, trees, graphs, and sorting and searching algorithms, as well as more advanced algorithms such as probabilistic algorithms and dynamic programming. This is the perfect resource for C# professionals and students alike.
See all Product Description

Product details

  • Format: Kindle Edition
  • File Size: 3301 KB
  • Print Length: 366 pages
  • Page Numbers Source ISBN: 0521876915
  • Publisher: Cambridge University Press; 1 edition (26 Mar 2007)
  • Sold by: Amazon Media EU S.à r.l.
  • Language English
  • ASIN: B001APPGIA
  • Text-to-Speech: Enabled
  • Average Customer Review: 1.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Bestsellers Rank: #306,957 Paid in Kindle Store (See Top 100 Paid in Kindle Store)

    •  Would you like to give feedback on images?

More About the Author

Michael McMillan
Discover books, learn about writers, and more.

› Visit Amazon's Michael McMillan Page

Tag this product

 (What's this?)
Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organise and find favourite items.
Your tags: Add your first tag
 
See most popular tags

Customer Reviews

5 star
0
4 star
0
3 star
0
2 star
0
Most Helpful Customer Reviews
8 of 8 people found the following review helpful
Format:Paperback
I found this lying on a colleague's desk and had a flick through; I didn't read much to be honest but what I did see was enough of a warning to make me write this: DO NOT BUY THIS BOOK.

There are things like a Queue class implemented using an ArrayList as a backing store "because of its dynamic properties". I can only assume he means amortized doubling here. The book boasts about "not using big-O notation" which is a damn good job because the dequeue method is implemented using RemoveAt(0) giving O(n) performance in all cases, when with a circular buffer an O(1) implementation can be trivially achieved (except in the case when the buffer is full, of course).

The next structure is a priority queue. You might imagine this would be done with some sort of heap; a binary heap in an array being the typical implementation. Instead it's also done with an ArrayList and every time an item is added it copies the items into an array, sorts them, and then puts them back into the ArrayList. The same goes for dequeue. So while you could find an implementation of O(lg n) performance for both enqueue and dequeue on wikipedia, he goes for O(n) in both cases.

I was so appalled, and so angry that somebody with clearly no knowledge of data structures was allowed to publish this rubbish, that I didn't read any more. Neither should you. If I could give it minus 5 I would.
Comment | 
Was this review helpful to you?
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com:  25 reviews
15 of 15 people found the following review helpful
Too many errors and omissions to be a great book 30 Sep 2007
By S. R. Galloway - Published on Amazon.com
Format:Paperback
This book had the potential to be great but missed it's mark. The number of coding and textual errors is just too great for a book of this type. In addition, the coverage of the 'primitive' array and ArrayList items is, I feel incomplete...they're used a whole lot but how they're actually implemented isn't even touched upon (yes, they're language features...but it'd be nice to get some sort of insight here!).
I had such high hopes for this book; one which was missing from the C# armoury and essential to those of us who don't have a conventional Comp Sci background. This book just doesn't cut it...a second edition with better coverage and VASTLY better editing is needed.
Reading more, wish I could change my rating to 1 star (Amazon doesn't seem to allow this...). This is just an insulting book for the price...the number of errors and inaccuracies is remarkable...don't buy this!
15 of 17 people found the following review helpful
Disappointing :-( 12 Jun 2007
By S. R. Moody - Published on Amazon.com
Format:Paperback
About half way through the book, and I am sadly disapointed and am beginning to wish I hadn't purchased this book. The examples printed in the book are grossly incorrect, variables used in the examples where something entirely different is referred to in the text, syntactically incorrect variables in a lot of the examples, and figures are even in consistent. I looked through the pages for an author email addy or someplace to go for eratta, but could find no such thing. I will keep reading through this but its costing me more work trying to figure out what the author really meant then the amount of information I am getting back in return... they really should have proof read this one a little better... my recommendation... do not buy it, or at least until they have fixed the errors.
11 of 12 people found the following review helpful
Are the errors kind of tricks to find the bugs? 30 Jan 2008
By Marco Dorantes - Published on Amazon.com
Format:Paperback
I looked at the book for author's email address: None.
I looked at the Cambridge book site for kind of feedback form: None.
I wonder. Is this book written by a computer programmer?
Or perhaps the author has ingeniously left many errors in the programs so readers exercise the skills of finding bugs.
Search Customer Reviews
Only search this product's reviews

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 

Search Customer Discussions
Search all Amazon discussions
   

Look for similar items by category

Look for similar items by subject


















i.e., each title must be in subject 1 AND subject 2 AND ...

Amazon Media EU S.à r.l. GB Privacy Statement Amazon Media EU S.à r.l. GB Delivery Information Amazon Media EU S.à r.l. GB Returns & Exchanges