Problem Solving Techniques | Computer Science (Kruskal's algorithm and Knapsack Problem)

Lukas Vyhnalek, Former SAP Employee

Play Speed
  • 0.5x
  • 1x (Normal)
  • 1.25x
  • 1.5x
  • 2x
6 Videos (24m)
    • Devide And Conquer

      3:26
    • Dynamic Programming

      2:06
    • Greedy Algorithms

      2:15
    • Backtracking

      3:32
    • Knapsack

      6:59
    • Kruskal

      5:37

About This Class

This class will explain the important concepts about problem solving techniques.

These techniques are used in many algorithms and are most commonly used in computer science. I will also demonstrate these techniques on 0-1 Knapsack problem and Kruskal's algorithms (minimum spanning tree).