Theoretical Computer Science Courses and Certifications

Birla Institute Of Technology And Science–Pilani (BITS–Pilani)

Automata and Computability

Design finite automata, context-free grammars, and Turing machines, prove language properties with pumping lemmas and normal forms, and classify problems as decidable, P, NP or NP-complete.

• Coursera
• 10 weeks, 6 hours a week
• Self-Paced
• Paid Course

Birla Institute Of Technology And Science–Pilani (BITS–Pilani)

Formal Languages and Applications

Build lexical analyzers and parsers while studying regular expressions, DFA minimization, context-free grammars, recursive descent, LL(1) and LR(0) parsing, and POS tagging.

• Coursera
• 10 weeks, 6 hours a week
• Self-Paced
• Paid Course

Algorithmic Lower Bounds: Fun with Hardness Proofs

The class focuses on reductions and techniques for proving problems are computationally hard for a variety of complexity classes.

• MIT OpenCourseWare
• 31 hours
• Self-Paced
• Free Video

Introduction to Computational Thinking

Apply computational thinking across images, data science, and climate: build seam carving, automatic differentiation, principal component analysis, stochastic simulations, and ODE-based climate models.

• MIT OpenCourseWare
• Self-Paced
• Free Online Course

Principles of Digital Communication II

Approach the Shannon limit on AWGN channels: design and analyze binary block, Reed-Solomon, convolutional, turbo and LDPC codes with Viterbi, sum-product and BCJR decoding.

• MIT OpenCourseWare
• Self-Paced
• Free Online Course

Introduction to computational thinking

15 ratings at OpenLearn

Explore how algorithms, abstraction, models, and automation shape computational thinking across biology, physics, economics, and sport science.

• OpenLearn
• 12 hours
• Self-Paced
• Free Certificate

NP-Complete Problems

Learn about NP-complete problems, known as hard problems that can’t be solved efficiently, and practice solving them using algorithmic techniques.

• edX
• 3 weeks, 8-10 hours a week
• Self-Paced
• Free Online Course (Audit)

3Blue1Brown

Solving Wordle Using Information Theory

Uses Wordle to explain information theory and entropy, then builds a bot that chooses guesses by maximizing expected information.

• YouTube
• 31 minutes
• Self-Paced
• Free Video

3Blue1Brown

How to Send a Self-Correcting Message - Hamming Codes

An introduction to how Hamming codes make messages self-correcting through error correction.

• YouTube
• 20 minutes
• Self-Paced
• Free Video

Introduction to computational thinking

14 ratings at OpenLearn

You will learn about algorithms and abstraction in this free course, Introduction to computational thinking, and encounter some applications of computational thinking in various disciplines, ...

• OpenLearn
• 12 hours
• Self-Paced
• Free Certificate

Ryan O'Donnell

Great Ideas in Theoretical Computer Science: Countability and Diagonalization

Explore countability and diagonalization through cardinality, bijections, infinite sets, and uncomputable real numbers.

• YouTube
• 1 hour 14 minutes
• Self-Paced
• Free Video

Ryan O'Donnell

Great Ideas in Theoretical Computer Science - On Proofs

Explores what counts as a mathematical proof, how to discover one, and how to write clear proofs, including computer-assisted examples.

• YouTube
• 1 hour 3 minutes
• Self-Paced
• Free Video

Coding for Your Classroom 4 - 10

Self-paced, asynchronous course aimed to build educators’ comfortability and confidence in digital literacy. Through hands-on learning activities and demos in a variety of web-based platforms, educato

• edX
• 4 weeks, 1-2 hours a week
• Self-Paced
• Free Certificate

LAFF – On Programming for Correctness

Learn to apply formal methods to systematically develop correct, loop-based programs, an essential skill for computer programmers.

• edX
• 7 weeks, 4-6 hours a week
• Self-Paced
• Free Online Course (Audit)

Introduction to Computation Theory

2 ratings

Students will examine the formal mathematics for foundational computation proofs, as well as gain tools to analyze hard computational problems themselves.

• Complexity Explorer
• 1 hour
• Self-Paced
• Free Certificate