PhishingFull-duplexPipeliningDiskthrashingAuthenticationWANSQLinjectionDecompositionLANWormHarvardarchitectureClient-serverControlUnitNormalisationRecordVirusPagingLosslesscompressionMACaddressEncryptionPeer-to-peerStatetransitiondiagramAbstractionHashingClockspeedBustopologyHeuristicSymmetricencryptionSimplexParalleltransmissionReferentialintegrityTCP/IPFirewallFinitestatemachineBiometricauthenticationBooleanalgebraIPaddressingCachememoryEntityAlgorithmDataredundancyUDPLossycompressionFree!Half-duplexInterruptVonNeumannarchitectureSegmentationDNSMalwareSecondarystorageVirtualmemoryAsymmetricencryptionDHCPTrojanPrimarystorageASCIIForeignkeyAccumulatorCPUUnicodeFirewallLogicgateStartopologyISRMetadataMARALUACIDProxyserverPacketPrimarykeyCIRFieldSerialtransmissionRelationshipRegisterProgramCounterProtocolMDRTruthtablePhishingFull-duplexPipeliningDiskthrashingAuthenticationWANSQLinjectionDecompositionLANWormHarvardarchitectureClient-serverControlUnitNormalisationRecordVirusPagingLosslesscompressionMACaddressEncryptionPeer-to-peerStatetransitiondiagramAbstractionHashingClockspeedBustopologyHeuristicSymmetricencryptionSimplexParalleltransmissionReferentialintegrityTCP/IPFirewallFinitestatemachineBiometricauthenticationBooleanalgebraIPaddressingCachememoryEntityAlgorithmDataredundancyUDPLossycompressionFree!Half-duplexInterruptVonNeumannarchitectureSegmentationDNSMalwareSecondarystorageVirtualmemoryAsymmetricencryptionDHCPTrojanPrimarystorageASCIIForeignkeyAccumulatorCPUUnicodeFirewallLogicgateStartopologyISRMetadataMARALUACIDProxyserverPacketPrimarykeyCIRFieldSerialtransmissionRelationshipRegisterProgramCounterProtocolMDRTruthtable

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