NOTATION OF

ALGORITHM

TOP DOWN
ALGORITHM DESIGN
INTRODUCTION TO
APPROACH BASED ON
ALGORITHM DESIGN
ARCHITECTURE
BOTTOM UP

FIXED

ALGORITHM ANALYSIS SPACE COMPLEXITY

VARIABLE

LOOP

NESTED LOOP
DESIGN ANALYSIS AND
UNIT 1
ALGORITHM
IF STATEMENT
2ND MATHS ANALYSIS

RECURCIVE ALGORITHM

NON RECURSIVE
ALGORITHM

E-NOTATION
LARGEST SUB ARRAY
SUM
3RD OMEGA NOTATION

FINDING MAXIMUM
AND MINIMUM IN THE THETA NOTATION
ARRAY

HUFFMAN CODING
STRASSENS MATRIX
MULTIPLICATION INTRODUCTION
GREEDY AND DYNAMIC
APPROACH
CONVEX
DEVIDE AND CONQUER UNIT 2
TREE TRAVERSAL
BINARY SEARCH

LCI
DIVIDE MATRIX CHAIN
MULTIPLICATION
COMPLEXITY
CONQUERE
GREEDY AND DYNAMIC
UNIT 3
ALGORITHM COMPLEXITY
MERGE SORT DYNAMIC DERIVATION OF
KNAPSACK PROBLEM
PROGRAMMING KNAPSACK USING
DAA
FREEDY
QUICK SORT

OPTIMAL BINARY USING DYNAMIC

DEPTH FIRST SEARCH
SEARCH TREE PROGRAMMING
GRAPH ALGORITHM

BREADTH FIRST SEARCH

KRUSKAL'S ALGORITHM
MAXIMUM SPANNING
TREE
BACK TRACKING
PRIMS ALGORITHM
INTRODUCTION

BRANCH AND BOUND BACKTRACKING UNIT 4 SOLUTION

STATE
DIFFERENTIATE WITH
ANSWER
DYNAMIC AND GREEDY
TRAVELLING

GRAPH ALIVE

FLOYD WARSHELL SHORTEST PATH GENERAL METHOD NODE

COMPLEXITY DEAD

BRANCH AND BOUND

BOUNDING FUNCTION

D-SEARCH

0/1 KNAPSACK
PROBLEM

PROBLEM
HIRING

BRANCH AND BOUND

TRAVELLING SALESMAN
UNIT 5 RANDOMIZED
ALGORITHM
P

NP

COMPLEXITY

NP HARD

NP COMPLETE

LAS VEGAS

ALGORITHM

MENTE CARLO
RANDOMIZED

QUICK SORT PARTITION