Data Structures and Algorithms For GATE: Solutions to all previous GATE questions since 1991

Peeling Data Structures and Algorithms for (C/C++, For GATE):

• GATE Preparation 
• Solutions to all previous GATE questions since 1991 
• Campus Preparation 
• Degree/Masters Course Preparation 
• Instructor's 
• 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 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.

Write a review

Your Name:


Your Review: Note: HTML is not translated!

Rating: Bad            Good

Enter the code in the box below: