| 1. | Ms. Kitty Reacts to The Grapist | 50 | |
|
| 2. | Darn You Yoku Blocks [Mega Man: Dr. Wily's Revenge] | 29 | | Mega Man: Dr. Wily's Revenge
|
| 3. | Raking in the Lives! [Mega Man II] | 26 | | Mega Man II
|
| 4. | The State of Academic Freedom in Canada | 24 | |
|
| 5. | Story Time with Prof Page with No Context (for Really Big Girls and Boys!) | 17 | |
|
| 6. | Inclusion Through Exclusion: The Culling of Academics in Canadian Universities | 14 | |
|
| 7. | It's Poppin' Time! | 11 | |
|
| 8. | Divisible By Ms. Kitty (The Fall of Ms. Kitty) | 11 | |
|
| 9. | I'm Number One, ha HA [with my Narwal friend] | 11 | |
|
| 10. | Ms. Kitty goes Cruis'n | 8 | |
|
| 11. | Beware Mochi the Cat, Search Breadth-Wise! | 7 | |
|
| 12. | Smashing The Genie in Legend of Zelda: Link's Awakening [Gameboy Colour] | 7 | | The Legend of Zelda: Link's Awakening
|
| 13. | Summations, Closed Forms, and Simplifying Them: A Tutorial | 7 | Tutorial |
|
| 14. | Ms. Kitty Disrupts Dr. Page's Lecture All Wet | 6 | |
|
| 15. | The Handshaking Lemma (Graphs: Algorithms & Theory) | 6 | |
|
| 16. | What is a Graph? Basic Terminology (Graphs: Algorithms & Theory) | 6 | Vlog |
|
| 17. | Recursion: How Does It Work? | 6 | |
|
| 18. | Why Dijkstra's Algorithm Fails for Negative Weight Edges (Graphs: Algorithms & Theory) | 6 | |
|
| 19. | Ms. Kitty Learns Dijkstra's Algorithm with Ms. Kitty | 6 | |
|
| 20. | Applications of Graph/Networks Traversal Algorithms | 6 | |
|
| 21. | Pi Day 2022 Talk - Limits of Approximability, Magic Numbers in Scheduling | 5 | |
|
| 22. | Have a Merry Ho Ho, Merry Christmas, and Happy Holidays! | 5 | |
|
| 23. | Let's Make Something New! (Spring/Summer 2023 Updates) | 6 | Vlog |
|
| 24. | Minimum Spanning Trees and the Cut Property, Taking Your Questions! | 5 | |
|
| 25. | Dan Longplays Xenoblade Chronicles 2 #1 | 5 | Let's Play | Xenoblade Chronicles 2
|
| 26. | How to Explore a Graph/Network! [COME JOIN THE FUN, ALGORITHMS] | 5 | Guide |
|
| 27. | What is a Formal Language? Decision Problems and Discussion [Theory of Computing] | 5 | |
|
| 28. | Graphs & Pigeonhole Principle: Two (or More) Vertices Have The Same Degree (Mathematics for CS) | 5 | |
|
| 29. | Minimum Spanning Trees & Optimization Problems (Graphs: Algorithms & Theory) | 5 | |
|
| 30. | Two Winnipeggers Have the Same Numbers of Hairs on the Top of Their Head! (Pigeonhole Principle) | 5 | |
|
| 31. | Haunted Escape (Intro to k-Canadian Traveller and Online Algorithms) | 4 | |
|
| 32. | Big-Omega Definition, Proving log n + 2 is Ω(log n) (FULL EXAMPLE) | 4 | Vlog |
|
| 33. | How Do We Know Algorithms are Incorrect? | 4 | |
|
| 34. | Dan Longplays Xenoblade Chronicles 2 #8 | 4 | | Xenoblade Chronicles 2
|
| 35. | Prim's Algorithm in Under 1 Minute - Think Like The Blob! (Graphs: Algorithms & Theory) | 4 | |
|
| 36. | Dan Plays Monster Hunter Rise (April 30, 2022) | 4 | Let's Play | Monster Hunter Rise
|
| 37. | Solving Recurrence Relations via Iteration | 4 | |
|
| 38. | Introduction to Mathematical Sequences, and How to Derive a Sequence | 4 | |
|
| 39. | Regular Expressions I | 4 | |
|
| 40. | Logarithms Grow Slower Than Polynomials (Big-Oh Bootcamp) | 4 | Vlog |
|
| 41. | Adversarial Argument and Searching Lower Bound (Searching: Algorithms and Lower Bounds) | 4 | |
|
| 42. | Pigeonhole Principle [FULL PROOF] (Mathematics for CS) | 4 | |
|
| 43. | Proving Correctness of DFAs via State Invariants [FULL EXAMPLE] (Theory of Computing) | 4 | |
|
| 44. | Dan Longplays Xenoblade Chronicles 2 #2 | 4 | | Xenoblade Chronicles 2
|
| 45. | Hashing: Fundamentals and Algorithms | 4 | |
|
| 46. | Cut Property of Minimum Spanning Trees & Algorithms (Graphs: Algorithms & Theory) | 4 | |
|
| 47. | Introduction to Debugging (Python) | 7 | |
|
| 48. | Strings, Formal Languages, and Deterministic Finite Automata | 4 | |
|
| 49. | 3. Reposition Strategy for k-Canadian Travelling (Haunted Escape) | 4 | |
|
| 50. | Algebraic Laws of Regular Expressions and More! (Theory of Computing) | 4 | |
|
| 51. | Exploring a Graph: Depth-First Search (Graphs: Algorithms & Theory) | 4 | |
|
| 52. | Pigeonhole Principle and Averaging Principle (Mathematics for Computer Science) | 4 | |
|
| 53. | Special: Lessons & Goodbye for Lola (Our First Computer Program/Complexity Analysis) | 4 | |
|
| 54. | Learn & Have Fun [Sequences, Summations, Induction, Legend of Zelda: Link's Awakening DX] | 4 | | The Legend of Zelda: Link's Awakening
|
| 55. | May 2022 Updates - Welcome to the Learning Zone 2.0 | 4 | Vlog |
|
| 56. | Proving Correctness of Deterministic Finite Automata, State Invariants (Theory of Computing) | 3 | |
|
| 57. | What is the Averaging Principle? [FULL PROOF & MORE] (Maths for Computer Science) | 3 | |
|
| 58. | Dan Plays Chrono Trigger (Finale - August 11, 2023) | 3 | Let's Play | Chrono Trigger
|
| 59. | What are Regular Expressions? (Theory of Computing) | 3 | |
|
| 60. | Dan Plays Gravity Circuit (September 1, 2023) | 3 | | Gravity Circuit
|
| 61. | The Pumping Lemma for Regular Languages [FULL PROOF] (Theory of Computing) | 3 | |
|
| 62. | Dan Longplays Xenoblade Chronicles 2 #3 | 3 | | Xenoblade Chronicles 2
|
| 63. | Dan Plays Sonic Classic 2 (Sonic Fan Game) | 3 | | Sonic the Hedgehog
|
| 64. | 1. k-Canadian Traveller & Problem Setup (Haunted Escape) | 3 | |
|
| 65. | Converting Regular Expressions to ε-NFAs - Thompson's Construction (Kleene's Theorem (Part 1)) | 3 | |
|
| 66. | Equivalence of Nondeterministic and Deterministic Finite Automata (Theory of Computing) | 3 | |
|
| 67. | Computing Paths Using DFS/BFS Trees (Graphs: Algorithms & Theory) | 3 | |
|
| 68. | Language with More 0s Before Less 1s is not Regular (Theory of Computing) | 3 | |
|
| 69. | Correctness of Dijkstra's Algorithm (Graphs: Algorithms & Theory) | 3 | |
|
| 70. | Graph/Networks and Minimum Spanning Trees, Algorithms and More! | 3 | |
|
| 71. | Nondeterminism and Nondeterministic Finite Automata | 3 | |
|
| 72. | What are Nondeterministic Finite Automata? [Theory of Computing] | 3 | |
|
| 73. | Generalized Pigeonhole Principle [PROOF & EXAMPLE] (Mathematics for Computer Science) | 3 | |
|
| 74. | Cryptography: Basic Terminology, Communication Channel (Introductory Cryptography) | 3 | Vlog |
|
| 75. | Big-Oh is Reflexive [FULL PROOF] (Big-Oh Bootcamp) | 3 | |
|
| 76. | Caesar Cipher, Shift Cipher Cryptanalysis (Introductory Cryptography) | 3 | |
|
| 77. | Graph Terminology III: Weighted Graphs (Graphs: Algorithms & Theory) | 3 | |
|
| 78. | Dan Longplays Xenoblade Chronicles 2 #5 | 3 | | Xenoblade Chronicles 2
|
| 79. | What are Deterministic Finite Automata (DFAs)? A Conceptual Overview [Theory of Computing] | 3 | |
|
| 80. | Linear Search (Searching: Algorithms and Lower Bounds) | 3 | |
|
| 81. | Designing Context-Free Grammars III (Theory of Computing) | 5 | |
|
| 82. | Dijkstra's Algorithm WITH FULL EXAMPLE (Graphs: Algorithms & Theory) | 3 | |
|
| 83. | Twitch Clips - Mega Man 5, December 15, 2021 | 3 | | Mega Man 5
|
| 84. | Pumping Lemma for Regular Languages: A Gentle Introduction (Theory of Computing) | 3 | |
|
| 85. | Cycle Detection and Path Finding (Graphs: Algorithms & Theory) | 3 | |
|
| 86. | Testing Set Membership and Equality of Regular Languages (Theory of Computing) | 3 | |
|
| 87. | 5. Myopic and Comparison Strategies for k-Canadian Travelling (Haunted Escape) | 3 | |
|
| 88. | For any n+1 integers, some difference of two of them is divisible by n - Pigeonhole Principle | 3 | |
|
| 89. | Converting DFAs/NFAs to Regular Expressions - Kleene's Construction (Kleene's Theorem (Part 2)) | 3 | |
|
| 90. | What is a Hash Function? (Hashing: Fundamentals and Algorithms) | 3 | |
|
| 91. | Product Rule of Big-Oh [FULL PROOF] (Big-Oh Bootcamp) | 3 | |
|
| 92. | Tips on Using the Pumping Lemma to Prove Languages are Not Regular (Theory of Computing) | 3 | |
|
| 93. | Something is in those markers! | 3 | |
|
| 94. | Dan Longplays Xenoblade Chronicles 2 #6 | 3 | | Xenoblade Chronicles 2
|
| 95. | How to Represent a Graph (Graphs: Algorithms & Theory) | 3 | |
|
| 96. | Twitch Livestream December 26, 2021 - Mega Man 4 (RACE VS TORASBJOERN) [Full Livestream] | 3 | | Mega Man 4
|
| 97. | Big-Theta Definition, Usage, Proving 3n^3 + 5 is Θ(n^3) | 3 | |
|
| 98. | Binary Search Algorithm (Searching: Algorithms & Lower Bounds) | 3 | |
|
| 99. | Transitivity of Big-Oh [FULL PROOF] (Big-Oh Bootcamp) | 3 | |
|
| 100. | Dan Plays Pokemon Scarlet (December 1, 2022) | 3 | | Pokémon Scarlet and Violet
|
