Algorithms and Complexity
Completed by Ashutosh Raj
September 24, 2026
19 hours (approximately)
Ashutosh Raj's account is verified. Coursera certifies their successful completion of Algorithms and Complexity
What you will learn
Design finite automata and explain how deterministic and non-deterministic machines recognise and process formal languages.
Implement, compare, and evaluate searching and sorting algorithms, analysing their performance and correctness in different contexts.
Create recursive and iterative algorithms, identifying scenarios where each approach provides clarity, efficiency, or scalability.
Analyse algorithms with asymptotic notation, explain complexity classes like P and NP, and interpret NP-completeness in computing.
Skills you will gain
- Category: Complex Problem Solving
- Category: Mathematical Theory & Analysis
- Category: Theoretical Computer Science
- Category: Game Theory
- Category: Data Structures
- Category: Analysis
- Category: Critical Thinking and Problem Solving
- Category: Classification Algorithms
- Category: Computational Thinking
- Category: Critical Thinking
- Category: Computational Logic
- Category: Algorithms
