Video Lectures
Subject Code : 21CS41
Mathematical Foundations for Computing

Module-1

Algorithm Definition & Properties
Algorithms to find GCD
Efficiency of an Algorithm
Time Complexity of Algorithm
Efficiency Class
Asymptotic Notation 1
Asymptotic Notation 2
Big-Oh (O), Omega (Ω), Theta ( ) notations
Comparision of Efficiency Class using Asymptotic Notation
Time Complexity of Non Recursive Algorithm
Time Complexity of Recursive Algorithm
Selection Sort
Sequential search/Linear Search
Empirical Analysis of an Algorithm
Recursive Tree method to Solve Recurrence
Bubble Sort
 

Module-2

Master's Theorem to Solve Recurrence Relation
Algorithm for Finding the Maximum and Minimum using Divide and Conquer Technique
Merge Sort
C Program to implement Merge Sort
Quick Sort
C Program to implement Quick Sort
Insertion Sort
DFS Depth First Search
BFS Breadth First Search
Topological Sort
Multiplication of 2 integers using Divide & Conquer
Strassen's Matrix Multiplication
 

Module-3

Introduction to Greedy Technique & Prims Algorithm to find MST
C Program to find Minimum Spanning Tree using Prims Algorithm
Kruskal's Algorithm to find Minimum Spanning Tree
Dijkstra's Algorithm Single Source Shortest Path
Huffman Coding
C Program to implment Dijkstra's Algorithm to find shortest path from a given source vertex
Johnson Trotter Algorithm
Josephus problem & Fake Coin problem
Selection Problem & Interpolation Search
Transform & Conquer Instance Simplication
2 - 3 Tree
Heap Sort
C Program to implement Heap Sort
Comparison Count Sort & Distribution Count Sort
Horspool's String Matching
C Program to implement Horspool String Matching
Boyer Moore's String Matching
 

Module-4

Introduction to Dynamic Programming
Floyd's Algorithm
C Program to implement Floyds Algorithm
Bellman-Ford Algorithm
Warshall's Algorithm
0-1 Kanapsack Problem
Memory Function Knapsack Problem
C Program to Solve Knapsack Problem using Dynamic Programming
 

Module-5

Sum of Subset Problem
C Program to Solve Sum of Subset Problem using Backtracking
N-Queen's Problem
Assignment Problem using Branch & Bound
Knapsack Problem using Branch & Bound
Travellig Salesman Problem using Branch & Bound
Scroll to Top