Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles

4.3 avg rating
( 524 ratings by Goodreads )
 
9780615459813: Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles

Peeling Data Structures and Algorithms for interviews [re-printed on 19-November-2015]
Table of Contents
: goo.gl/UeLODKSample Chapter: goo.gl/remIdpFound Issue? goo.gl/forms/4Gt72YO81IVideos: goo.gl/BcHq74
"Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists.
A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles is a solution bank for various complex problems related to data structures and algorithms. It can be used as a reference manual by those readers in the computer science industry. 

The book has around 21 chapters and covers Recursion and Backtracking, Linked Lists, Stacks, Queues,Trees, Priority Queue and Heaps, Disjoint Sets ADT, Graph Algorithms, Sorting, Searching, Selection Algorithms [Medians], Symbol Tables, Hashing, String Algorithms, Algorithms Design Techniques, Greedy Algorithms, Divide and Conquer Algorithms, Dynamic Programming, Complexity Classes, and other Miscellaneous Concepts.

Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles by Narasimha Karumanchi was published in March, and it is coded in C/C++ language. This book serves as guide to prepare for interviews, exams, and campus work. It is also available in Java. In short, this book offers solutions to various complex data structures and algorithmic problems.
What is unique?
   
Our main objective isn't to propose theorems and proofs about DS and Algorithms. We took the direct route and solved problems of varying complexities. That is, each problem corresponds to multiple solutions with different complexities.  In other words, we enumerated possible solutions. With this approach, even when a new question arises, we offer a choice of different solution strategies based on your priorities.

Topics Covered:

  • Introduction
  • Recursion and Backtracking
  • Linked Lists
  • Stacks
  • Queues
  • Trees
  • Priority Queue and Heaps
  • Disjoint Sets ADT
  • Graph Algorithms
  • Sorting   
  • Searching   
  • Selection Algorithms [Medians]   
  • Symbol Tables   
  • Hashing   
  • String Algorithms   
  • Algorithms Design Techniques   
  • Greedy Algorithms   
  • Divide and Conquer Algorithms   
  • Dynamic Programming   
  • Complexity Classes   
  • Miscellaneous Concepts   
Target Audience?
   
These books prepare readers for interviews, exams, and campus work. 

Language?

All code was written in C/C++. If you are using Java, please search for "Data Structures and Algorithms Made Easy in Java".

Also, check out sample chapters and the blog at: CareerMonk.com

"synopsis" may belong to another edition of this title.

From the Author:

Objective of this book is to present the ideas for solving data-structure and algorithmic problems. I request to go through the first chapter as it describes when do we (situations) get different complexities like O(logn), O(n^2), O(loglogn), O(nlogn), O(2^n) etc.. Once you understand them, remaining chapters looks easy as we refer these complexities at every place.

About the Author:

Narasimha Karumanchi works at Amazon Corporation, India and is a senior software developer by profession. He has earlier worked for IBM labs, Mentor Graphics, and Microsoft.
He has founded CareerMonk, and is regular contributor to StockMonks, where he designs algorithms. He also submitted patents (still under progress). 
He authored the following books (few of these got translated to international languages: Chinese, Japanese, Korea and Taiwan).
   Data Structures and Algorithms Made Easy   Data Structures and Algorithms Made Easy in Java   Data Structures and Algorithms Made Easy for GATE   Peeling Design Patterns   Coding Interview Questions   IT Interview Questions   Data Structure and Algorithmic Thinking with Python   Elements of Computer Networking
Narasimha did his 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. 

"About this title" may belong to another edition of this title.

Top Search Results from the AbeBooks Marketplace

1.

Narasimha Karumanchi
ISBN 10: 0615459811 ISBN 13: 9780615459813
New Soft cover Quantity Available: > 20
International Edition
Seller:
Wagon Of Deals
(Edmonton, AB, Canada)
Rating
[?]

