HeapRecursionfairiesVariableUnityCS2StringDr.LewisUnrealArrayKnightDivideandConquerPolymorphismACMCharacterPostfixCS1LambdaHashmapProofsTry-catchChildIntegerParentOperatorGreedyAlgorithmDr.FogartyCrustyCouchTUWICForloopACMTutoringPhilosophy-CS PicnicIfStatementConditionalsIDEGraphKnaveAGILEFunctionalLanguagesListComprehensionTuringMachineTheory(class)QueueTimeComplexityPointerDr.ZhangAlgorithmsFormalDerivationsBinaryTreeSpaceComplexityTernaryOperatorFiniteStateMachineTECHCampLinkedlistAbstractionPrefixSetPatternMatchingInhereitenceListDr.TubaBooleanFunctionDr.TanStackDr.HibbsCouchLabMajor’sLabDr.MyersDiscreteStructuresDataAbstractionPermutationDr.HornRubberDuckieWhileLoopHeapRecursionfairiesVariableUnityCS2StringDr.LewisUnrealArrayKnightDivideandConquerPolymorphismACMCharacterPostfixCS1LambdaHashmapProofsTry-catchChildIntegerParentOperatorGreedyAlgorithmDr.FogartyCrustyCouchTUWICForloopACMTutoringPhilosophy-CS PicnicIfStatementConditionalsIDEGraphKnaveAGILEFunctionalLanguagesListComprehensionTuringMachineTheory(class)QueueTimeComplexityPointerDr.ZhangAlgorithmsFormalDerivationsBinaryTreeSpaceComplexityTernaryOperatorFiniteStateMachineTECHCampLinkedlistAbstractionPrefixSetPatternMatchingInhereitenceListDr.TubaBooleanFunctionDr.TanStackDr.HibbsCouchLabMajor’sLabDr.MyersDiscreteStructuresDataAbstractionPermutationDr.HornRubberDuckieWhileLoop

ACM Bingo - Call List

(Print) Use this randomly generated list as your call list when playing the game. There is no need to say the BINGO column name. Place some kind of mark (like an X, a checkmark, a dot, tally mark, etc) on each cell as you announce it, to keep track. You can also cut out each item, place them in a bag and pull words from the bag.


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
  1. Heap
  2. Recursion fairies
  3. Variable
  4. Unity
  5. CS2
  6. String
  7. Dr. Lewis
  8. Unreal
  9. Array
  10. Knight
  11. Divide and Conquer
  12. Polymorphism
  13. ACM
  14. Character
  15. Postfix
  16. CS1
  17. Lambda
  18. Hash map
  19. Proofs
  20. Try-catch
  21. Child
  22. Integer
  23. Parent
  24. Operator
  25. Greedy Algorithm
  26. Dr. Fogarty
  27. Crusty Couch
  28. TUWIC
  29. For loop
  30. ACM Tutoring
  31. Philosophy-CS Picnic
  32. If Statement
  33. Conditionals
  34. IDE
  35. Graph
  36. Knave
  37. AGILE
  38. Functional Languages
  39. List Comprehension
  40. Turing Machine
  41. Theory (class)
  42. Queue
  43. Time Complexity
  44. Pointer
  45. Dr. Zhang
  46. Algorithms
  47. Formal Derivations
  48. Binary Tree
  49. Space Complexity
  50. Ternary Operator
  51. Finite State Machine
  52. TECH Camp
  53. Linked list
  54. Abstraction
  55. Prefix
  56. Set
  57. Pattern Matching
  58. Inhereitence
  59. List
  60. Dr. Tuba
  61. Boolean
  62. Function
  63. Dr. Tan
  64. Stack
  65. Dr. Hibbs
  66. Couch Lab
  67. Major’s Lab
  68. Dr. Myers
  69. Discrete Structures
  70. Data Abstraction
  71. Permutation
  72. Dr. Horn
  73. Rubber Duckie
  74. While Loop