Vous voulez voir cette page en français ? Cliquez ici.

Sign in to turn on 1-Click ordering.
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles, Second Edition [Paperback]

Narasimha Karumanchi

List Price: CDN$ 44.94
Price: CDN$ 43.44 & FREE Shipping. Details
You Save: CDN$ 1.50 (3%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Only 2 left in stock (more on the way).
Ships from and sold by Amazon.ca. Gift-wrap available.
Want it delivered Tuesday, April 22? Choose One-Day Shipping at checkout.


Amazon Price New from Used from
Paperback CDN $41.72  
Paperback, Dec 16 2011 CDN $43.44  

Book Description

Dec 16 2011
Peeling Data Structures and Algorithms for (Java, Second Edition): * Programming puzzles for interviews * Campus Preparation * Degree/Masters Course Preparation * Instructor's * GATE Preparation * Big job hunters: Microsoft, Google, Amazon, Yahoo, Flip Kart, Adobe, IBM Labs, Citrix, Mentor Graphics, NetApp, Oracle, Webaroo, De-Shaw, Success Factors, Face book, McAfee and many more * Reference Manual for working people

Frequently Bought Together

Customers buy this book with Cracking the Coding Interview: 150 Programming Questions and Solutions CDN$ 26.30

Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles, Second Edition + Cracking the Coding Interview: 150 Programming Questions and Solutions
Price For Both: CDN$ 69.74

Show availability and shipping details

Customers Who Bought This Item Also Bought

Product Details

Product Description

About the Author

Narasimha Karumanchi is the founder of CareerMonk and author of few books on data structures, algorithms, and design patterns. He was a software developer who has been both interviewer and interviewee over his long career. Most recently he worked for Amazon Corporation, IBM labs, Mentor Graphics, and Microsoft. He filed patents which are under processing.

He authored the following books which got translated to international languages: Chinese, Japanese, Korea and Taiwan. Also, around 58 international universities were using these books as reference for academic courses.

Data Structures and Algorithms Made Easy
Data Structures and Algorithms Made Easy in Java
Elements of Computer Networking
Data Structures and Algorithms Made Easy for GATE
Peeling Design Patterns
Coding Interview Questions

Narasimha held M.Tech. in computer science from IIT, Bombay, after finishing his B.Tech. from JNT university. He has also taught data structures and algorithms at various training institutes and colleges.
Prof. M. Sreenivasa Rao, is the current Director School of IT and also Professor of SIT Computer Science. He performs both his roles with ease. He is indeed a widely read and active person in the academic front. His articles and publications were published all over the world.
Dr. A. Damodaram joined as faculty of Computer Science & Engineering at JNTU, Hyderabad in the year 1989. In two decades of dedicated service, he performed distinguished services to the University as a Professor, Head of the Department, Vice Principal, Director of UGC - Academic Staff College, Director, School of Continuing & Distance Education and presently Director, University Academic Audit Cell.
--This text refers to an alternate Paperback edition.

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

What Other Items Do Customers Buy After Viewing This Item?

Customer Reviews

There are no customer reviews yet on Amazon.ca
5 star
4 star
3 star
2 star
1 star
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com: 4.3 out of 5 stars  38 reviews
26 of 31 people found the following review helpful
3.0 out of 5 stars Not 700+ Puzzles, 100+ Errors tough. Dec 11 2011
By Algorithmic - Published on Amazon.com
I write this review purely for the purpose of helping future readers to make a correct decision.
Note: Although I only own the C++ version of the book, I believe my review (at least the general idea) also applies to this Java version.

Background: I am CS graduate warming up for Job hunting, with 10+ years of programming experience.
I was so excited when I first saw the book (title) several weeks ago. Now I have finished several chapters and I should say it is not as great as it appears.

Let's cut to the meat directly.

1) Nice chapter organizations. It helps you to know what are the major topics you should work on to warm up for a coding interview.
2) Each chapter has a general introduction to the basic concepts.
3) Each chapter has a set of problems, with some decent analysis and solutions.

