0

(

ratings

)

1

students

Created by:

Profile Photo

Last updated:

September 25, 2023

Duration:

Unlimited Duration

FREE

This course includes:

Unlimited Duration

Badge on Completion

Certificate of completion

Unlimited Duration

Description

Computer Algorithms 2. 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. (from nptel.ac.in)

Course Curriculum

  • Lecture 01 – Graph Basics Unlimited
  • Lecture 02 – Breadth First Search Unlimited
  • Lecture 03 – Dijkstra’s Algorithm Unlimited
  • Lecture 04 – All Pair Shortest Path Unlimited
  • Lecture 05 – Matriods Unlimited
  • Lecture 06 – Minimum Spanning Tree Unlimited
  • Lecture 07 – Edmonds’ Matching Algorithm I Unlimited
  • Lecture 08 – Edmonds’ Matching Algorithm II Unlimited
  • Lecture 09 – Flow Networks Unlimited
  • Lecture 10 – Ford-Fulkerson Method Unlimited
  • Lecture 11 – Edmonds-Karp Algorithm Unlimited
  • Lecture 12 – Matrix Inversion Unlimited
  • Lecture 13 – Matrix Decomposition Unlimited
  • Lecture 14 – Knuth-Morris-Pratt Algorithm Unlimited
  • Lecture 15 – Rabin-Karp Algorithm Unlimited
  • Lecture 16 – NFA Simulation Unlimited
  • Lecture 17 – Integer-Polynomial Operations I Unlimited
  • Lecture 18 – Integer-Polynomial Operations II Unlimited
  • Lecture 19 – Integer-Polynomial Operations III Unlimited
  • Lecture 20 – Chinese Remainder Theorem I Unlimited
  • Lecture 21 – Chinese Remainder Theorem II Unlimited
  • Lecture 22 – Chinese Remainder Theorem III Unlimited
  • Lecture 23 – Discrete Fourier Transforms I Unlimited
  • Lecture 24 – Discrete Fourier Transforms II Unlimited
  • Lecture 25 – Discrete Fourier Transforms III Unlimited
  • Lecture 26 – Schonhage-Strassen Algorithm Unlimited
  • Lecture 27 – Linear Programming I Unlimited
  • Lecture 28 – Linear Programming II Unlimited
  • Lecture 29 – Geometric Algorithms I Unlimited
  • Lecture 30 – Geometric Algorithms II Unlimited
  • Lecture 31 – Geometric Algorithms III Unlimited
  • Lecture 32 – Approximation Algorithms I Unlimited
  • Lecture 33 – Approximation Algorithms II Unlimited
  • Lecture 34 – Approximation Algorithms III Unlimited
  • Lecture 35 – Dynamic Programming Unlimited

About the instructor

5 5

Instructor Rating

6

Reviews

4637

Courses

24151

Students

Profile Photo
OpenCoursa
We are an educational and skills marketplace to accommodate the needs of skills enhancement and free equal education across the globe to the millions. We are bringing courses and trainings every single day for our users. We welcome everyone woth all ages, all background to learn. There is so much available to learn and deliver to the people.