Book Description 2011. Soft cover. Book Condition: New. International Edition. Book Condition: BRAND NEW. International/Eastern Economy Edition, Paperback/Softcover with SAME TITLE, AUTHOR AND EDITION as listed. ISBN and Cover design differs. **100% IDENTICAL CONTENTS as U.S Edition**. Standard Delivery within 7-14 business days ACROSS THE GLOBE. We can ship to PO Box, APO address in US. International Edition Textbooks may bear a label (Not for sale in the U.S. or Canada) or (For sale in Asia only) or similar restrictions- printed only to discourage students from obtaining an affordable copy. US Court has asserted your right to buy and use International edition. Access code/CD may not provided with these editions. We may ship the books from MULTIPLE WAREHOUSES ACROSS THE GLOBE including Asia depending upon the availability of inventory. Printed in English. Customer satisfaction guaranteed. Bookseller Inventory # ABECA10075

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 16.39
Convert Currency

Add to Basket

Shipping: US$ 4.61
From Canada to U.S.A.
Destination, Rates & Speeds

2.

Narasimha Karumanchi
ISBN 10: 0615459811 ISBN 13: 9780615459813
New Soft cover Quantity Available: > 20
International Edition
Seller:
Wagon Of Deals
(Edmonton, AB, Canada)
Rating
[?]

Book Description 2011. Soft cover. Book Condition: New. International Edition. Book Condition: BRAND NEW. International/Eastern Economy Edition, Paperback/Softcover with SAME TITLE, AUTHOR AND EDITION as listed. ISBN and Cover design differs. **100% IDENTICAL CONTENTS as U.S Edition**. Standard Delivery within 7-14 business days ACROSS THE GLOBE. We can ship to PO Box, APO address in US. International Edition Textbooks may bear a label (Not for sale in the U.S. or Canada) or (For sale in Asia only) or similar restrictions- printed only to discourage students from obtaining an affordable copy. US Court has asserted your right to buy and use International edition. Access code/CD may not provided with these editions. We may ship the books from MULTIPLE WAREHOUSES ACROSS THE GLOBE including Asia depending upon the availability of inventory. Printed in English. Customer satisfaction guaranteed. Bookseller Inventory # ABECA3612

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 16.39
Convert Currency

Add to Basket

Shipping: US$ 4.61
From Canada to U.S.A.
Destination, Rates & Speeds

3.

Karumanchi, Narasimha
ISBN 10: 0615459811 ISBN 13: 9780615459813
New Quantity Available: > 20
Print on Demand
Seller:
Pbshop
(Wood Dale, IL, U.S.A.)
Rating
[?]

Book Description 2011. PAP. Book Condition: New. New Book.Shipped from US within 10 to 14 business days.THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # IP-9780615459813

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 28.61
Convert Currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, Rates & Speeds

4.

Karumanchi, Narasimha
Published by WWW.Careermonk.com 5/5/2011 (2011)
ISBN 10: 0615459811 ISBN 13: 9780615459813
New Paperback or Softback Quantity Available: 10
Seller:
BargainBookStores
(Grand Rapids, MI, U.S.A.)
Rating
[?]

Book Description WWW.Careermonk.com 5/5/2011, 2011. Paperback or Softback. Book Condition: New. Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles. Book. Bookseller Inventory # BBS-9780615459813

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 39.22
Convert Currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, Rates & Speeds

5.

Narasimha Karumanchi
Published by CareerMonk Publications (2017)
ISBN 10: 0615459811 ISBN 13: 9780615459813
New Paperback Quantity Available: > 20
Print on Demand
Seller:
Murray Media
(North Miami Beach, FL, U.S.A.)
Rating
[?]

Book Description CareerMonk Publications, 2017. Paperback. Book Condition: New. Never used! This item is printed on demand. Bookseller Inventory # 0615459811

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 38.98
Convert Currency

Add to Basket

Shipping: US$ 1.99
Within U.S.A.
Destination, Rates & Speeds

6.

Karumanchi, Narasimha
ISBN 10: 0615459811 ISBN 13: 9780615459813
New Quantity Available: > 20
Print on Demand
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description 2011. PAP. Book Condition: New. New Book. Delivered from our US warehouse in 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND.Established seller since 2000. Bookseller Inventory # IP-9780615459813

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 31.84
Convert Currency

Add to Basket

Shipping: US$ 11.88
From United Kingdom to U.S.A.
Destination, Rates & Speeds

7.

