Fundamental Algorithms: Design and Analysis

Offered byNPTEL

Fundamental Algorithms: Design and Analysis
at
NPTEL
Overview

Essential Algorithms: Crafting and Assessing Fundamental Computational Strategies

Duration	4 weeks
Total fee	Free
Mode of learning	Online
Official Website	Explore Free Course
Credential	Certificate

Fundamental Algorithms: Design and Analysis
at
NPTEL
Highlights

Attain a certification upon completion
Highly Qualified Trainers
Doubt Support Available

Fundamental Algorithms: Design and Analysis
at
NPTEL
Course details

Skills you will learn

Statistics Data structures

Who should do this course?

Core, UG /PG, B.Tech/B.E./M.Tech/M.Sc.

What are the course deliverables?

Week 1: Insertion Sort, Asymptotic Notation, Merge Sort, QuickSort, Divide and Conquer
Week 2: Heap Sort, Linear-time Sorting, Order Statistics
Week 3: Hashing, BST Sort, Augmenting Data Structures, Dynamic Programming
Week 4: Graphs : BFS, DFS, Prim's, Shortest Paths

More about this course

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems.
The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems.

Fundamental Algorithms: Design and Analysis
at
NPTEL
Curriculum

Fundamental Algorithms: Design and Analysis
at
NPTEL
Faculty details

Prof. Sourav Mukhopadhyay

Sourav Mukhopadhyay is an Associate Professor, Department of Mathematics at Indian Institute of Technology Kharagpur. He has completed his B.Sc (Honours in Mathematics) in1997 from University of Calcutta, India. He has done M.Stat (in statistics) and M.Tech (in computer science) from Indian Statistical Institute, India, in 1999 and 2001 respectively. He worked with Cryptology Research Group at Indian Statistical Institute as a PhD student and received his Ph.D. degree in Computer Science from there in 2007.