Overview

The book explores the fundamental data structures like arrays, stacks, queues, linked lists, hashing, and various trees, as well as binomial and Fibonacci heaps. With this foundation, you will explore a wide range of sorting and searching algorithms, from simple methods to more advanced techniques like radix sort and exponential search. You will gain a deep understanding of general methods and applications of divide and conquer, greedy algorithms, dynamic programming, backtracking, and branch and bound, each explained with classic examples.

Full Product Details

9789365899603

Table of Contents

Reviews

Author Information

Prof. (Dr.) Rahul Bhandari is a senior IEEE member. He is an accomplished academic and researcher in computer science and engineering with over a decade of experience. Currently a professor at Chandigarh University, Punjab

Tab Content 6

Countries Available