• There is a Download Limit of 25 Lectures per month for any user. So please click on the 'Download' links carefully.
• After downloading, unzip the lectures and play.

Introduction: What is an Algorithm ?

Program Algorithm, Data Structure & Software Life Cycle

Abstract Data Types (ADT) What & Why ?

Performance Analysis of Algorithms & Programs

Array ADT

Ordered Lists, Polynomial. ADTs

Polynomial ADTs & its Implementation

Sparse Matrices, Multidimensional Arrays

Stacks & Queues

Expression Evaluation Using a Stack

Linked lists

Implementation of Multiple Stacks & Queues Using Linked Lists

Polynomial Implementation Using Linked Lists

Circular & Doubly Linked List

Generalized Lists (Contd.)

Generalized Lists (Contd.); Garbage Collection

Binary Tree Data Structure

Traversal of Binary Tree

Graphs - Some Common Definitions

Representation of Graphs and Some Common Operations on Graphs

Connected Components, Spanning Tree of a Graph

Searching & Sorting

Internal Sorting Algorithm - Insertion Sort, Quick Sort

Complexity of Merge Sort and Heap Sort

Heap Sort (Contd.); Symbol Tables

Height Balanced Binary Trees