Lecture Notes || SNS Courseware

UNIT 1:

Introduction - Notion of an Algorithm

Fundamentals of Algorithmic Problem Solving

Important Problem Types

Fundamentals of the Analysis of Algorithm Efficiency

Analysis Framework

Asymptotic Notations and its properties

Mathematical Analysis for Recursive Algorithm - Substitution method

Mathematical Analysis for Non-recursive Algorithms

Important Problem Types

UNIT 2:

Brute Force: Selection Sort

Bubble Sort

Sequential Search & Closest Pair Problem

Convex Hull Problem

UNIT 3:

Dynamic Programming: Computing a Binomial coefficient

Warshall’s algorithm

Optimal Binary Search Tree (OBST)

0/1 knapsack problem and memory function

Lecture Notes