Narasimha Karumanchi
Published by CareerMonk, United States (2011)
ISBN 10: 0615459811 ISBN 13: 9780615459813
New Paperback Quantity Available: 10
Print on Demand
Seller:
The Book Depository US
(London, United Kingdom)
Rating
[?]

Book Description CareerMonk, United States, 2011. Paperback. Book Condition: New. Language: English . Brand New Book ***** Print on Demand *****. Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists. A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles is a solution bank for various complex problems related to data structures and algorithms. It can be used as a reference manual by those readers in the computer science industry. The book has around 21 chapters and covers Recursion and Backtracking, Linked Lists, Stacks, Queues, Trees, Priority Queue and Heaps, Disjoint Sets ADT, Graph Algorithms, Sorting, Searching, Selection Algorithms [Medians], Symbol Tables, Hashing, String Algorithms, Algorithms Design Techniques, Greedy Algorithms, Divide and Conquer Algorithms, Dynamic Programming, Complexity Classes, and other Miscellaneous Concepts. Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles by Narasimha Karumanchi was published in March, and it is coded in C/C++ language. This book serves as guide to prepare for interviews, exams, and campus work. It is also available in Java. In short, this book offers solutions to various complex data structures and algorithmic problems. Peeling Data Structures and Algorithms for (C/C++, Second Edition): Programming puzzles for interviews Campus Preparation Degree/Masters Course Preparation Instructor s Big job hunters: Microsoft, Google, Apple, Amazon, Yahoo, Flip Kart, Adobe, IBM Labs, Citrix, Mentor Graphics, NetApp, Oracle, Face book, McAfee and many more Reference Manual for working people What is unique? Our main objective isn t to propose theorems and proofs about DS and Algorithms. We took the direct route and solved problems of varying complexities. That is, each problem corresponds to multiple solutions with different complexities. In other words, we enumerated possible solutions. With this approach, even when a new question arises, we offer a choice of different solution strategies based on your priorities. Topics Covered: Introduction Recursion and Backtracking Linked Lists Stacks Queues Trees Priority Queue and Heaps Disjoint Sets ADT Graph Algorithms Sorting Searching Selection Algorithms [Medians] Symbol Tables Hashing String Algorithms Algorithms Design Techniques Greedy Algorithms Divide and Conquer Algorithms Dynamic Programming Complexity Classes Miscellaneous Concepts Target Audience? These books prepare readers for interviews, exams, and campus work. Language? All code was written in C/C++. If you are using Java, please search for Data Structures and Algorithms Made Easy in Java (ISBN: 978-1468101270). Also, check out sample chapters and the blog at: Bookseller Inventory # APC9780615459813

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 47.82
Convert Currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, Rates & Speeds

8.

Narasimha Karumanchi
Published by CareerMonk, United States (2011)
ISBN 10: 0615459811 ISBN 13: 9780615459813
New Paperback Quantity Available: 10
Print on Demand
Seller:
The Book Depository
(London, United Kingdom)
Rating
[?]

Book Description CareerMonk, United States, 2011. Paperback. Book Condition: New. Language: English . Brand New Book ***** Print on Demand *****. Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists. A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles is a solution bank for various complex problems related to data structures and algorithms. It can be used as a reference manual by those readers in the computer science industry. The book has around 21 chapters and covers Recursion and Backtracking, Linked Lists, Stacks, Queues, Trees, Priority Queue and Heaps, Disjoint Sets ADT, Graph Algorithms, Sorting, Searching, Selection Algorithms [Medians], Symbol Tables, Hashing, String Algorithms, Algorithms Design Techniques, Greedy Algorithms, Divide and Conquer Algorithms, Dynamic Programming, Complexity Classes, and other Miscellaneous Concepts. Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles by Narasimha Karumanchi was published in March, and it is coded in C/C++ language. This book serves as guide to prepare for interviews, exams, and campus work. It is also available in Java. In short, this book offers solutions to various complex data structures and algorithmic problems. Peeling Data Structures and Algorithms for (C/C++, Second Edition): Programming puzzles for interviews Campus Preparation Degree/Masters Course Preparation Instructor s Big job hunters: Microsoft, Google, Apple, Amazon, Yahoo, Flip Kart, Adobe, IBM Labs, Citrix, Mentor Graphics, NetApp, Oracle, Face book, McAfee and many more Reference Manual for working people What is unique? Our main objective isn t to propose theorems and proofs about DS and Algorithms. We took the direct route and solved problems of varying complexities. That is, each problem corresponds to multiple solutions with different complexities. In other words, we enumerated possible solutions. With this approach, even when a new question arises, we offer a choice of different solution strategies based on your priorities. Topics Covered: Introduction Recursion and Backtracking Linked Lists Stacks Queues Trees Priority Queue and Heaps Disjoint Sets ADT Graph Algorithms Sorting Searching Selection Algorithms [Medians] Symbol Tables Hashing String Algorithms Algorithms Design Techniques Greedy Algorithms Divide and Conquer Algorithms Dynamic Programming Complexity Classes Miscellaneous Concepts Target Audience? These books prepare readers for interviews, exams, and campus work. Language? All code was written in C/C++. If you are using Java, please search for Data Structures and Algorithms Made Easy in Java (ISBN: 978-1468101270). Also, check out sample chapters and the blog at: Bookseller Inventory # APC9780615459813

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 49.37
Convert Currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, Rates & Speeds

