Home
DAA
UNIT 1
UNIT 2
UNIT 3
UNIT 4
UNIT 5
UNIT 6
OOP
UNIT 1
UNIT 2
UNIT 3
UNIT 4
UNIT 5
UNIT 6
P&S
UNIT 1
UNIT 2
UNIT 3
UNIT 4
UNIT 5
UNIT 6
FLAT
UNIT 1
UNIT 2
UNIT 3
UNIT 4
UNIT 5
UNIT 6
COA
UNIT 1
UNIT 2
UNIT 3
UNIT 4
UNIT 5
UNIT 6
UNIT-3
GREEDY METHOD
General method
Job sequencing with deadlines
Knapsack problem
Min cost spanning tree
Single source shortest path
UNIT 3
