Computer science crossword vocabulary pack

Teacher key

1. ALGORITHM · 9 letters · noun · introductory
   Step-by-step procedure for solving a problem

   Hint: A recipe is a useful everyday analogy.
   Why it fits: ALGORITHM fits because computer programs implement procedures that transform inputs into outputs through defined steps.

2. LOOP · 4 letters · noun · introductory
   Programming structure that repeats instructions

   Hint: It may continue a fixed number of times or until a condition changes.
   Why it fits: LOOP is correct because programmers use it to avoid rewriting the same instructions for every repeated action.

3. ARRAY · 5 letters · noun · introductory
   Ordered collection stored under one name

   Hint: Items are often reached by index positions.
   Why it fits: ARRAY fits because programs use it to keep related items together while still accessing each element by position.

4. BOOLEAN · 7 letters · noun · introductory
   Data type with true-or-false values

   Hint: It often controls decisions in code.
   Why it fits: BOOLEAN is correct because comparisons such as x > 5 produce values that guide branching and loops.

5. DEBUGGING · 9 letters · noun · introductory
   Process of finding and fixing program errors

   Hint: Testing and print statements can help with it.
   Why it fits: DEBUGGING fits because programmers often inspect inputs, outputs, and logic to remove mistakes from software.

6. COMPILER · 8 letters · noun · intermediate
   Tool that translates source code before execution

   Hint: Some languages need this step before a program runs.
   Why it fits: COMPILER is correct because it prepares written source code so a computer can execute or further process it.

7. RECURSION · 9 letters · noun · advanced
   Technique where a procedure calls itself

   Hint: A base case keeps it from continuing forever.
   Why it fits: RECURSION fits because many algorithms for trees, search, and mathematical sequences use repeated self-calls.

8. ITERATION · 9 letters · noun · intermediate
   Repeated execution of a process or step

   Hint: Each pass through a loop is one example.
   Why it fits: ITERATION is correct because algorithms often improve or compute results by performing the same step many times.

9. OBJECT · 6 letters · noun · intermediate
   Programming entity combining data with behavior

   Hint: It may have fields and methods.
   Why it fits: OBJECT fits because programs can represent things such as users, accounts, or sprites as units with properties and methods.

10. CLASS · 5 letters · noun · intermediate
    Blueprint for creating similar software objects

    Hint: Instances are made from this template.
    Why it fits: CLASS is correct because object-oriented languages use it to specify what related objects know and can do.

11. STACK · 5 letters · noun · intermediate
    Data structure where the newest item leaves first

    Hint: Think of plates added and removed from the top.
    Why it fits: STACK fits because programs use this structure for undo actions, function calls, and other nested tasks.

12. QUEUE · 5 letters · noun · intermediate
    Data structure where the earliest item leaves first

    Hint: A line at a ticket counter is the common analogy.
    Why it fits: QUEUE is correct because programs use this structure for tasks such as print jobs, event handling, and scheduling.

13. TREE · 4 letters · noun · advanced
    Hierarchical data structure with a root and children

    Hint: Folders inside folders form a familiar example.
    Why it fits: TREE fits because computer science uses this structure for filesystems, search, parsing, and decision processes.

14. GRAPH · 5 letters · noun · advanced
    Data structure of vertices connected by links

    Hint: Maps of routes and social networks can use it.
    Why it fits: GRAPH is correct because many computing problems model relationships as connected points and links.

15. NODE · 4 letters · noun · intermediate
    Point or item connected within a data structure

    Hint: Vertices in a network diagram are examples.
    Why it fits: NODE fits because algorithms often visit, store, or compare these elements while traversing a structure.

16. EDGE · 4 letters · noun · advanced
    Connection between two vertices in a network structure

    Hint: It may have a direction or weight.
    Why it fits: EDGE is correct because graph algorithms analyze these connections to find paths, costs, and relationships.

17. BINARY · 6 letters · adjective · introductory
    Using a base-two number system

    Hint: Computers represent many values with zeros and ones.
    Why it fits: BINARY fits because digital computers encode instructions, text, images, and numbers using patterns of bits.

18. CACHE · 5 letters · noun · advanced
    Small fast storage for recently used data

    Hint: It can reduce repeated slow lookups.
    Why it fits: CACHE is correct because hardware and software both use it to improve performance when the same data is needed again.

19. PROTOCOL · 8 letters · noun · advanced
    Agreed rules for communication between systems

    Hint: HTTP is one example on the web.
    Why it fits: PROTOCOL fits because networks depend on common formats and procedures so independent systems can understand one another.

20. ENCAPSULATION · 13 letters · noun · advanced
    Object-oriented practice of bundling data with controlled access

    Hint: It hides internal details behind methods.
    Why it fits: ENCAPSULATION is correct because it helps programmers manage complexity by exposing useful operations without revealing every implementation detail.

Accept a different answer only when it matches the clue, length, grammar, and any supplied crossings. Use the reviewed answer when teaching the intended vocabulary target.