Data Structures and Algorithms for GATE

Author:

Narasimha Karumanchi

Publisher:

CareerMonk Publications

Rs385 Rs550 30% OFF

Availability: Available

Shipping-Time: Same Day Dispatch

    

Rating and Reviews

0.0 / 5

5
0%
0

4
0%
0

3
0%
0

2
0%
0

1
0%
0
Publisher

CareerMonk Publications

Publication Year 2011
ISBN-13

9788192107509

ISBN-10 8192107507
Binding

Paperback

Number of Pages 430 Pages
Language (English)
Dimensions (Cms) 21.59 x 2.26 x 27.94
Weight (grms) 724

Data Structures And Algorithms For Gate: Solutions To All Previous Gate Questions Since 1991 by Narasimha Karumanchi is a compilation of GATE question papers from 1991 till 2010. The books features a special emphasis on the sections on data structures and algorithms, which are crucial topics for anybody studying computer science, programming, or similar subjects. Some of the important data structure topics covered by this book are linked lists, stacks, queues, trees, recursions, and backtracking. The algorithm topics covered are searching, sorting, graph algorithms, string algorithms, hashing techniques, and symbol tables, as well as more advanced topics like dynamic programming, divide and conquer algorithms, and greedy algorithms

Narasimha Karumanchi

Software designer and developer Narasimha Karumanchi has been employed at Mentor Graphics, Microsoft, and IBM Labs. Working as a senior software developer with Amazon at present, he specialises in the concepts of data structure and programming, and primarily writes about them for reference books on competitive exams. He has written books like Peeling Design Patterns: For Beginners And Interviews, Coding Interview Questions, and Data Structure Puzzles: Puzzle Your Mind For Data Structures
No Review Found
More from Author