1) False advertisement. 700 puzzles? Come on. You do not have that many puzzles! Let's look at an example in the linked list chapter.
Problem #2: Find the nth node from the end of the list (give the puzzle, with a solution that guarantee you to be rejected by any interviewer).
Problem #3: Can we improve the solution of #2? (you will still be rejected if you present a solution like this)
Problem #4: Can we solve the same problem without hash table? (Here starts with the solution that make some sense)
Problem #5: Can we solve #2 in one scan? (finally here gives a good solution)

Many of the problems in the book are like this: different solutions to the SAME puzzle, You can do it, sure. But it is called an analytical process or algorithmic design process to one single problem. They are not different puzzles! Furthermore, the first 2 solutions are usually very naive, which can barely be counted as solutions. Sometimes, even the final version is not efficient enough.

2) Presentation mistakes, solution errors, typos.
For example, the presentation of XOR linked list in the linked list chapter is just wrong. You can not traverse 2 directions using just one node address.
For example, The solutions to problem 15 and problem 30 in the list chapter are wrong. The solution errors are actually more frequent because of cons #1.
For example, the usage of the term "hash table" is abusive and misleading. Why not follow the conventional usage? Not every table is a hash table.

3) Not many insightful ideas or analysis to a topic. Even there are multiple solutions to the same problem, the book does not show the underlining analytical process.
So to understand a topic or a problem well, you must read other data structure or algorithms books.

Suggestions to readers:
I used to read more than 5 algorithm/data structures on the same topic at the same time, which is in general a good approach to study a topic. This approach will
be especially useful when you read this book due to the reasons presented above. Remember to check out other online resources for coding problems too.
Take-home message:
1) Buy the book. It is helpful.
2) Read it with your own discretion.
3) Read other books and online resources on the same content at the same time.

Suggestions to authors (Why AUTHORS? Because I am almost 100% sure that some content was written by students):
1) Fix your false advertisement. Combine your "problems" together in to real puzzles. Do not present very dumb solutions just for the advertised numbers. Readers are fine without them. Let's respect our limited resource on the earth.
2) Add more problems to your book. I have seen about 80% problems elsewhere.
3) Fix your mistakes, errors and typos. Especially the presentation mistakes are not acceptable. Understand a topic before you add it into your book.
14 of 17 people found the following review helpful
3.0 out of 5 stars Riddled with errors and very disappointing Dec 28 2011
By Surra - Published on Amazon.com
Format:Paperback|Verified Purchase
After reading the great reviews on previous editions Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles, I was eager to get the new edition of the book.

The big disappointment came after going through a dozen pages and finding 4 errors in algorithm implementations. The explanations are not nearly as detailed and clear as some other reviews suggested, and the inaccuracies make one hesitant to trust the book.

Bottom line-you have a better chance of finding a clear, complete and correct implementation of algorithms online. I would not recommend this book.
4 of 4 people found the following review helpful
4.0 out of 5 stars Very Comprehensive Book May 3 2013
By Alan Jeevanathan - Published on Amazon.com
Format:Paperback|Verified Purchase
The author does a great job of covering a very large number of topics that you'd expect to face in an interview with bigger software development companies. I found the way the questions started off easier and built to be very helpful in grasping the topics. It was also good to be able to contact the author with further questions.
5 of 6 people found the following review helpful
4.0 out of 5 stars As expected/described Sept. 23 2011
By Rutvij - Published on Amazon.com
Format:Paperback|Verified Purchase
This book covers all you need to know for technical interview. It has what it says in title/ cover page. Only reason to give it 4 star is book is not well formatted, it looks like simple word document printed and shipped, even table of contents is not well formatted(for example, cannot differentiate chapters as they are in same size fonts headers are not bold either).

Bottom line: To learn it is an excellent book but, as a reader: book needs attention to its formatting.
2 of 2 people found the following review helpful
3.0 out of 5 stars useful but too many errors Feb. 12 2012
By Sam - Published on Amazon.com
Format:Paperback|Verified Purchase
Although it is a useful book in the sense that it categories the problem types and list many question types, there are many errors in the book hence 3 points. But I would still recommend buying it, however be suspicious when reading it and definitely check online if you see something that does not look correct.

Look for similar items by category