• Introduction

• Asymptotic Notations

• Recurrence Relations

• Insertion Sort

• Merge Sort

• Quick Sort

  • Subpart

  • Subpart 2

• Sorting Lower Bound

  • Subpart

• Bucket Sort

  • Subpart

• Randomised k^th order

1. Subpart

• Median of Medians

1. Writeup

• Binary Search Tree

1. Write Up

• Red Black Trees

   Introduction

Subpart

Subpart 2

• Clever Way

• Kruskal Algorithm

• Union-Find

• Prims Algorithm

• Implementation

• Single Source Shortest Path

• Dijkstra’s Algorithm

• Dynamic Programming

• Flow Networks

• Ford-Fulkerson

• Application of Flow network.

• Amortized Analysis

• Heap Sort

• KC and Assignment

• Computational Complexity

• End Sem Exam

• End sem 2