AVL Trees – NOTES  PROGRAM

 Red-Black Trees -NOTES

,  Heap Trees (Priority Queues) – PPT

Graphs: Terminology,Representations:NOTES PPT

Basic Search and Traversals(BFS):PPT

Basic Search and Traversals(DFS):PPT

 Connected and Biconnected Components, Euler circuits.:PPT PROGRAM

Introduction to Algorithm Analysis, Space and Time Complexity analysis, Asymptotic Notations. :NOTES NOTES2

Divide and Conquer: 

The General Method:Notes

Quick Sort&Time complexity analysis:Notes

Merge Sort and Strassen’s matrix multiplication&Time complexity analysis :Notes

Convex Hull &Time complexity analysis:PPT1 PPT2

Greedy Method: 

General Method:Notes

Job Sequencing with deadlines:NOTES Knapsack Problem:NOTES

 Minimum cost spanning trees(PRIMS ALGORITHM):NOTES

 Minimum cost spanning trees(KRUSKAL ALGORITHM):NOTES

 Single Source Shortest Paths(Dijkstra's Algorithm):NOTES

 Backtracking:

 General Method

8-Queens Problem

 Sum of Subsets problem

 Graph Coloring

 0/1 Knapsack Problem.