Algorithm

Asymptotic worst case time and space complexity.

Searching, sorting, hashing.

Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths.


Your Instructor


Dr. Ankush Mittal
Dr. Ankush Mittal
  • B. Tech. CSE (IIT Delhi) ‘96
  • M. S. (Research), CSE(IIT Delhi) ‘98
  • Ph.D. (National University of Singapore), 2001
  • Outstanding Teacher Award from IIT Roorkee
  • IBM International Faculty Award

Course Curriculum


  Lecture 1
Available in days
days after you enroll
  Lecture 2
Available in days
days after you enroll
  Lecture 3
Available in days
days after you enroll
  Lecture 4
Available in days
days after you enroll
  Lecture 5
Available in days
days after you enroll
  Lecture 6
Available in days
days after you enroll
  Lecture 7
Available in days
days after you enroll
  Lecture 8
Available in days
days after you enroll
  Subject Test
Available in days
days after you enroll
  GATE Previous Year Questions
Available in days
days after you enroll

"Sir explained the fundamentals of each topic (like Time Complexity, Space Complexity, Greedy Algorithms, Dynamic Programming etc.) with such a clarity and real life examples. I could solve questions myself after attending this course."

- Hemant Sadana, M.tech IIT K