DiskthrashingPrimarykeyRelationshipVirtualmemorySegmentationFree!WormHashingDataredundancyPrimarystorageUnicodeMalwareRegisterReferentialintegrityDHCPBooleanalgebraTCP/IPTruthtableForeignkeyFirewallMetadataPeer-to-peerALUISRStatetransitiondiagramFirewallMDRPipeliningProtocolInterruptLogicgateMARAuthenticationHeuristicProxyserverEntityAbstractionCachememoryLosslesscompressionParalleltransmissionRecordSimplexFinitestatemachineDecompositionIPaddressingStartopologyACIDTrojanFieldWANAccumulatorControlUnitProgramCounterLANVirusNormalisationEncryptionCPUAlgorithmSQLinjectionBiometricauthenticationHalf-duplexAsymmetricencryptionASCIICIRClockspeedPagingUDPHarvardarchitectureSecondarystorageSerialtransmissionMACaddressDNSLossycompressionVonNeumannarchitectureFull-duplexSymmetricencryptionPacketBustopologyClient-serverPhishingDiskthrashingPrimarykeyRelationshipVirtualmemorySegmentationFree!WormHashingDataredundancyPrimarystorageUnicodeMalwareRegisterReferentialintegrityDHCPBooleanalgebraTCP/IPTruthtableForeignkeyFirewallMetadataPeer-to-peerALUISRStatetransitiondiagramFirewallMDRPipeliningProtocolInterruptLogicgateMARAuthenticationHeuristicProxyserverEntityAbstractionCachememoryLosslesscompressionParalleltransmissionRecordSimplexFinitestatemachineDecompositionIPaddressingStartopologyACIDTrojanFieldWANAccumulatorControlUnitProgramCounterLANVirusNormalisationEncryptionCPUAlgorithmSQLinjectionBiometricauthenticationHalf-duplexAsymmetricencryptionASCIICIRClockspeedPagingUDPHarvardarchitectureSecondarystorageSerialtransmissionMACaddressDNSLossycompressionVonNeumannarchitectureFull-duplexSymmetricencryptionPacketBustopologyClient-serverPhishing

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