In computer science, a y-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor queries in time O(log log M), using O(n) space, where n is the number of stored values and M is the maximum value in the domain. The structure was proposed by Dan Willard in 1982 to decrease the O(n log M) space used by an x-fast trie. (Wikipedia).
Link: https://www.geogebra.org/m/uj4qqmkZ
From playlist Geometry: Dynamic Interactives!
Ditch the Tricks: Estimating Trig Ratios: Conceptual Quiz Questions
Link: https://www.geogebra.org/m/F5a9GDd6
From playlist Trigonometry: Dynamic Interactives!
Trigonometry and Bearings: Quick Setups
#Trigonometry & #bearings: Set ups. Quick formative assessment: http://ow.ly/BMYe50I7kVs & http://ow.ly/p1JR50I7kVw. #GeoGebra
From playlist Trigonometry: Dynamic Interactives!
Trigonometry: Quick Bearing Illustrator
Link: https://www.geogebra.org/m/K78JzGk7
From playlist Trigonometry: Dynamic Interactives!
Circle Equation Discovery: Center = (0,0)
Link: https://www.geogebra.org/m/RCYvXnuR
From playlist Trigonometry: Dynamic Interactives!
Adding Vectors Geometrically: Dynamic Illustration
Link: https://www.geogebra.org/m/tsBer5An
From playlist Trigonometry: Dynamic Interactives!
Open Middle: Basic Trig Graphing Challenge
This new #OpenMiddle basic #trig function graphing problem is more challenging than it looks. It’ll also deepen Ss’ conceptual understanding re: amplitude & vertical shift. I’ve only found 2 solutions so far. https://www.geogebra.org/m/keceuy9k #GeoGebra #MTBoS #ITeachMath
From playlist Trigonometry: Dynamic Interactives!
Projection of One Vector onto Another Vector
Link: https://www.geogebra.org/m/wjG2RjjZ
From playlist Trigonometry: Dynamic Interactives!
From playlist CS50 Lectures 2013
*** This is CS50, Harvard University's introduction to the intellectual enterprises of computer science and the art of programming. *** HOW TO SUBSCRIBE http://www.youtube.com/subscription_center?add_user=cs50tv HOW TO TAKE CS50 edX: https://cs50.edx.org/ Harvard Extension School: ht
From playlist CS50 Shorts
Trig Reference Circle (2): Choose Your Own Radius
Trig circle (special angles): Quick reference. Radius modifiable: https://www.geogebra.org/m/rek7rd77 #GeoGebra #mtbos #iteachmath
From playlist Trigonometry: Dynamic Interactives!
From playlist CS50 Lectures 2012
From playlist CS50 Walkthroughs (Problem Sets)
CS50 2016 - Week 5 - Data Structures
TOC 00:00:00 - Week 4 Recap 00:07:22 - Limitations of Arrays 00:10:45 - Lists 00:13:11 - Nodes 00:15:10 - Linked Lists 00:20:39 - List of Humans 00:26:52 - List Operations 00:28:14 - Implementing search 00:40:11 - Linked List Tradeoffs 00:41:26 - Stacks 00:43:57 - Implementing a Stack 00:
From playlist CS50 Lectures 2016
From playlist CS50 Sections 2012
David begins discussing hash tables, binary trees, and tries
From playlist CS50 Lectures 2014
From playlist CS50 Walkthroughs 2012
CS50 2019 - Lecture 5 - Data Structures
TABLE OF CONTENTS 00:00:00 - Introduction 00:01:22 - Week 4 Recap 00:06:10 - Pointer Fun with Binky 00:08:44 - Arrays 00:14:19 - list.c 00:28:25 - Data Structures 00:30:23 - Linked Lists 00:38:57 - Linked List Representation 00:51:05 - Linked List Demo 01:01:02 - list.c, continued 01:08:2
From playlist CS50 Lectures 2019
Open Middle: Creating Trig Equations (Demo)
#OpenMiddle tasks serve as GREAT formative & summative items during this unfortunate time of more remote & hybrid learning. COVID or NO COVID, better for Ss to wrestle & reason with creating vs. giving them a set of Qs they’ll just quickly Google or PhotoMath. Here, an entire compilation
From playlist Trigonometry: Dynamic Interactives!
CS224W: Machine Learning with Graphs | 2021 | Lecture 9.1 - How Expressive are Graph Neural Networks
For more information about Stanford’s Artificial Intelligence professional and graduate programs, visit: https://stanford.io/3GwTmur Jure Leskovec Computer Science, PhD In this lecture, we provide a theoretical framework to analyze the expressive power of GNNs---the ability of a GNN to d
From playlist Stanford CS224W: Machine Learning with Graphs