Data Structures and Algorithms Made Easy in Java
Author: Narasimha Karumanchi
ISBN: 978-8192107554
Price: Rs. 899.10 • ✓ 100% Genuine Publisher Edition
Book Overview
About This BookA handy guide of sorts for any computer Science professional, data structures and algorithms made easy in Java: 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 in Java: data structure and algorithmic puzzles by Narasimha karumanchi was published in 2011, and it is coded in Java language. This book serves as guide to prepare for interviews, exams, and campus work. It is also available in C/C++. in short, this book provides solutions to various complex data structures and algorithmic problems. What is unique. Our main objective isn't to propose theorems and proofs about antibodies 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 Java. If you are using C/C++, please search for "data structures and algorithms made easy". Note: if you already have "data structures and algorithms made easy" No need to buy this. Read moreBook DetailsAuthor: Narasimha KarumanchiPublisher: CareerMonk Publications; Second edition (16 December 2011); Repro Books on DemandFormat: Paperback – Illustrated, 16 December 2011Language: EnglishPages: 450ISBN: 978-8192107554Dimensions: 21.59 x 2.36 x 27.94 cmWeight: 953 g
Browse this title within our Science and Technology collection. Edition details: Paperback – Illustrated, 16 December 2011, English, 450 pages. Reference ISBN: 978-8192107554.
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.
Book Specifications & Quick Facts
- Reading Level
- General / Adult
- Language & Format
- English • Paperback – Illustrated, 16 December 2011
- ISBN Reference
- 978-8192107554
- Publisher
- CareerMonk Publications
- Pan-India Delivery
- Dispatches in 24–48 Hours across India
What is this book about?
About This BookA handy guide of sorts for any computer Science professional, data structures and algorithms made easy in Java: 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...
Who should read this book?
Valuable for university students, educators, and scholars seeking authoritative reference material and structured subject mastery.
Why Readers Pick This Edition
- You’ll love this book because it turns intimidating data structures and algorithms into clear, step-by-step problem-solving tools. Written in Java and packed with practical puzzles, it helps you think like an interviewer while building strong fundamentals. Whether you’re revising for exams, preparing for coding interviews, or need a reliable reference at work, this guide gives you confidence, clarity, and plenty of “aha!” moments as you tackle real-world algorithmic challenges.
- Published by CareerMonk Publications.
- Language: English.
- Page count: 450.
Catalog Description
About This BookA handy guide of sorts for any computer Science professional, data structures and algorithms made easy in Java: 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...
Browse the Full Science and Technology
Enjoyed Data Structures and Algorithms Made Easy in Java? Explore our complete Science and Technology collection to discover more titles you will love. We carry a wide range of genuine editions with fast delivery across India.
Also Found In
More Books in Science and Technology
Browse More on BookPyramid
Discover our Best Sellers, check out New Arrivals, or browse Award-Winning Books. You can also explore books by your favourite authors on our Authors page.