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

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

Quick Overview

Written By: Narasimha Karumanchi
Publisher: Careermonk Publications

Binding: Paperback
Edition: 5
Language: English
EAN: 9788193245279
Feature: Product Condition: No Defects
Format: Import
ISBN: 819324527X
Number Of Pages: 434
Publication Date: 2016-08-28
Manufacturer: Careermonk Publications

Availability: Usually dispatched within 24 hours

Price Details
  • List Price: INR 556.00
  • Amazon Price:
  • INR 556.00

Product Features

Product Condition: No Defects

Peeling Data Structures and Algorithms:

Table of Contents: goo.gl/JFMgiU
Sample Chapter: goo.gl/n2Hk4i
Found Issue? goo.gl/forms/4Gt72YO81I
Videos: goo.gl/BcHq74

"Data Structures And Algorithms Made Easy: Data Structures 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 Structures 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. This book serves as guide to prepare for interviews, exams, and campus work. In short, this book offers solutions to various complex data structures and algorithmic problems.

Topics Covered:

  1. Introduction
  2. Recursion and Backtracking
  3. Linked Lists
  4. Stacks
  5. Queues
  6. Trees
  7. Priority Queue and Heaps
  8. Disjoint Sets ADT
  9. Graph Algorithms
  10. Sorting
  11. Searching
  12. Selection Algorithms [Medians]
  13. Symbol Tables
  14. Hashing
  15. String Algorithms
  16. Algorithms Design Techniques
  17. Greedy Algorithms
  18. Divide and Conquer Algorithms
  19. Dynamic Programming
  20. Complexity Classes
  21. Miscellaneous Concepts


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