| 201. | Smooth Functions (Big-Oh Bootcamp) | 38:40 | |
|
| 202. | Twitch Clips - Mega Man 5, December 15, 2021 | 37:43 | | Mega Man 5
|
| 203. | 3. Reposition Strategy for k-Canadian Travelling (Haunted Escape) | 37:27 | |
|
| 204. | What is a Hash Function? (Hashing: Fundamentals and Algorithms) | 37:19 | |
|
| 205. | Combinations (k-Combinations) [Mathematics for Computer Science] | 37:18 | |
|
| 206. | Twitch Clips - Legend of Zelda: Oracle of Ages (Part 16), November 17, 2021 [FINALE] | 36:53 | | The Legend of Zelda: Oracle of Ages
|
| 207. | Proving Correctness of DFAs via State Invariants II [FULL EXAMPLE 2] (Theory of Computing) | 36:42 | |
|
| 208. | What are Regular Expressions? (Theory of Computing) | 36:25 | |
|
| 209. | Tips on Using the Pumping Lemma to Prove Languages are Not Regular (Theory of Computing) | 36:05 | |
|
| 210. | Dan Plays Monster Hunter Rise: Sunbreak (Demo) | 35:53 | | Monster Hunter Rise
|
| 211. | Basic Concepts (Hashing: Fundamentals and Algorithms) | 35:15 | |
|
| 212. | Principle of Mathematical Induction (with full examples) [Mathematics for CS] | 34:29 | |
|
| 213. | Twitch Clips - Mega Man 4 (RACE VS. TOR ASBJOERN,) December 26, 2021 | 34:23 | |
|
| 214. | Cut Property of Minimum Spanning Trees & Algorithms (Graphs: Algorithms & Theory) | 34:08 | |
|
| 215. | 2. Our First Computer Program [1st Steps to Computer Programming using Java] | 33:40 | |
|
| 216. | Separate Chaining (Hashing: Fundamentals and Algorithms) | 33:24 | |
|
| 217. | Proving a Context-Free Grammar is Correct (Theory of Computing) | 33:19 | |
|
| 218. | Instantaneous Descriptions, Language of a Pushdown Automaton (Theory of Computing) | 32:58 | |
|
| 219. | Twitch Clips - Legend of Zelda: Oracle of Ages (Part 9), September 1, 2021 | 32:48 | | The Legend of Zelda: Oracle of Ages
|
| 220. | Pascal's Triangle and Formula (Mathematics for Computer Science) | 32:44 | |
|
| 221. | How to Represent a Graph (Graphs: Algorithms & Theory) | 32:42 | |
|
| 222. | Graphs & Pigeonhole Principle: Two (or More) Vertices Have The Same Degree (Mathematics for CS) | 31:38 | |
|
| 223. | CSCI550 - Lecture 1 (Part 1): Course Introduction | 31:07 | |
|
| 224. | Lazy Subset Construction for ε-NFAs (Converting ε-NFAs to DFAs) [Theory of Computing] | 30:54 | |
|
| 225. | Correctness of Dijkstra's Algorithm (Graphs: Algorithms & Theory) | 30:50 | |
|
| 226. | Pi Day 2022 Talk - Limits of Approximability, Magic Numbers in Scheduling | 30:27 | |
|
| 227. | Complexity and Correctness of Linear Search (Searching) | 30:17 | |
|
| 228. | Applying Kleene's DFA to Regex Construction (Theory of Computing) | 30:11 | |
|
| 229. | The Pumping Lemma for Regular Languages [FULL PROOF] (Theory of Computing) | 29:54 | |
|
| 230. | Exponents in Logarithms and Big-Oh (Big-Oh Bootcamp) | 29:49 | Vlog |
|
| 231. | Dijkstra's Algorithm WITH FULL EXAMPLE (Graphs: Algorithms & Theory) | 29:48 | |
|
| 232. | Harmonic Number H(n) is O(log n)) (Big-Oh Bootcamp) | 29:47 | Vlog |
|
| 233. | Twitch Clips - Legend of Zelda: Oracle of Ages (Part 13), October 8, 2021 | 29:34 | | The Legend of Zelda: Oracle of Ages
|
| 234. | Graph Terminology II (Graphs: Algorithms & Theory) | 29:18 | Vlog |
|
| 235. | Twitch Livestream March 12, 2021 - Kirby's Dreamland [Full Livestream] | 29:15 | |
|
| 236. | Formal Definition of Computing for DFAs (Theory of Computing) | 29:11 | |
|
| 237. | Regular Languages are Context-Free & More! (Theory of Computing) | 29:09 | |
|
| 238. | CSCI355 - Lecture 1 (Part 1): Course Introduction | 29:03 | |
|
| 239. | Logic By Machine | 29:01 | |
|
| 240. | 5. Myopic and Comparison Strategies for k-Canadian Travelling (Haunted Escape) | 28:19 | |
|
| 241. | Proving Smooth Functions are b-Smooth [Big-Oh Bootcamp] | 28:06 | |
|
| 242. | n Choose k Equals n Choose n-k | 27:58 | |
|
| 243. | Pumping Lemma for Regular Languages: A Gentle Introduction (Theory of Computing) | 27:54 | |
|
| 244. | Review of Exponents and Logarithms (Big-Oh Bootcamp) | 27:49 | Vlog |
|
| 245. | Single Exponents in Logarithms [Big-Oh Bootcamp] | 27:42 | |
|
| 246. | Introduction to Mathematical Sequences, and How to Derive a Sequence | 27:33 | |
|
| 247. | Adversarial Argument and Searching Lower Bound (Searching: Algorithms and Lower Bounds) | 27:32 | |
|
| 248. | Multiplication Principle, Number of Ordered Sequences with Repeats (Maths for Computer Science) | 27:27 | |
|
| 249. | Twitch Clips - Legend of Zelda: Oracle of Seasons (Part 4), June 26, 2021 | 27:14 | | The Legend of Zelda: Oracle of Seasons
|
| 250. | What are Nondeterministic Finite Automata with Epsilon-Transitions? (Theory of Computing) | 27:09 | |
|
| 251. | Twitch Clips - Legend of Zelda: Oracle of Seasons (Part 7), July 22, 2021 | 27:06 | | The Legend of Zelda: Oracle of Seasons
|
| 252. | Lecture 1: Data Structures [Advanced Data Structures] | 26:51 | |
|
| 253. | Twitch (& Friends) Clips - Diablo II, May 12-13, 2021 | 26:50 | | Diablo II
|
| 254. | Solving Recurrence Relations via Iteration | 26:42 | |
|
| 255. | Big-Oh Definition, Proving 2n-1 is O(n) (FULL EXAMPLE) | 26:24 | |
|
| 256. | Single-Source Shortest Path Problem (Graphs: Algorithms & Theory) | 25:59 | |
|
| 257. | Twitch Clips - Pokemon Silver, December 15, 2021 | 25:55 | | Pokémon Gold and Silver
|
| 258. | Cycle Detection and Path Finding (Graphs: Algorithms & Theory) | 25:54 | |
|
| 259. | Large (Enough) Groups and the Pigeonhole Principle (Mathematics for Computer Science) | 25:50 | |
|
| 260. | Minimum Spanning Trees & Optimization Problems (Graphs: Algorithms & Theory) | 25:41 | |
|
| 261. | The Handshaking Lemma (Graphs: Algorithms & Theory) | 25:06 | |
|
| 262. | What is the Averaging Principle? [FULL PROOF & MORE] (Maths for Computer Science) | 25:04 | |
|
| 263. | Proving 1 + 2 + 3 + … + n = n(n+1)/2 using Mathematical Induction | 25:01 | |
|
| 264. | Twitch Clips - Legend of Zelda: Oracle of Seasons (Part 3), June 2, 2021 | 24:06 | | The Legend of Zelda: Oracle of Seasons
|
| 265. | What is little-Oh? "Is" and "not is" Claims! | 24:00 | |
|
| 266. | CSCI255 Lecture 0: Course Introduction | 23:54 | |
|
| 267. | Formal Definition of Computing for NFAs (Theory of Computing) | 23:53 | |
|
| 268. | Designing Context-Free Grammars I (Theory of Computing) | 23:44 | |
|
| 269. | Properties of Pascal's Triangle (Mathematics for Computer Science) | 23:34 | |
|
| 270. | Averaging Principle: Graphs with Less Than n-1 Edges are Disconnected (Maths for Computer Science) | 23:18 | |
|
| 271. | How Do ε-NFAs Work? ε-Closures & More! (Theory of Computing) | 23:15 | |
|
| 272. | Application of the Pumping Lemma: Not All Languages are Regular (Theory of Computation) | 23:14 | |
|
| 273. | Exponents and Logarithms [Mathematics for CS] | 23:06 | |
|
| 274. | Proving the Correctness of the Subset Construction (Theory of Computing) | 22:46 | |
|
| 275. | General Big-Oh Proof Technique for Polynomials [Big-Oh Bootcamp] | 22:27 | |
|
| 276. | Pigeonhole Principle [FULL PROOF] (Mathematics for CS) | 22:09 | |
|
| 277. | Representing Pushdown Automata (Basic Example) [Theory of Computing] | 22:08 | |
|
| 278. | Twitch Clips - Super Mario Land 2 DX, November 24, 2021 | 22:08 | | Super Mario Land 2: 6 Golden Coins
|
| 279. | Twitch Clips - Legend of Zelda: Oracle of Ages (Part 15), November 11, 2021 | 21:53 | | The Legend of Zelda: Oracle of Ages
|
| 280. | For any n+1 integers, some difference of two of them is divisible by n - Pigeonhole Principle | 21:46 | |
|
| 281. | Twitch Clips - Final Fantasy XIV Online, December 9, 2021 | 21:39 | | Final Fantasy XIV
|
| 282. | Twitch Clips - Legend of Zelda: Oracle of Ages (Part 10), September 8, 2021 | 21:35 | | The Legend of Zelda: Oracle of Ages
|
| 283. | Twitch (& Friends) Clips - Diablo II (Part 6), July 15, 2021 | 21:34 | | Diablo II
|
| 284. | Equivalence of Nondeterministic and Deterministic Finite Automata (Theory of Computing) | 21:28 | |
|
| 285. | Counting Reachable Vertices and Edges (Graphs: Algorithms & Theory) | 21:16 | |
|
| 286. | Proof of Smoothness Rule [Big-Oh Bootcamp] | 20:48 | |
|
| 287. | Twitch (& Friends) Clips - Diablo II (Part 5), June 17, 2021 | 20:43 | | Diablo II
|
| 288. | DFS/BFS Trees are Indeed Acyclic (Graphs: Algorithms & Theory) | 20:29 | |
|
| 289. | Twitch Clips - Legend of Zelda: Oracle of Ages (Part 14), November 3, 2021 | 20:08 | | The Legend of Zelda: Oracle of Ages
|
| 290. | Twitch Clips - Legend of Zelda: Oracle of Ages (Part 12), September 29, 2021 | 20:04 | | The Legend of Zelda: Oracle of Ages
|
| 291. | What's with Zero? O(0)? O(1)? Is O(0) = O(1)? | 20:02 | |
|
| 292. | Introduction to Debugging (Python) | 20:01 | |
|
| 293. | Caesar Cipher, Shift Cipher Cryptanalysis (Introductory Cryptography) | 19:51 | |
|
| 294. | Generalization of Max Rule for Big-Oh [Big-Oh Bootcamp] | 19:40 | |
|
| 295. | CSCI550 - Lecture 1 (Part 2): Primer on Algorithms and Complexity | 19:29 | |
|
| 296. | Linear Search (Searching: Algorithms and Lower Bounds) | 18:59 | |
|
| 297. | Twitch Clips - Legend of Zelda: Oracle of Seasons (Part 6), July 22, 2021 | 18:56 | | The Legend of Zelda: Oracle of Seasons
|
| 298. | Designing Nondeterministic Finite Automata (Theory of Computing) | 18:50 | |
|
| 299. | Twitch Clips - Legend of Zelda: Oracle of Seasons, April 13, 2021 | 18:47 | | The Legend of Zelda: Oracle of Seasons
|
| 300. | log n is O(n) [FULL PROOF] (Big-Oh Bootcamp) | 18:34 | Vlog |
|
