3460:421 OOP Algorithmic Decomposition
Across
- 1. Parameters and local variables are ______ when the function is called
- 3. In decomposition, when performed correctly, the smaller parts are easier to _____
- 6. In C++ an IN parameter can be passed by _____
- 7. In decomposition, when performed correctly, the smaller parts are easier to _____
- 8. Part of the interface to a function
- 11. In decomposition, when performed correctly, the smaller parts are easier to _____
- 13. Kind of a parameter where data is passed only to the function
- 14. Hide the internal details of a function and only expose the minimal interface is _____ _____
- 15. Kind of a parameter where data is passed only back from the function
- 16. In decomposition, when performed correctly, the smaller parts are easier to _____
- 17. In decomposition, when performed correctly, the smaller parts are easier to _____
- 19. In decomposition, when performed correctly, the smaller parts are easier to _____
- 21. Part of the interface to a function is the _____ type
- 23. Generally something that algorithms are not concerned with, but code is
- 25. Algorithmic decomposition is a lower-level approach needed for ___/___
- 26. Algorithmic decomposition only _____ so far
Down
- 1. In C++ an IN parameter can be passed by ____ _____
- 2. In C++ an OUT parameter can be passed by _____
- 4. Breaking a complex problem or system into a collection of smaller parts
- 5. Breaking a complex algorithm into a collection of smaller algorithms
- 9. Has a high level of difficulty
- 10. In C++ an OUT parameter can be passed via a _____
- 11. Kind of a parameter where data is passed both to and from a function is ___/____
- 12. A possible tradeoff for decomposition
- 18. Parameters and local variables are _____ when the function call returns
- 20. Part of the interface to a function
- 22. In general, free functions do not have any internal "____" between calls
- 24. Has many parts