Unit 2 Programming Review

1234567891011121314151617181920212223242526
Across
  1. 3. The programming construct where instructions execute line-by-line from top to bottom.
  2. 6. A fundamental data type that can only hold the values True or False.
  3. 7. Step-by-step instructions designed to solve a problem or perform a task.
  4. 8. A sorting algorithm that repeatedly steps through a list and swaps adjacent elements.
  5. 9. A highly efficient search algorithm that requires the dataset to be sorted first.
  6. 14. Breaking a large complex problem down into smaller manageable sub-problems.
  7. 15. A data structure that operates on a First-In-First-Out basis.
  8. 17. A programming construct that repeats a block of code until a condition is met.
  9. 18. A type of data structure whose memory size is strictly fixed at compile time.
  10. 19. The strict set of grammatical rules that dictate how code must be written.
  11. 21. A data type consisting of a sequence of characters or text.
  12. 23. A programming technique where a function continuously calls itself until a base case is met.
  13. 24. A data structure that operates on a Last-In-First-Out basis.
  14. 25. A programming construct that uses branching logic like IF statements.
  15. 26. A simple search algorithm that checks every single item one by one.
Down
  1. 1. A file processing mode that safely adds new data to the end of an existing file.
  2. 2. The process of identifying, tracing, and fixing errors in computer code.
  3. 4. A named memory location used to store data that can change during execution.
  4. 5. The practice of dividing a program into separate, reusable functions.
  5. 10. A type of variable scope where the data is accessible from anywhere in the program.
  6. 11. A visual representation of a program's logic using standard shapes and arrows.
  7. 12. A type of variable scope where the data is only accessible within a specific function.
  8. 13. A runtime error that disrupts normal flow but can be safely caught and handled.
  9. 16. A measure of an algorithm's time and space scalability, evaluated using Big O notation.
  10. 20. Hiding or removing unnecessary details to focus on essential features.
  11. 22. A type of data structure that can flexibly resize itself during runtime.