full screen
Home > Computer & Internet > Computer programming / software development > Software engineering > Unified modeling language (uml) > Data Structures and Algorithms Made Easy in Java
Data Structures and Algorithms Made Easy in Java

Data Structures and Algorithms Made Easy in Java


     0     
5
4
3
2
1



International Edition


About the Book

Video Link: youtube.com/watch?v=l_GRquIrVyg

A 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 offers solutions to various complex data structures and algorithmic problems.

Peeling Data Structures and Algorithms for (Java, 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 ennumerated 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".

Also, check out sample chapters and the blog at: CareerMonk.com
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.


Best Sellers



Product Details
  • ISBN-13: 9788192107554
  • Publisher: CareerMonk Publications
  • Publisher Imprint: CareerMonk Publications
  • Edition: 0002-
  • Language: English
  • Returnable: Y
  • Spine Width: 22 mm
  • Weight: 1001 gr
  • ISBN-10: 8192107558
  • Publisher Date: 16 Dec 2011
  • Binding: Paperback
  • Height: 280 mm
  • No of Pages: 414
  • Series Title: English
  • Sub Title: Data Structure and Algorithmic Puzzles, Second Edition
  • Width: 216 mm


Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Data Structures and Algorithms Made Easy in Java
CareerMonk Publications -
Data Structures and Algorithms Made Easy in Java
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Data Structures and Algorithms Made Easy in Java

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Booksbay (the "CRR Service").


    By submitting any content to Booksbay, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Booksbay (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Booksbay a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Booksbay may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Booksbay's sole discretion. Booksbay reserves the right to change, condense, withhold publication, remove or delete any content on Booksbay's website that Booksbay deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Booksbay does not guarantee that you will have any recourse through Booksbay to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Booksbay reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Booksbay, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Booksbay, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!