FinitestatemachineStatetransitiondiagramHalf-duplexBooleanalgebraSymmetricencryptionDecompositionClient-serverASCIIMetadataProtocolSegmentationEntityPhishingMDRBiometricauthenticationDHCPProxyserverControlUnitMACaddressClockspeedPagingPacketLosslesscompressionAccumulatorHashingAsymmetricencryptionLANACIDSecondarystorageALUNormalisationAlgorithmUDPForeignkeySerialtransmissionCIRIPaddressingSQLinjectionFull-duplexRelationshipVonNeumannarchitectureTrojanBustopologyFirewallTruthtableFieldCachememoryVirtualmemoryWormDNSPipeliningHarvardarchitectureRegisterPrimarystorageTCP/IPVirusMalwareAbstractionProgramCounterLogicgateWANPeer-to-peerMARFirewallUnicodePrimarykeyDataredundancyHeuristicParalleltransmissionStartopologyRecordISRSimplexCPUAuthenticationLossycompressionInterruptReferentialintegrityDiskthrashingFree!EncryptionFinitestatemachineStatetransitiondiagramHalf-duplexBooleanalgebraSymmetricencryptionDecompositionClient-serverASCIIMetadataProtocolSegmentationEntityPhishingMDRBiometricauthenticationDHCPProxyserverControlUnitMACaddressClockspeedPagingPacketLosslesscompressionAccumulatorHashingAsymmetricencryptionLANACIDSecondarystorageALUNormalisationAlgorithmUDPForeignkeySerialtransmissionCIRIPaddressingSQLinjectionFull-duplexRelationshipVonNeumannarchitectureTrojanBustopologyFirewallTruthtableFieldCachememoryVirtualmemoryWormDNSPipeliningHarvardarchitectureRegisterPrimarystorageTCP/IPVirusMalwareAbstractionProgramCounterLogicgateWANPeer-to-peerMARFirewallUnicodePrimarykeyDataredundancyHeuristicParalleltransmissionStartopologyRecordISRSimplexCPUAuthenticationLossycompressionInterruptReferentialintegrityDiskthrashingFree!Encryption

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