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

Design and Analysis of Algorithms. Instructor: Prof. Madhavan Mukund, Chennai Mathematical Institute.

This course will cover basic concepts in the design and analysis of algorithms: analysis of algorithms; searching and sorting; algorithms on graphs; data structures - union-find and heaps, divide-and-conquer, search trees, greedy algorithms; dynamic programming; linear programming and network flows, intractability. (from nptel.ac.in)

Course Curriculum

    • Lecture 01 – Course Outline Unlimited
    • Lecture 02 – Example: Air Travel Unlimited
    • Lecture 03 – Example: Xerox Shop Unlimited
    • Lecture 04 – Example: Document Similarity Unlimited
    • Lecture 05 – Introduction and Motivation Unlimited
    • Lecture 06 – Input Size, Worst Case, Average Case Unlimited
    • Lecture 07 – Quantifying Efficiency: O(), Omega(), Theta() Unlimited
    • Lecture 08 – Examples: Analysis of Iterative and Recursive Algorithms Unlimited
    • Lecture 09 – Arrays and Lists Unlimited
    • Lecture 10 – Searching in an Array Unlimited
    • Lecture 11 – Selection Sort Unlimited
    • Lecture 12 – Insertion Sort Unlimited
    • Lecture 13 – Merge Sort Unlimited
    • Lecture 14 – Merge Sort: Analysis Unlimited
    • Lecture 15 – Quicksort Unlimited
    • Lecture 16 – Quicksort: Analysis Unlimited
    • Lecture 17 – Sorting: Concluding Remarks Unlimited
    • Lecture 18 – Introduction to Graphs Unlimited
    • Lecture 19 – Representing Graphs Unlimited
    • Lecture 20 – Breadth First Search (BFS) Unlimited
    • Lecture 21 – Depth First Search (DFS) Unlimited
    • Lecture 22 – Application of BFS and DFS Unlimited
    • Lecture 23 – Directed Acyclic Graphs: Topological Sort Unlimited
    • Lecture 24 – Directed Acyclic Graphs: Longest Paths Unlimited
    • Lecture 25 – Single Source Shortest Paths: Dijkstra’s Algorithm Unlimited
    • Lecture 26 – Dijkstra’s Algorithm: Analysis Unlimited
    • Lecture 27 – Negative Edge Weights: Bellman-Ford Algorithm Unlimited
    • Lecture 28 – All Pairs Shortest Paths Unlimited
    • Lecture 30 – Prim’s Algorithm Unlimited
    • Lecture 31 – Kruskal’s Algorithm Unlimited
    • Lecture 32 – Union Find using Arrays Unlimited
    • Lecture 33 – Union Find using Pointers Unlimited
    • Lecture 34 – Priority Queues Unlimited
    • Lecture 35 – Heaps Unlimited
    • Lecture 36 – Heaps: Updating Values, Sorting Unlimited
    • Lecture 37 – Divide and Conquer: Counting Inversions Unlimited
    • Lecture 38 – Divide and Conquer: Closest Pair of Points Unlimited
    • Lecture 39 – Binary Search Trees Unlimited
    • Lecture 40 – Balanced Search Trees Unlimited
    • Lecture 41 – Greedy Algorithms: Interval Scheduling Unlimited
    • Lecture 42 – Scheduling with Deadlines: Minimizing Lateness Unlimited
    • Lecture 43 – Greedy Algorithms: Huffman Codes Unlimited
    • Lecture 44 – Introduction to Dynamic Programming Unlimited
    • Lecture 45 – Memoization Unlimited
    • Lecture 46 – Grid Paths Unlimited
    • Lecture 47 – Common Subwords and Subsequences Unlimited
    • Lecture 48 – Edit Distance Unlimited
    • Lecture 49 – Matrix Multiplication Unlimited
    • Lecture 50 – Linear Programming Unlimited
    • Lecture 51 – LP Modelling: Production Planning Unlimited
    • Lecture 52 – LP Modelling: Bandwidth Allocation Unlimited
    • Lecture 53 – Network Flows Unlimited
    • Lecture 54 – Reductions Unlimited
    • Lecture 55 – Intractability: Checking Algorithms Unlimited
    • Lecture 56 – Intractability: P and NP 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.