C03 - Dynamic Programming
Go Home MilanFX Notes Go Back
M1 - Divide & Conquer Algorithms
M11Divide Conquer M12MaxSubarray Problem M13Karatsuba Algorithm M14Master Method M15Fourier Transform  
📚
Assignment  
   
   
 
M2 - Dynamic Programming Algorithms
M21Dynamic Programming M22Rod Cutting M23Coin Changing M24Knapsack Problem M25Longest Subsequence  
📚
Assignment  
   
   
 
M3 - Greedy Algorithms
M31Greedy Algorithms M32Interval Scheduling M33Prefix Codes M34Huffman Codes    
📚
Assignment  
   
   
 
M4 - Quantum Computing
M41Decision Computing M42Polynomial Time M43NP Completeness M44NP Problems M45Quantum Computing  
📚
Assignment  
   
   
 

Go Home MilanFX Notes Go Back