1. What is Lazy evaluation ? Mid A. a strategy that delays computing an expression until its value is actually needed B. caching the result of a deferred or pure computation so repeated demands return the stored value without recomputing C. a strategy that computes an expression immediately when it is bound, regardless of whether the result is used D. a conceptually endless stream of values that can be defined and consumed piece by piece only because computation is deferred
2. Which term means: "a strategy that delays computing an expression until its value is actually needed"? Mid A. Eager evaluation B. Memoization C. Thunk D. Lazy evaluation
3. Which statement is correct? Mid A. Lazy evaluation — caching the result of a deferred or pure computation so repeated demands return the stored value without recomputing B. Lazy evaluation — a conceptually endless stream of values that can be defined and consumed piece by piece only because computation is deferred C. Lazy evaluation — a deferred computation wrapped as a zero-argument routine whose result is computed on first demand D. Lazy evaluation — a strategy that delays computing an expression until its value is actually needed
4. What is Eager evaluation ? Mid A. a strategy that delays computing an expression until its value is actually needed B. a conceptually endless stream of values that can be defined and consumed piece by piece only because computation is deferred C. a deferred computation wrapped as a zero-argument routine whose result is computed on first demand D. a strategy that computes an expression immediately when it is bound, regardless of whether the result is used
5. Which term means: "a strategy that computes an expression immediately when it is bound, regardless of whether the result is used"? Mid A. Infinite sequence B. Thunk C. Eager evaluation D. Lazy evaluation
6. Which statement is correct? Mid A. Eager evaluation — a strategy that computes an expression immediately when it is bound, regardless of whether the result is used B. Eager evaluation — a strategy that delays computing an expression until its value is actually needed C. Eager evaluation — caching the result of a deferred or pure computation so repeated demands return the stored value without recomputing D. Eager evaluation — a deferred computation wrapped as a zero-argument routine whose result is computed on first demand
7. What is Infinite sequence ? Senior A. a deferred computation wrapped as a zero-argument routine whose result is computed on first demand B. caching the result of a deferred or pure computation so repeated demands return the stored value without recomputing C. a strategy that computes an expression immediately when it is bound, regardless of whether the result is used D. a conceptually endless stream of values that can be defined and consumed piece by piece only because computation is deferred
8. Which term means: "a conceptually endless stream of values that can be defined and consumed piece by piece only because computation is deferred"? Senior A. Lazy evaluation B. Infinite sequence C. Thunk D. Eager evaluation
9. Which statement is correct? Senior A. Infinite sequence — caching the result of a deferred or pure computation so repeated demands return the stored value without recomputing B. Infinite sequence — a strategy that delays computing an expression until its value is actually needed C. Infinite sequence — a conceptually endless stream of values that can be defined and consumed piece by piece only because computation is deferred D. Infinite sequence — a deferred computation wrapped as a zero-argument routine whose result is computed on first demand
10. What is Thunk ? Senior A. caching the result of a deferred or pure computation so repeated demands return the stored value without recomputing B. a strategy that delays computing an expression until its value is actually needed C. a deferred computation wrapped as a zero-argument routine whose result is computed on first demand D. a strategy that computes an expression immediately when it is bound, regardless of whether the result is used
11. Which term means: "a deferred computation wrapped as a zero-argument routine whose result is computed on first demand"? Senior A. Lazy evaluation B. Eager evaluation C. Infinite sequence D. Thunk
12. Which statement is correct? Senior A. Thunk — a deferred computation wrapped as a zero-argument routine whose result is computed on first demand B. Thunk — a strategy that computes an expression immediately when it is bound, regardless of whether the result is used C. Thunk — a strategy that delays computing an expression until its value is actually needed D. Thunk — a conceptually endless stream of values that can be defined and consumed piece by piece only because computation is deferred
13. What is Memoization ? Senior A. caching the result of a deferred or pure computation so repeated demands return the stored value without recomputing B. a deferred computation wrapped as a zero-argument routine whose result is computed on first demand C. a conceptually endless stream of values that can be defined and consumed piece by piece only because computation is deferred D. a strategy that computes an expression immediately when it is bound, regardless of whether the result is used
14. Which term means: "caching the result of a deferred or pure computation so repeated demands return the stored value without recomputing"? Senior A. Eager evaluation B. Memoization C. Infinite sequence D. Lazy evaluation
15. Which statement is correct? Senior A. Memoization — caching the result of a deferred or pure computation so repeated demands return the stored value without recomputing B. Memoization — a conceptually endless stream of values that can be defined and consumed piece by piece only because computation is deferred C. Memoization — a strategy that delays computing an expression until its value is actually needed D. Memoization — a strategy that computes an expression immediately when it is bound, regardless of whether the result is used