BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Problem Solving in Data Structures and Algorithms Using Java : The Ultimate Guide to Programming

Problem Solving in Data Structures and Algorithms Using Java : The Ultimate Guide to Programming

Problem Solving in Data Structures and Algorithms Using Java : The Ultimate Guide to Programming Paperback - 2016

by Hemant Jain

Add to wish list
  • Used
  • Good
  • Paperback
Used - Good

Description

CreateSpace Independent Publishing Platform, 2016. Paperback. Good. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.Dust jacket quality is not guaranteed.
Ask the seller a question Add to wish list
A$50.50
Free Delivery within USA
Standard delivery: 4 to 8 days
More delivery options
Ships from ThriftBooks (Washington, United States)
Biblio Top Seller
The BIBLIO Guarantee

Details

About ThriftBooks Washington, United States

Biblio member since 2018

From the largest selection of used titles, we put quality, affordable books into the hands of readers

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from ThriftBooks

Reader reviews for Problem Solving in Data Structures and Algorithms Using Java : The Ultimate Guide to Programming

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

"Problem Solving in Data Structures & Algorithms" is a series of books about the usage of Data Structures and Algorithms in computer programming. The book is easy to follow and is written for interview preparation point of view. In various books, the examples are solved in various languages like Go, C, C++, Java, C#, Python, VB, JavaScript and PHP.


GitHub Repositories
https: //github.com/Hemant-Jain-Author

Book's Composition
This book is designed for interviews so in Chapter 0, various preparation plans are proposed. Then in chapters 1, a brief introduction of the programming language and concept of recursion is explained. A number of problems based on recursion and array are explained.

Then in the coming chapter, we will be looking into complexity analysis. Then we will be looking into Sorting & Searching techniques.

Then will look into the various data structures and their algorithms. We will be looking into a Linked List, Stack, Queue, Trees, Heap, Hash Table and Graphs.

Then we will be looking into algorithm analysis, we will be looking into Brute Force algorithms, Greedy algorithms, Divide & Conquer algorithms, Dynamic Programming, and Backtracking.

In the end, we will be looking into System Design, which will give a systematic approach for solving the design problems in an Interview.


Table of Contents
Chapter 0: How to use this book.
Chapter 1: Introduction - Programming Overview
Chapter 2: Algorithms Analysis
Chapter 3: Approach to solve algorithm design problems
Chapter 4: Abstract Data Type
Chapter 5: Searching
Chapter 6: Sorting
Chapter 7: Linked List
Chapter 8: Stack
Chapter 9: Queue
Chapter 10: Tree
Chapter 11: Priority Queue
Chapter 12: Hash-Table
Chapter 13: Graphs
Chapter 14: String Algorithms
Chapter 15: Algorithm Design Techniques
Chapter 16: Brute Force Algorithm
Chapter 17: Greedy Algorithm
Chapter 18: Divide & Conquer
Chapter 19: Dynamic Programming
Chapter 20: Backtracking
Chapter 21: Complexity Theory
Chapter 22: Interview Strategy
Chapter 23: System Design

Please wait a moment while we load the requested page.

tracking-