Data Structures and Algorithms Made Easy

Description

₹599.00
Price: [price_with_discount]
(as of [price_update_date] – Details)

[ad_1]

Reading books is a kind of enjoyment. Reading books is a good habit. We bring you a different kinds of books. You can carry this book where ever you want. It is easy to carry. It can be an ideal gift to yourself and to your loved ones. Care instruction keep away from fire.

Publisher ‏ : ‎ Careermonk Publications; Fifth edition (1 January 2016); CareerMonk Publications
Language ‏ : ‎ English
Paperback ‏ : ‎ 453 pages
ISBN-10 ‏ : ‎ 819324527X
ISBN-13 ‏ : ‎ 978-8193245279
Item Weight ‏ : ‎ 962 g
Dimensions ‏ : ‎ 21.59 x 2.39 x 27.94 cm
Country of Origin ‏ : ‎ India
Net Quantity ‏ : ‎ 1 Count
Importer ‏ : ‎ Careermonk Publications
Packer ‏ : ‎ CareerMonk Publications
Generic Name ‏ : ‎ Book

Reviewer: Revanth
Rating: 5.0 out of 5 stars
Title: Excellent book for starters
Review: Excellent book for both starters and experts

Reviewer: Nice book but one fault is not practice problems
Rating: 5.0 out of 5 stars
Title: Very nice book
Review: I like book because of problems with their initutive solutions , concepts etc

Reviewer: Kshitij
Rating: 4.0 out of 5 stars
Title: Good
Review: Book is good but they have only given algorithm. They should have given programs.

Reviewer: Bariya U.
Rating: 5.0 out of 5 stars
Title: The quality of book and explaining of DSA is very good.
Review: It’s quality is very good. The print may look less bright but enough for reading.

Reviewer: Sree Ram
Rating: 5.0 out of 5 stars
Title: We all need this!
Review: I am studying computer science engineering at NIT Trichy and at the end of my Data structures and Algorithms course.It was referred by my seniors who prepared this book for their course and campus placements. With curiosity, I bought this book. I realized right away that this book is one of the best book to get concepts clear with clear-cut explanations.The main difference between this book and other books is that the explanations are so clear, I can honestly say it has been relatively easy to learn. I haven’t struggled at all. The author takes a very clean approach, only focusing on the subject of algorithms and data structures.The concept of data structures and algorithms does not care about languages. He also criticizes the current trend of mixing “software engineering” and “object oriented concepts” in with this subject. His goal was to create the most easily understood book ever written on data structures and algorithms. I would say he hit his mark dead-on!The only thing missing from the book is exercises and glossary. There are none (at least not in the current edition).I posted few questions on publisher’s site: CareerMonk.com and the replies were really fast. We can find out the new questions by checking the publisher’s Website. The author has given us a real gem, and for that I am grateful.I also saw many posts about the achievements of this book. It is very good to see that an Indian authored books were being used as reference books, translated to different languages. Till now, we have seen only the reverse case. It is a great achievement.Note: I bought both Java and C editions and hence copying the reviews to both versions. Also, I would say one version is enough. Do not buy both.

Reviewer: Amazon Customer
Rating: 5.0 out of 5 stars
Title: Good
Review: Good

Reviewer: Tirit Sahu
Rating: 3.0 out of 5 stars
Title: Please check first before packing
Review: I received book but starting page is 37,Chapter 1 is missing.

Reviewer: Sanjeev
Rating: 4.0 out of 5 stars
Title: Seems like a good book
Review:  

Reviewer: SlowPoke
Rating: 1.0 out of 5 stars
Title:
Review: I immediately returned this book. It is unreadable, just compare the print to another book at the same time.Maybe the kindle version has adjustable font size but don’t buy the printed version.

Reviewer: Fabio Vinotti
Rating: 2.0 out of 5 stars
Title:
Review: Il libro é pieno di errori, sia grammaticali che logici. Alcuni esempi non si compilano nemmeno. Possibile che prima della pubblicazione l’autore non abbia verificato che il suo codice funzionasse?

Reviewer: Adel
Rating: 3.0 out of 5 stars
Title:
Review: Des pages qui ne sont pas agrafés à l’armature. Dommage.

Reviewer: Plain and Simple
Rating: 5.0 out of 5 stars
Title:
Review: no words is enough. simply awesome for all levels of programmers. nice examples, easy to brush up your CS fundamentals

Reviewer: Z
Rating: 4.0 out of 5 stars
Title:
Review: If you’re a computer science student at the undergrad or graduate level, or you work with computer algorithms in work (or *want* to do such work), this book might be useful to have on your shelf. I would not use this book to learn the basics of algorithms in the first place, but more as a companion book to a more traditional textbook, to get a summary of facts and a good overview of a wide range of algorithms. Comparing it to other algorithm and data structure textbooks, the material in this book is wide but shallow. There are many different algorithms and data structures examined–easily more than any other algorithm book I’ve come across–but you get almost a “Cliff’s Notes” summary of the algorithm a lot of times. For example, in O’Reilly’s “Algorithms in a Nutshell” and Sedgewick’s “Algorithms”, merge sort gets a deep treatment with several implementations shown in each book and a lot of words of analysis. However, in Mr. Karumanchi’s book, it gets a single page with one implementation, a handful of bullet points, and a few sentences of analysis. Don’t expect much in the way of mathematical proofs or theory here, but rather a straight to the point mindset. Which, if you’ve already studied merge sort before, and just want some basic questions answered (What is the recurrence relation? What is the space/time complexity? Why would I use this over another sorting algorithm?) could well be exactly what you need.

4.5

[ad_2]