Design and Analysis of Algorithms with Applications A4558AQXN8

URI	`m2://res/A4558AQXN8`
Kind	course
Creators	Srinivasa Rao Pentyala (instructor)
Date	2026-06-17
Scope	in

Expressions

e1: edition

Language	en
Date	2026-06-17

m1: page, IIT-ISM Dhanbad (record). nptel 111105001
m2: page, 2026-06-17 (record). nptel 111105001

Contents

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

Catalogue records

nptel: 111105001 (manifestation)
nptel_video: 111105001 (manifestation)