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

Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles by Narasimha Karumanchi

Quick Overview

Written By: Narasimha Karumanchi
Publisher: Careermonk Publications

Binding: Paperback
Edition: 2nd ed.
Language: English
EAN: 9788192107554
Feature: Physical Condition: No Defects
ISBN: 8192107558
Language: NA
MPN: black & white illustrations
Number Of Items: 1
Number Of Pages: 450
Part Number: black & white illustrations
Publication Date: 2011-12-16
Manufacturer: Careermonk Publications

Availability: Usually dispatched within 24 hours

Price Details
  • List Price: INR 600.00
  • Amazon Price:
  • INR 480.00
  • You Save: INR 120.00 ( 20% )

Product Features

Physical Condition: No Defects

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.

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".
Note: If you already have "Data Structures and Algorithms Made Easy" no need to buy this.

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



Featured Books

Introduction to Algorithms by Thomas H. Cormen Rating Star
Internationally acclaimed textbook

Covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers.

For GATE civil engineering exam

Previous years GATE questions in order to help students get an idea of the format, as well as plan their practice in a similar fashion