RouterCloudComputingCrowdsourcingHeuristicReturnValueNotreseasonabletimeAPIOverflowASCIIReasonable-timeDataTypeForLoopBinarySearchOpenAccessDigitalDivideLow LevelPrg.LanguageHighLevel Prg.LanguageLibraryGlobalVariableNetworkRedundancyConditionalsPeer-to-PeerNetworksLinearSearchAbstratctionEventListenerCallbackFunctionArrayDDoSAttackFunctionSequencingRound-offBinaryPixelLossyByteCreativeCommonsCitizenScienceIterateMetadataUndecidableWhileLoopSelectionAlgorithmConcatenateRandomSubstitutionCipherLosslessCaesarCipherPhishingScamMoore'sLawRouterCloudComputingCrowdsourcingHeuristicReturnValueNotreseasonabletimeAPIOverflowASCIIReasonable-timeDataTypeForLoopBinarySearchOpenAccessDigitalDivideLow LevelPrg.LanguageHighLevel Prg.LanguageLibraryGlobalVariableNetworkRedundancyConditionalsPeer-to-PeerNetworksLinearSearchAbstratctionEventListenerCallbackFunctionArrayDDoSAttackFunctionSequencingRound-offBinaryPixelLossyByteCreativeCommonsCitizenScienceIterateMetadataUndecidableWhileLoopSelectionAlgorithmConcatenateRandomSubstitutionCipherLosslessCaesarCipherPhishingScamMoore'sLaw

AP Computer Science Bingo - Ms. Garvin - Call List

(Print) Use this randomly generated list as your call list when playing the game. 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
I
2
I
3
N
4
O
5
O
6
G
7
O
8
B
9
G
10
N
11
G
12
B
13
G
14
O
15
N
16
I
17
O
18
O
19
O
20
B
21
I
22
I
23
I
24
N
25
N
26
I
27
G
28
O
29
G
30
B
31
I
32
O
33
N
34
N
35
I
36
G
37
B
38
B
39
O
40
B
41
N
42
I
43
G
44
B
45
N
46
G
47
G
48
B
49
B
  1. I-Router
  2. I-Cloud Computing
  3. N-Crowdsourcing
  4. O-Heuristic
  5. O-Return Value
  6. G-Not reseasonable time
  7. O-API
  8. B-Overflow
  9. G-ASCII
  10. N-Reasonable-time
  11. G-Data Type
  12. B-For Loop
  13. G-Binary Search
  14. O-Open Access
  15. N-Digital Divide
  16. I-Low Level Prg. Language
  17. O-High Level Prg. Language
  18. O-Library
  19. O-Global Variable
  20. B-Network Redundancy
  21. I-Conditionals
  22. I-Peer-to-Peer Networks
  23. I-Linear Search
  24. N-Abstratction
  25. N-Event Listener
  26. I-Callback Function
  27. G-Array
  28. O-DDoS Attack
  29. G-Function
  30. B-Sequencing
  31. I-Round-off
  32. O-Binary
  33. N-Pixel
  34. N-Lossy
  35. I-Byte
  36. G-Creative Commons
  37. B-Citizen Science
  38. B-Iterate
  39. O-Metadata
  40. B-Undecidable
  41. N-While Loop
  42. I-Selection
  43. G-Algorithm
  44. B-Concatenate
  45. N-Random Substitution Cipher
  46. G-Lossless
  47. G-Caesar Cipher
  48. B-Phishing Scam
  49. B-Moore's Law