Plays in YouTube's player, loaded from youtube-nocookie.com when you press Play. Watch on YouTube

Learn · Design and analysis of algorithms

Lecture 42 of 56Week 6: Data Structures: Search Trees

Scheduling with deadlines: minimizing lateness

Prof. Madhavan Mukund · Chennai Mathematical Institute

Credits and licence

From
Design and analysis of algorithms, Chennai Mathematical Institute (at NPTEL)
Licence
CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
Attribution
NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge. Coordinated by IIT Madras.
Who can watch
Tweens profiles and older. How courses are placed

All the lectures

  1. Course Outline YouTube
  2. Example: Air Travel YouTube
  3. Example: Xerox shop YouTube
  4. Example: Document similarity YouTube
  5. Introduction and motivation YouTube
  6. Input size, worst case, average case YouTube
  7. Quantifying efficiency: O( ), Omega( ), Theta( ) YouTube
  8. Examples: Analysis of iterative and recursive algorithms YouTube
  9. Arrays and lists YouTube
  10. Searching in an array YouTube
  11. Selection Sort YouTube
  12. Insertion sort YouTube
  13. Merge sort YouTube
  14. Merge sort - analysis YouTube
  15. Quicksort YouTube
  16. Quicksort - analysis YouTube
  17. Sorting - Concluding remarks YouTube
  18. Introduction to graphs YouTube
  19. Representing graphs YouTube
  20. Breadth first search (BFS) YouTube
  21. Depth first search (DFS) YouTube
  22. Applications of BFS and DFS YouTube
  23. Directed acylic graphs: topological sort YouTube
  24. Directed acylic graphs: longest paths YouTube
  25. Single source shortest paths: Dijkstra's algorithm YouTube
  26. Dijkstra's algorithm: analysis YouTube
  27. Negative edge weights: Bellman-Ford algorithm YouTube
  28. All pairs shortest paths YouTube
  29. Minimum Cost Spanning Trees YouTube
  30. Prim's Algorithm YouTube
  31. Kruskal's algorithm YouTube
  32. Union-Find using arrays YouTube
  33. Union-Find using pointers YouTube
  34. Priority queues YouTube
  35. Heaps YouTube
  36. Heaps: Updating values, sorting YouTube
  37. Counting inversions YouTube
  38. Closest pair of points YouTube
  39. Binary Search Trees YouTube
  40. Balanced search trees YouTube
  41. Interval scheduling YouTube
  42. Scheduling with deadlines: minimizing lateness YouTube
  43. Huffman codes YouTube
  44. Introduction to dynamic programming YouTube
  45. Memoization YouTube
  46. Grid Paths YouTube
  47. Common subwords and subsequences YouTube
  48. Edit distance YouTube
  49. Matrix multiplication YouTube
  50. Linear Programming YouTube
  51. LP modelling: Production Planning YouTube
  52. LP modelling: Bandwidth allocation YouTube
  53. Network Flows YouTube
  54. Reductions YouTube
  55. Checking Algorithms YouTube
  56. P and NP YouTube