Главная
Study mode:
on
1
Mod-01 Lec-01 Graph_Basics
2
Mod-01 Lec-02 Breadth_First_Search
3
Mod-01 Lec-03 Dijkstra_Algo
4
Mod-01 Lec-04 All Pair Shortest Path
5
Mod-01 Lec-05 Matriods
6
Mod-01 Lec-06 Minimum Spanning Tree
7
Mod-01 Lec-07 Edmond\\\'s Matching Algo I
8
Mod-01 Lec-08 Edmond\'s Matching Algo II
9
Mod-01 Lec-09 Flow Networks
10
Mod-01 Lec-10 Ford Fulkerson Method
11
Mod-01 Lec-11 Edmond Karp Algo
12
Mod-01 Lec-12 Matrix Inversion
13
Mod-01 Lec-13 Matrix Decomposition
14
Mod-01 Lec-14 Knuth Morris Pratt Algo
15
Mod-01 Lec-15 Rabin Karp Algo
16
Mod-01 Lec-16 NFA Simulation
17
mod-01 Lec-17 Integer-Polynomial Ops I
18
Mod-01 Lec-18 Integer-Polynomial Ops II
19
Mod-01 Lec-19 Integer-Polynomial OpsIII
20
Mod-01 Lec-20 Chinese Remainder I
21
Mod-01 Lec-21 Chinese Remainder II
22
Mod-01 Lec-22 Chinese Remainder III
23
Mod-01 Lec-23 Discrete Fourier Transform I
24
Mod-01 Lec-24 Discrete Fourier Transform II
25
Mod-01 Lec-25 Discrete Fourier Transform III
26
Mod-01 Lec-26 Schonhage Strassen Algo
27
Mod-01 Lec-27 Linear Programming I
28
Mod-01 Lec-28 Linear Programming II
29
Mod-01 Lec-29 Geometry I
30
Mod-01 Lec-30 Geometry II
31
Mod-01 Lec-31 Geometry III
32
Mod-01 Lec-32 Approximation Algo I
33
Mod-01 Lec-33 Approximation Algo II
34
Mod-01 Lec-34 Approximation Algo III
35
Mod-01 Lec-35 General: Dynamic Programming
Description:
Instructor: Prof. Dr. Shashank K. Mehta, Department of Computer Science and Engineering, IIT Kanpur. The course discusses efficient algorithms from a large number of domains. This course assumes the knowledge of data structures, the knowledge big-O notation and the concept of time and space complexity of an algorithm. And also it will not introduce divide and conquer, dynamic programming, and greedy paradigms. This course will discuss graph algorithms, network-flow algorithms, geometric algorithms, string matching, matrix algorithms, polynomial computation algorithms, and number-theoretic algorithms.

Computer Algorithms - 2

NPTEL
Add to list
#Computer Science #Algorithms and Data Structures #Mathematics #Geometry #Linear Programming #Algorithms #Graph Algorithms #Dynamic programming #Engineering #Electrical Engineering #Signal Processing #Discrete Fourier Transforms #Algebra #Linear Algebra #Matrix Operations #Approximation Algorithms
0:00 / 0:00
1 of 35

Mod-01 Lec-01 Graph_Basics