FinitestatemachineProgramCounterClockspeedACIDDecompositionVirtualmemoryHeuristicUnicodeControlUnitSimplexLossycompressionWANAsymmetricencryptionRecordBustopologyDiskthrashingVirusWormTCP/IPPipeliningRegisterAbstractionDNSFree!SQLinjectionCPUHarvardarchitectureMDRCachememoryDataredundancyFull-duplexFirewallAlgorithmLosslesscompressionMalwareBooleanalgebraClient-serverCIRPrimarykeySegmentationFirewallSerialtransmissionPacketAccumulatorASCIIVonNeumannarchitectureNormalisationEncryptionMARLogicgateProtocolSecondarystorageStartopologyEntityBiometricauthenticationForeignkeyHalf-duplexDHCPRelationshipInterruptPeer-to-peerPhishingPrimarystorageMACaddressReferentialintegrityIPaddressingTruthtableFieldUDPProxyserverMetadataAuthenticationHashingISRTrojanSymmetricencryptionALUStatetransitiondiagramLANPagingParalleltransmissionFinitestatemachineProgramCounterClockspeedACIDDecompositionVirtualmemoryHeuristicUnicodeControlUnitSimplexLossycompressionWANAsymmetricencryptionRecordBustopologyDiskthrashingVirusWormTCP/IPPipeliningRegisterAbstractionDNSFree!SQLinjectionCPUHarvardarchitectureMDRCachememoryDataredundancyFull-duplexFirewallAlgorithmLosslesscompressionMalwareBooleanalgebraClient-serverCIRPrimarykeySegmentationFirewallSerialtransmissionPacketAccumulatorASCIIVonNeumannarchitectureNormalisationEncryptionMARLogicgateProtocolSecondarystorageStartopologyEntityBiometricauthenticationForeignkeyHalf-duplexDHCPRelationshipInterruptPeer-to-peerPhishingPrimarystorageMACaddressReferentialintegrityIPaddressingTruthtableFieldUDPProxyserverMetadataAuthenticationHashingISRTrojanSymmetricencryptionALUStatetransitiondiagramLANPagingParalleltransmission

H446 Bingo - Paper 1 - 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
75
76
77
78
79
80
81
  1. Finite state machine
  2. Program Counter
  3. Clock speed
  4. ACID
  5. Decomposition
  6. Virtual memory
  7. Heuristic
  8. Unicode
  9. Control Unit
  10. Simplex
  11. Lossy compression
  12. WAN
  13. Asymmetric encryption
  14. Record
  15. Bus topology
  16. Disk thrashing
  17. Virus
  18. Worm
  19. TCP/IP
  20. Pipelining
  21. Register
  22. Abstraction
  23. DNS
  24. Free!
  25. SQL injection
  26. CPU
  27. Harvard architecture
  28. MDR
  29. Cache memory
  30. Data redundancy
  31. Full-duplex
  32. Firewall
  33. Algorithm
  34. Lossless compression
  35. Malware
  36. Boolean algebra
  37. Client-server
  38. CIR
  39. Primary key
  40. Segmentation
  41. Firewall
  42. Serial transmission
  43. Packet
  44. Accumulator
  45. ASCII
  46. Von Neumann architecture
  47. Normalisation
  48. Encryption
  49. MAR
  50. Logic gate
  51. Protocol
  52. Secondary storage
  53. Star topology
  54. Entity
  55. Biometric authentication
  56. Foreign key
  57. Half-duplex
  58. DHCP
  59. Relationship
  60. Interrupt
  61. Peer-to-peer
  62. Phishing
  63. Primary storage
  64. MAC address
  65. Referential integrity
  66. IP addressing
  67. Truth table
  68. Field
  69. UDP
  70. Proxy server
  71. Metadata
  72. Authentication
  73. Hashing
  74. ISR
  75. Trojan
  76. Symmetric encryption
  77. ALU
  78. State transition diagram
  79. LAN
  80. Paging
  81. Parallel transmission