Home »Computer Science »IIT Kanpur » Computer Algorithms



Computer Algorithms

Lecture 39: Mod-01 Lec-39 Computer Algorithms - 2

Embed
Download:   MP4, FLV and 3GP 312 views

SEE: Guide to Download NPTEL Video Lecture

Lecture Details :

Computer Algorithms - 2 by Prof. Shashank K. Mehta, Department of Computer Science Engineering, IIT Kanpur. For more details on NPTEL visit http://nptel.iitm.ac.in

Course Description :

This course assumes the knowledge of data-structures.
It also assumes the knowledge big-O notation and the concept of time and space complexity of an algorithm.
The course also will not introduce divide and conquer, dynamic programming, and greedy paradigms.
The course will discuss eff cient algorithms from a large number of domains.
Contents :
Graph algorithm: search algorithms, computation of strongly connected components, shortest distance algorithms, minimum spanning tree algorithms.

Network-flow algorithm: Ford-Fulkerson method; pref ow-push algorithm;

Geometric algorithm: convex-hull computation, line-segment intersection computation, closest-pair computation;

String matching: Rabin Karp algorithm, Knuth-Morris-Pratt algorithm, Boyer-Moore algorithm;
Matrix algorithms: Strassen’s multiplication algorithm, LU decomposition, inverse computation; Polynomial computation algorithms: multiplication using DFT, division;

Number theoretic algorithms: division, solution of modular linear equation, primality testing.

Other Resources :

Syllabus | Citation |

Other Computer Science Courses

» check out the complete list of Computer Science Video lectures          

 

Computer Science Lecture Notes

 

Comments

Post your Comments