Design & Analysis of Algorithms Online Course

NPTEL is offering online course for undergraduate students in Design and Analysis of algorithms.

About the course:

• This course will cover basic concepts in the design and analysis of algorithms.
• Asymptotic complexity, O() notation
• Sorting and search
• Algorithms on graphs: exploration, connectivity, shortest paths, directed acyclic graphs, spanning trees
• Design techniques: divide and conquer, greedy, dynamic programming
• Data structures: heaps, union of disjoint sets, search trees
• Intractability

Course Layout:

• Introduction
• Examples and motivation
• Examples and motivation
• Asymptotic complexity: informal concepts
• Asymptotic complexity: formal notation
• Asymptotic complexity: examples
• Assignments MCQ/Fill in blanks (unique answer)
• Searching in list: binary search
• Sorting: insertion sort
• Sorting: selection sort

Duration: 08 weeks

Enrollment Ends: September 21, 2020

For more details, please visit: https://onlinecourses.nptel.ac.in/noc20_cs71/preview