Theoretical Computer Science Courses and Certifications

The Julia Programming Language

Computational Thinking - MIT 18.S191/6.S083 Spring 2021

Master computational thinking through Julia programming while tackling real-world problems in data analysis, mathematical modeling, and climate science with integrated CS concepts.

• YouTube
• 23 hours 24 minutes
• Self-Paced
• Free Video

Data Compression I - Lecture 2: Prefix Free Codes

1 rating

Explore prefix-free codes in data compression, covering theory and applications. Gain insights from Stanford experts on efficient information encoding techniques.

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

Data Compression I - Course Introduction and Lossless Compression Basics - Lecture 1

Introduction to lossless data compression fundamentals, covering key concepts and techniques for efficient information storage and transmission.

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

Data Compression I - Lecture 5: Asymptotic Equipartition Property

Explore the Asymptotic Equipartition Property in data compression, a fundamental concept for understanding information theory and efficient coding techniques.

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

Context-based Arithmetic Coding and LLM Compression - Stanford EE274 Lecture 9

Explore context-based arithmetic coding and compression techniques for large language models in this advanced lecture on data compression theory and applications.

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

Data Compression I - Lecture 4: Huffman Codes

Explore Huffman coding, a fundamental data compression technique, in this Stanford lecture. Learn its principles, implementation, and applications in information theory.

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

Data Compression I - Lecture 3: Kraft Inequality, Entropy, and Introduction to SCL

Explore Kraft Inequality, entropy, and Source Coding Limit in data compression. Gain insights into fundamental concepts and their applications in information theory and coding.

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

Stanford EE274: Data Compression - Beyond IID Distributions: Conditional Entropy - Lecture 8

Explore conditional entropy and advanced data compression techniques beyond IID distributions in this Stanford lecture, enhancing understanding of complex information theory concepts.

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

LZ and Universal Compression - Lecture 10

Explore Lempel-Ziv algorithms and universal compression techniques in this Stanford lecture, delving into advanced data compression theory and applications.

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

Arithmetic Coding - Stanford EE274 Data Compression I Lecture 6

Explore arithmetic coding in data compression, covering theory and applications. Learn from Stanford experts about this advanced technique for efficient information encoding.

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

Lossy Compression Basics and Quantization - Lecture 11

Explore lossy compression fundamentals and quantization techniques in this Stanford lecture, covering essential concepts for efficient data reduction in various applications.

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

Asymmetric Numeral Systems (ANS) - Data Compression Lecture 7

Explore Asymmetric Numeral Systems (ANS), an advanced data compression technique, in this Stanford lecture. Gain insights into its principles, applications, and advantages in modern compression algorithms.

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

Sundeep Saradhi Kanthety

Greibach Normal Form and Conversion of Context Free Grammar to GNF in Automata Theory

1 rating

Explore Greibach Normal Form and learn how to convert context-free grammars to GNF. Gain insights into this important concept in automata theory and formal language processing.

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

Sundeep Saradhi Kanthety

Conversion of Finite Automata to Regular Expression Using Arden's Method in Automata Theory

1 rating

Learn to convert finite automata to regular expressions using Arden's method in automata theory. Explore step-by-step process with examples to master this important concept in theoretical computer science.

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

Sundeep Saradhi Kanthety

Conversion of NFA with Epsilon to NFA Without Epsilon in Automata Theory

1 rating

Learn to convert NFA with epsilon transitions to NFA without epsilon, a crucial skill in automata theory. Understand the step-by-step process and its importance in simplifying finite automata representations.

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