bigdatavectorsoverflowerrorfunctionapplicationsecondarystoragenaturalnumberoperandbruteforcealgorithmirrationalnumberhashingopticaldiskwordsrecursivealgorithmcircularqueueSSDlistdirectaddressingflip-flopALUprimarystorageVonNeumannarchitecture​Interruptsignal​callstackbusHHDgraphsinputdevicesqueueoutputdevicesrecursivesubroutineencryptionHarvardarchitectureadjacencylistspacecomplexitydynamicdatastructureimmediateaddressingtimecomplexitymnemonicsopcodeunderflowerrordictionariessystembussoftwarerationalnumberI/ObusfixedpointprogrammingparadigmMDRstackhardwarebigdatavectorsoverflowerrorfunctionapplicationsecondarystoragenaturalnumberoperandbruteforcealgorithmirrationalnumberhashingopticaldiskwordsrecursivealgorithmcircularqueueSSDlistdirectaddressingflip-flopALUprimarystorageVonNeumannarchitecture​Interruptsignal​callstackbusHHDgraphsinputdevicesqueueoutputdevicesrecursivesubroutineencryptionHarvardarchitectureadjacencylistspacecomplexitydynamicdatastructureimmediateaddressingtimecomplexitymnemonicsopcodeunderflowerrordictionariessystembussoftwarerationalnumberI/ObusfixedpointprogrammingparadigmMDRstackhardware

CS Keywords Bingo - 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
  1. big data
  2. vectors
  3. overflow error
  4. function application
  5. secondary storage
  6. natural number
  7. operand
  8. brute force algorithm
  9. irrational number
  10. hashing
  11. optical disk
  12. words
  13. recursive algorithm
  14. circular queue
  15. SSD
  16. list
  17. direct addressing
  18. flip-flop
  19. ALU
  20. primary storage
  21. Von Neumann architecture​
  22. Interrupt signal​
  23. call stack
  24. bus
  25. HHD
  26. graphs
  27. input devices
  28. queue
  29. output devices
  30. recursive subroutine
  31. encryption
  32. Harvard architecture
  33. adjacency list
  34. space complexity
  35. dynamic data structure
  36. immediate addressing
  37. time complexity
  38. mnemonics
  39. opcode
  40. underflow error
  41. dictionaries
  42. system bus
  43. software
  44. rational number
  45. I/O bus
  46. fixed point
  47. programming paradigm
  48. MDR
  49. stack
  50. hardware