IIT-ISM Dhanbad · Mathematics & Statistics

Design and Analysis of Algorithms with Applications

Prof. Srinivasa Rao Pentyala · 60 free video lectures

(i). The course is a fundamental component of Mathematics and computer science and other engineering disciplines. It provides a systematic framework for understanding how to design efficient computational procedures and how to evaluate their performance. Algorithms form the backbone of every…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Lecture 01: Basic Concepts of Algorithms
  2. Lecture 02: Performance and Asymptotic Analysis
  3. Lecture 03: Mathematical Notations and Recursive Algorithms
  4. Lecture 04: Mathematical Notations and case Studies
  5. Lecture 05: Greedy Techniques
  6. Lecture 06: The 0 –1 KanapsackProblems
  7. Lecture 07: Huffman Algorithm & Knapsack Problem
  8. Lecture 08: Review of Graph Algorithms
  9. Lecture 09: Breadth First Search Algorithm (BFS)
  10. Lecture 10: Depth First Search Algorithm (DFS)
  11. Lecture 11: Kruskal’s Algorithms
  12. Lecture 12: Prims’s Algorithms
  13. Lecture 13: Stable Matching Problem
  14. Lecture 14: Shortest Path Problem
  15. Lecture 15: Union Find data Structure
  16. Lecture 16: Divide and Conquer Algorithms
  17. Lecture 17: Heap Sort, Bucket Sort Algorithms
  18. Lecture 18: Binary Search Tree Algorithms
  19. Lecture 19: Optimal Storage on Taps Algorithms
  20. Lecture 20: Stassen’s matrix multiplication Algorithms
  21. Lecture 21: Bellman-Ford algorithm
  22. Lecture 22: Examples: Bellman-Ford algorithm
  23. Lecture 23: Examples: Bellman-Ford algorithm
  24. Lecture 24: All pairs shortest path problem
  25. Lecture 25: Examples
  26. Lecture 26: Representation of Polynomials and Complexity
  27. Lecture 27: The DFT Algorithms and Complexity
  28. Lecture 28: Representation of polynomials
  29. Lecture 29: The DFT and FFT
  30. Lecture 30: Efficient FFT and implementation
  31. Lecture 31: Network Algorithms & Complexity
  32. Lecture 32: Approximation Algorithms
  33. Lecture 33: Approximation Algorithms
  34. Lecture 34: Parallel Algorithms
  35. Lecture 35: Online Algorithms
  36. Lecture 36: Algorithmic Trading, Portfolio Optimization
  37. Lecture 37: Risk Analysis and Fraud Detection
  38. Lecture 38: Risk Analysis and Fraud Detection: Approximation Algorithms
  39. Lecture 39: Logistics and Supply Chain Management
  40. Lecture 40: Scheduling, Inventory Management
  41. Lecture 41: Bioinformatics: Applications of Algorithms
  42. Lecture 42: Applications involve sequence alignment,
  43. Lecture 43: Gene sequencing, protein prediction
  44. Lecture 44: Complex Biological Data Analysis Tasks
  45. Lecture 45: Applications in Database Systems of Large Computation
  46. Lecture 46: Applications in Database Systems
  47. Lecture 47: Fundamental Algorithms for Sorting, Searching
  48. Lecture 48: Fundamental Algorithms for Sorting and Pattern Matching
  49. Lecture 49: Searching and Data Manipulation
  50. Lecture 50: Web Applicatons
  51. Lecture 51: Applications in Data Science and Machine Learning
  52. Lecture 52: Data Analysis Applications, Pattern Recognition
  53. Lecture 53: Optimization in Machine Learning
  54. Lecture 54: Clustering, Classification
  55. Lecture 55: Regression, and Neural Networks,WeatherPredictions
  56. Lecture 56: Big Data Processing: Developing
  57. Lecture 57: Data Mining, Natural Language Processing
  58. Lecture 58: Advanced Machine Learning for handling
  59. Lecture 59: Extracting Insights from massive Datasets
  60. Lecture 60: Extracting insights from Massive Datasets (Conti..)

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT-ISM Dhanbad.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights