101. | Dan Plays Chrono Trigger (Finale - August 11, 2023) | 72 | Let's Play | Chrono Trigger
|
102. | Transducers, Unary Addition (Theory of Computing) | 70 | |
|
103. | Lecture 11: Separate Chaining Wrap-up, Load Factor, Open Addressing [Advanced Data Structures] | 70 | |
|
104. | Lecture 32: More on (2,4)-Trees, insertions, removals, B-Trees [Advanced Data Structures] | 69 | |
|
105. | Principle of Mathematical Induction (with full examples) [Mathematics for CS] | 68 | |
|
106. | Prim's Algorithm in Under 1 Minute - Think Like The Blob! (Graphs: Algorithms & Theory) | 68 | |
|
107. | Not One of My Scented Markers | 68 | |
|
108. | One Year Later... (Anniversary Video) | 68 | |
|
109. | Coding for Problem Solving - Final Summary | 67 | |
|
110. | Two Winnipeggers Have the Same Numbers of Hairs on the Top of Their Head! (Pigeonhole Principle) | 66 | |
|
111. | Representing Pushdown Automata (Basic Example) [Theory of Computing] | 66 | |
|
112. | Basic Big-Oh Proofs, "Look-A-Like" Approach (Big-Oh Bootcamp) | 66 | |
|
113. | CSCI255 Lecture 0: Course Introduction | 64 | |
|
114. | Lecture 13: Double Hashing, Load Factor, Trees, Tree Terminology [Advanced Data Structures] | 64 | |
|
115. | Lecture 24: Graph Terminology, Handshaking Lemma, and More! [Advanced Data Structures] | 64 | |
|
116. | Lecture 22: AVL Trees, Single & Double Rotations, Insertions, Removals [Advanced Data Structures] | 62 | |
|
117. | How Do We Know Algorithms are Incorrect? | 60 | |
|
118. | Preview: New Wide Lecture Setup | 60 | |
|
119. | Proving Basic Exponential Claims for Big-Oh [Big-Oh Bootcamp] | 59 | |
|
120. | CSCI550 - Lecture 1 (Part 1): Course Introduction | 59 | |
|
121. | How to Explore a Graph/Network! [COME JOIN THE FUN, ALGORITHMS] | 58 | Guide |
|
122. | Lecture 14: Trees, Computing Height of a Tree, Tree Traversals & More! [Advanced Data Structures] | 58 | |
|
123. | Dan Plays Gravity Circuit (September 1, 2023) | 58 | | Gravity Circuit
|
124. | Lecture 15: Tree Traversal Wrap-up and Binary Heaps [Advanced Data Structures] | 57 | |
|
125. | Discrete Structures - 4. Counting | 56 | |
|
126. | Big-Oh Bootcamp (Introduction) - July 7, 2022 | 56 | |
|
127. | What is a Graph? Basic Terminology (Graphs: Algorithms & Theory) | 56 | Vlog |
|
128. | Lecture 21: AVL Trees [Advanced Data Structures] | 55 | |
|
129. | Basic Concepts (Hashing: Fundamentals and Algorithms) | 54 | |
|
130. | Lecture 19: Search Tables, Binary Search Trees [Advanced Data Structures] | 54 | |
|
131. | Graphs & Pigeonhole Principle: Two (or More) Vertices Have The Same Degree (Mathematics for CS) | 54 | |
|
132. | How Do We Know An Algorithm is Incorrect, Shortest Paths, and Minimum Spanning Trees! | 54 | |
|
133. | Recursion and Basic Recursive Thinking | 54 | |
|
134. | 2. Our First Computer Program [1st Steps to Computer Programming using Java] | 53 | |
|
135. | Deterministic Finite Automata: Regular Operators, and Proving DFAs are Correct | 53 | |
|
136. | Pigeonhole Principle [FULL PROOF] (Mathematics for CS) | 51 | |
|
137. | Open Addressing (Hashing: Fundamentals and Algorithms) | 50 | |
|
138. | Lecture 16: Binary Heaps, Insertions & removeMin, Heapify [Advanced Data Structures] | 49 | |
|
139. | December 2021 Updates - Streaming Mania! | 49 | |
|
140. | Methods of Proof [Mathematics for CS] | 49 | |
|
141. | Fun with Binary Trees | 49 | |
|
142. | Lecture 20: More Operations on Binary Search Trees, AVL Trees [Advanced Data Structures] | 48 | |
|
143. | Updates November 2020, Shout Outs and Thank You! | 48 | |
|
144. | July 2021 Updates - Stay Cool! | 48 | |
|
145. | Dan Plays Chrono Trigger and LoZ Tears of the Kingdom (Spoilers, July 13, 2023) | 48 | Let's Play | Chrono Trigger
|
146. | "How Does Removing Question Time Best Serve Us?" RM of Springfield, Council Meeting, Dec 17, 2024 | 47 | |
|
147. | Transitivity of Big-Oh [FULL PROOF] (Big-Oh Bootcamp) | 47 | |
|
148. | Exploring a Graph: Depth-First Search (Graphs: Algorithms & Theory) | 46 | |
|
149. | Mayor Therrien Yells at Resident of the RM of Springfield, Council Meeting, September 17, 2024 | 46 | |
|
150. | Logarithms Grow Slower Than Polynomials (Big-Oh Bootcamp) | 46 | Vlog |
|
151. | Proving a Context-Free Grammar is Correct (Theory of Computing) | 46 | |
|
152. | Burden for Problem Solving on Future Computer Scientists | 46 | |
|
153. | Haunted Escape (Intro to k-Canadian Traveller and Online Algorithms) | 45 | |
|
154. | Strings, Formal Languages, and Deterministic Finite Automata | 45 | |
|
155. | Correctness of Dijkstra's Algorithm (Graphs: Algorithms & Theory) | 44 | |
|
156. | 0. Introduction [1st Steps to Computer Programming Using Java] | 44 | |
|
157. | Lecture 8: Binary Search Analysis, "The Big Picture", Dictionaries [Advanced Data Structures] | 44 | |
|
158. | Logarithm log base 2 of n is O(n^Ɛ) [Big-Oh Bootcamp] | 44 | |
|
159. | Instantaneous Descriptions, Language of a Pushdown Automaton (Theory of Computing) | 43 | |
|
160. | Constant Functions are Smooth [Big-Oh Bootcamp] | 43 | |
|
161. | Proving n is O(2^n) [Big-Oh Bootcamp] | 43 | |
|
162. | Merry Christmas and Happy Holidays Wishes 2022! | 43 | |
|
163. | Dan Longplays Xenoblade Chronicles 2 #1 | 43 | Let's Play | Xenoblade Chronicles 2
|
164. | Linear Search (Searching: Algorithms and Lower Bounds) | 43 | |
|
165. | Recursion: The Basics (with Examples) | 42 | |
|
166. | LIVE! Announcement! Big-Oh Bootcamp | 42 | |
|
167. | Lecture 7: Properties of Big-Oh, An Iterative Example, Search Problem [Advanced Data Structures] | 42 | |
|
168. | Dan Plays! Full Intro [Follow on Twitch!] | 41 | |
|
169. | April 2021 Updates - What's Next & The Quest for Lip Chap. | 41 | |
|
170. | Addition Principle, Inclusion/Exclusion Principle (2 Sets) [Mathematics for Computer Science] | 41 | |
|
171. | Lecture 23: AVL Trees, more on removeAVL, AVL Tree Performance, Graphs [Advanced Data Structures] | 40 | |
|
172. | Properties of Big-Oh, Big-Oh is Reflexive [Big-Oh Bootcamp] | 40 | |
|
173. | Complexity and Correctness of Linear Search (Searching) | 40 | |
|
174. | [April Fools] How to get 100% on any Big-Oh proof claim! It's obvious! | 40 | |
|
175. | 1. k-Canadian Traveller & Problem Setup (Haunted Escape) | 40 | |
|
176. | Combinations (k-Combinations) [Mathematics for Computer Science] | 39 | |
|
177. | What is the Averaging Principle? [FULL PROOF & MORE] (Maths for Computer Science) | 39 | |
|
178. | Applications of Graph/Networks Traversal Algorithms | 39 | |
|
179. | June 2021 Updates - Lovely Day Outside! Get Outside! | 39 | |
|
180. | Proving Correctness of Deterministic Finite Automata, State Invariants (Theory of Computing) | 39 | |
|
181. | Properties of Pascal's Triangle (Mathematics for Computer Science) | 39 | |
|
182. | 1. What is Computer Programming? Getting Started! [1st Steps to Computer Programming Using Java] | 38 | |
|
183. | Sum Rule of Big-Oh [FULL PROOF] (Big-Oh Bootcamp) | 38 | |
|
184. | Twitch (& Friends) Clips - Diablo II, May 12-13, 2021 | 37 | | Diablo II
|
185. | How to Represent a Graph (Graphs: Algorithms & Theory) | 37 | |
|
186. | Language of Palindromic Strings is not Regular (Theory of Computing) | 37 | |
|
187. | Have a Merry Ho Ho, Merry Christmas, and Happy Holidays! | 37 | |
|
188. | Constants Independent of the Input Do Not Matter! [Big-Oh Bootcamp] | 36 | |
|
189. | Big-Theta Definition, Usage, Proving 3n^3 + 5 is Θ(n^3) | 36 | |
|
190. | Graph Terminology II (Graphs: Algorithms & Theory) | 36 | Vlog |
|
191. | Minimum Spanning Trees & Optimization Problems (Graphs: Algorithms & Theory) | 36 | |
|
192. | Take the Largest Function Over Functions in a Sum! [Big-Oh Bootcamp] | 36 | |
|
193. | Dan Plays Pocky & Rocky: Reshrined (JOIN THE FUN IN THE CHAT) | 35 | | Pocky & Rocky
|
194. | November 2021 Updates - Logic, More Shows, and Ah Blah Blah Blah! | 35 | |
|
195. | Cryptography: Basic Terminology, Communication Channel (Introductory Cryptography) | 35 | Vlog |
|
196. | Smoothness Rule [FULL PROOF] (Big-Oh Bootcamp) | 35 | |
|
197. | Dan Longplays Xenoblade Chronicles 2 #8 | 35 | | Xenoblade Chronicles 2
|
198. | 4. Deterministic Lower Bound for k-Canadian Travelling (Haunted Escape) | 34 | |
|
199. | Graph/Networks and Minimum Spanning Trees, Algorithms and More! | 34 | |
|
200. | The Handshaking Lemma (Graphs: Algorithms & Theory) | 34 | |
|