"In light of the explosive growth in the amount of data and the diversity of computing applications, efficient algorithms are needed now more than ever". From many years data structures has been taught in computer science and engineering programs. Often it is regarded as central course of such curriculum. Progress in the field of data structures and algorithms has continued to evolve with concepts like heaps.

This course is designed to be both versatile and complete. You will find it useful for a variety of courses, from an undergraduate course in data structures up through a graduate course in algorithms. It provides you with an enjoyable introduction to Heaps. Careful explanations needed to understand the analysis of the algorithms are provided with the help of examples.

This course intends to discuss about Binary, Binomial and Fibonacci Heaps, its properties, operations and analysis. The main objective of this course is to briefly discuss about what are Binary, Binomial and Fibonacci Heaps, its operations and its analysis. The analysis part majorly focuses on comparison in cost of each operation with the three heaps. At the end of the course, applications of heaps are discussed.

The prerequisite of this course requires the student to have some basic knowledge about design and analysis of algorithms, which includes the understanding about various algorithms design strategies and also of how to analyze and determine the complexity of any given algorithm. It also requires some basic knowledge about data structures mainly Heaps and priority queues, the basic operations on priority queues/heaps and about implementation of heaps.