Computer Algorithms

IIT Kanpur Course , Prof. Shashank K. Mehta

335 students enrolled

Overview

Contents:
Graph_Basics - Breadth_First_Search - Dijkstra_Algo - All Pair Shortest Path - Matriods - Minimum Spanning Tree - Edmond's Matching Algo - Flow Networks - Ford Fulkerson Method - Edmond Karp Algo - Matrix Inversion - Matrix Decomposition - Knuth Morris Pratt Algo - Rabin Karp Algo - NFA Simulation - Integer-Polynomial Ops - Chinese Remainder - Discrete Fourier Transform - Schonhage Strassen Algo - Linear Programming - Geometry - Approximation Algo - General: Dynamic Programming - Computer Algorithms

Lecture 1: Graph_Basics

Up Next
You can skip ad in
SKIP AD >
Advertisement
      • 2x
      • 1.5x
      • 1x
      • 0.5x
      • 0.25x
        EMBED LINK
        COPY
        DIRECT LINK
        PRIVATE CONTENT
        OK
        Enter password to view
        Please enter valid password!
        0:00
        3.5 (41 Ratings)

        Lecture Details

        Computer Algorithms - 2 by Prof. Shashank K. Mehta,Department of Computer Science and Engineering,IIT Kanpur.For more details on NPTEL visit httpnptel.ac.in

        LECTURES



        Review


        3.5

        41 Rates
        5
        37%
        15
        4
        24%
        10
        3
        12%
        5
        2
        7%
        3
        1
        20%
        8

        Comments Added Successfully!
        Please Enter Comments
        Please Enter CAPTCHA
        Invalid CAPTCHA
        Please Login and Submit Your Comment