Algorithms and Complexity
Completed by Shreejit Pal
April 16, 2026
19 hours (approximately)
Shreejit Pal'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: Data Structures
- Category: Analysis
- Category: Critical Thinking and Problem Solving
- Category: Logical Reasoning
- Category: Critical Thinking
- Category: Computational Thinking
- Category: Graph Theory
- Category: Computer Science
- Category: Game Theory
- Category: Theoretical Computer Science
- Category: Mathematical Theory & Analysis
- Category: Complex Problem Solving
