This bingo card has a free space and 24 words: String Distance, Terminals in a tree, Non-terminals in a tree, Breadth-first search, Depth-first search, Difference between sets, Create a regular expression for cat & cats, Relations vs. Functions, Define Domain, Injective Function, Surjective Function, Bijective Function, Cardinality, Indexation in a tree, Describe Lemmatization, Levenshtein Distance, Weak Equivalence, Define codomain, Equivalence of NFA and DFA, Kleene Star in Regex, Concatenation in Regex, Union in Regex, Define NFA and Define DFA.
IB Computer Science Revision 2 | Luke Debugging | Bingo | ECS UNITS 1-3 | Javascript Bingo
Share this URL with your players:
For more control of your online game, create a clone of this card first.
Learn how to conduct a bingo game.
With players vying for a you'll have to call about __ items before someone wins. There's a __% chance that a lucky player would win after calling __ items.
Tip: If you want your game to last longer (on average), add more unique words/images to it.
