Learn · NPTEL

Course10610800149 lectures

Intermediary Algorithm

Prof. C Pandu Rangan · IISc Bangalore

Start with lecture 1 At NPTEL

About

A typical UG course on algorithms will cover some of these topics but at an introductory level. These algorithms are based on great ideas and there is a delightful/advanced mathematics involved in the analysis of these algorithms. The aim of this course is to give an advanced and more complete treatment of the topics listed.

Intended audience: B.Tech 3rd or 4th year, M.Tech

Prerequisites: B.Tech (Discrete Maths, Basic Data Structures/ Algorithms)

Lectures

Week 1 Divide and Conquer 1

  1. Merge Sort YouTube
  2. Analysis of Merge Sort - Part 1 YouTube
  3. Analysis of Merge Sort - Part 2 YouTube
  4. Analysis of Merge Sort - Part 3 YouTube

Week 2 Divide and Conquer 2

  1. Finding MIN & MAX YouTube
  2. Analysis of MIN-MAX Algorithm - Part 1 YouTube
  3. Analysis of MIN-MAX Algorithm - Part 2 YouTube
  4. Analysis of MIN-MAX Algorithm - Part 3 YouTube
  5. Analysis of MIN-MAX Algorithm - Part 4 YouTube

Week 3 Divide and Conquer 3

  1. Karastuba's Algorithm YouTube
  2. Analysis of Karastuba's Algorithm YouTube
  3. More for less YouTube
  4. Maximum Subarray Sum Part 1 YouTube
  5. Maximum Subarray Sum Part 2 YouTube

Week 4 Divide and Conquer 4

  1. Inversion Count Problem Part 1 YouTube
  2. Inversion Count Problem Part 2 YouTube
  3. Dominance Count Problem YouTube
  4. Closest Pair Problem Part 1 YouTube
  5. Closest Pair Problem Part 2 YouTube
  6. Closest Pair Problem Part 3 YouTube

Week 5 Greedy Algorithms 1

  1. Greedy Algorithm YouTube
  2. Knapsack Problem YouTube
  3. Huffman Codes Part 1 YouTube
  4. Huffman Codes Part 2 YouTube
  5. Huffman Codes Part 3 YouTube

Week 6 Greedy Algorithms 2

  1. Minimum Spanning Tree Part 1 YouTube
  2. Minimum Spanning Tree Part 2 YouTube
  3. Minimum Spanning Tree Part 3 YouTube

Week 7 Greedy Algorithms 3

  1. Minimum Spanning Tree Part 4 YouTube
  2. Minimum Spanning Tree Part 5 YouTube
  3. Minimum Spanning Tree Part 6 YouTube

Week 8 Greedy Algorithms 4

  1. Amortized Analysis Part 1 YouTube
  2. Amortized Analysis Part 2 YouTube
  3. Splay Trees Part 1 YouTube
  4. Splay Trees Part 2 YouTube

Week 9 Greedy Algorithms 5

  1. Fibonacci Heap Part 1 YouTube
  2. Fibonacci Heap Part 2 YouTube
  3. Fibonacci Heap Part 3 YouTube
  4. Fibonacci Heap Part 4 YouTube

Week 10 Graph Algorithms 1

  1. Prim's Algorithm Part 1 YouTube
  2. Prim's Algorithm Part 2 YouTube
  3. Prim's Algorithm Part 3 YouTube

Week 11 Graph Algorithms 2

  1. Depth First Search - Part 1 YouTube
  2. Depth First Search - Part 2 YouTube
  3. Depth First Search - Part 3 YouTube
  4. Depth First Search - Part 4 YouTube

Week 12 Graph Algorithms 3

  1. Strongly Connected Components Part 1 YouTube
  2. Strongly Connected Components Part 2 YouTube
  3. Lower Bound for MIN-MAX Algorithm YouTube

Syllabus and materials

At NPTEL, as the course publishes them.

Credits and licence

Institution
IISc Bangalore
Department
Computer Science and Engineering
Teacher
Prof. C Pandu Rangan
Level
Undergraduate
Language
English
Subjects
Computer science, Engineering
Source
NPTEL
Licence
CC BY-NC-SA, as NPTEL states it. Non-commercial use only. NPTEL's terms
Attribution
NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
Who can watch
NPTEL gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed