Data Structures and Algorithms for GATE: Solutions to All Previous GATE Questions Since 1991

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.

This book looks at concepts of data structuring and algorithm formation, along with theorems and proofs on them that are most relevant from the point of view of interviews and competitive exams. It also contains a huge number of application-based problems, each with multiple solutions with different degrees of complexity, so that students can practise those they are comfortable with. They can also learn about other possible solutions to a problem, which will prepare them for interviews and GATE or higher studies. The first edition of Data Structures And Algorithms For Gate: Solutions To All Previous Gate Questions Since 1991 was published by CareerMonk Publications in 2011, and is available in paperback.

Key Features:

• This book can help one practise and master data structuring and algorithms at the level one is comfortable in, but also allows them to challenge their own abilities if they are ready for it.