9.

Narasimha Karumanchi
Published by CareerMonk Publications
ISBN 10: 0615459811 ISBN 13: 9780615459813
New Paperback Quantity Available: > 20
Seller:
BuySomeBooks
(Las Vegas, NV, U.S.A.)
Rating
[?]

Book Description CareerMonk Publications. Paperback. Book Condition: New. Paperback. 426 pages. Dimensions: 10.9in. x 8.4in. x 0.8in.Peeling Data Structures and Algorithmsfor interviewsre-printed with corrections and new problems: Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in CC, it comes handy as an interview and exam guide for computer scientists. A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzlesis a solution bank for various complex problems related to data structures and algorithms. It can be used as a reference manual by those readers in the computer science industry. The book has around 21 chapters and covers Recursion and Backtracking, Linked Lists, Stacks, Queues, Trees, Priority Queue and Heaps, Disjoint Sets ADT, Graph Algorithms, Sorting, Searching, Selection Algorithms Medians, Symbol Tables, Hashing, String Algorithms, Algorithms Design Techniques, Greedy Algorithms, Divide and Conquer Algorithms, Dynamic Programming, Complexity Classes, and other Miscellaneous Concepts. Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles by Narasimha Karumanchi was published in March, and it is coded in CC language. This book serves as guide to prepare for interviews, exams, and campus work. It is also available in Java. In short, this book offers solutions to various complex data structures and algorithmic problems. What is uniqueOur main objective isnt to propose theorems and proofs about DS and Algorithms. Wetook the direct route andsolved problemsofvarying complexities. That is, each problem corresponds to multiple solutions withdifferent complexities. In other words, we enumerated possible solutions. With this approach, evenwhen anew question arises, weoffer a choice ofdifferent solution strategies based onyour priorities. Topics Covered: IntroductionRecursion and BacktrackingLinked ListsStacksQueuesTreesPriority Queue and HeapsDisjoint Sets ADTGraph AlgorithmsSortingSearchingSelection Algorithms MediansSymbol TablesHashingString AlgorithmsAlgorithms Design TechniquesGreedy AlgorithmsDivide and Conquer AlgorithmsDynamic ProgrammingComplexity ClassesMiscellaneous ConceptsTarget AudienceThese books prepare readers for interviews, exams, and campus work. LanguageAll code was written in CC. If you are usingJava, please search for Data Structures and Algorithms Made Easy in Java. Also, check out sample chapters and theblog at: CareerMonk. com This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Paperback. Bookseller Inventory # 9780615459813

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 50.96
Convert Currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, Rates & Speeds

10.

Narasimha Karumanchi
Published by CareerMonk Publications (2011)
ISBN 10: 0615459811 ISBN 13: 9780615459813
New Paperback Quantity Available: 1
Seller:
Irish Booksellers
(Rumford, ME, U.S.A.)
Rating
[?]

Book Description CareerMonk Publications, 2011. Paperback. Book Condition: New. book. Bookseller Inventory # M0615459811

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 51.77
Convert Currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, Rates & Speeds

There are more copies of this book

View all search results for this book